2017
DOI: 10.1016/j.ifacol.2017.08.675
|View full text |Cite
|
Sign up to set email alerts
|

Reachability and Invariance for Linear Sampled–data Systems

Abstract: Abstract:We consider linear sampled-data dynamical systems subject to additive and bounded disturbances, and study properties of their forward and backward reach sets as well as robust positively invariant sets. We propose topologically compatible notions for the sampled-data forward and backward reachability as well as robust positive invariance. We also propose adequate notions for maximality and minimality of related robust positively invariant sets.Keywords: Reachability Analysis, Robust Positive Invarianc… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(5 citation statements)
references
References 17 publications
0
5
0
Order By: Relevance
“…where the constraints are based on the definition of RCI sets of sampled-data systems [55]. The condition in (10b) ensures invariance of ŜRCI ; moreover, satisfaction of the state and input constraints in between sampling times is enforced by the constraints in (10c) and (10d), respectively.…”
Section: Solution Conceptmentioning
confidence: 99%
“…where the constraints are based on the definition of RCI sets of sampled-data systems [55]. The condition in (10b) ensures invariance of ŜRCI ; moreover, satisfaction of the state and input constraints in between sampling times is enforced by the constraints in (10c) and (10d), respectively.…”
Section: Solution Conceptmentioning
confidence: 99%
“…2 proceeds in two steps. First, two zonotope sequences are computed that converge to an overapproximation of the discrete-time minimal robust positively invariant (mRPI) set [11]. Second, the zonotope order of this over-approximation is reduced as much as possible while ensuring that the constraints in (11b) and (11c) are satisfied.…”
Section: A Safe Terminal Setmentioning
confidence: 99%
“…We denote these zonotope sequences by Z {0} (•) and Z X (•). Because the feedback matrix K in (10) is stabilizing, Z {0} (•) and Z X (•) would converge to the discretetime mRPI set [11], if no over-approximation of reachable sets to reduce computational complexity was used. To achieve low computation times, we use a simple convergence criterion in line 4 based on the directed Hausdorff distance in (1).…”
Section: Algorithm 2 Safe Terminal Setmentioning
confidence: 99%
See 1 more Smart Citation
“…First, we compute a small safe terminal set Ω(t k ) containing the origin, which is typically not invariant but can be safely steered into itself in finite time and is closely related to the minimal RPI set [42]. In particular, we determine some finite i k ∈ N >0 so that E(t k+i k ) ⊆ E(t k ) and…”
Section: B Safe Terminal Sets and Controllersmentioning
confidence: 99%