Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems with Parametric and Additive Uncertainties

Fuente: arXiv
Enregistré dans:
Détails bibliographiques
Auteurs principaux: Dey, Anchita, Bhasin, Shubhendu
Format: Preprint
Publié: 2024
Sujets:
Accès en ligne:
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
_version_ 1866929399337582592
author Dey, Anchita
Bhasin, Shubhendu
author_facet Dey, Anchita
Bhasin, Shubhendu
contents In this paper, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and input are subjected to hard constraints, and the system parameters and the exogenous disturbance are assumed to belong to known convex polytopes. We provide necessary and sufficient conditions for the existence of the non-empty MARPI set, and explore relevant features of the set that lead to an efficient finite-time converging algorithm with a suitable stopping criterion. The analysis hinges on backward reachable sets defined using recursively computed halfspaces and the minimal RPI set. A numerical example is used to validate the theoretical development.
format Preprint
id arxiv_https___arxiv_org_abs_2406_00355
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems with Parametric and Additive Uncertainties
Dey, Anchita
Bhasin, Shubhendu
Optimization and Control
Systems and Control
In this paper, we address the problem of computing the maximal admissible robust positive invariant (MARPI) set for discrete-time linear time-varying systems with parametric uncertainties and additive disturbances. The system state and input are subjected to hard constraints, and the system parameters and the exogenous disturbance are assumed to belong to known convex polytopes. We provide necessary and sufficient conditions for the existence of the non-empty MARPI set, and explore relevant features of the set that lead to an efficient finite-time converging algorithm with a suitable stopping criterion. The analysis hinges on backward reachable sets defined using recursively computed halfspaces and the minimal RPI set. A numerical example is used to validate the theoretical development.
title Computation of Maximal Admissible Robust Positive Invariant Sets for Linear Systems with Parametric and Additive Uncertainties
topic Optimization and Control
Systems and Control
url https://arxiv.org/abs/2406.00355