2002
DOI: 10.1109/tac.2002.1000269
|View full text |Cite
|
Sign up to set email alerts
|

Consistent abstractions of affine control systems

Abstract: Abstract-In this paper, we consider the problem of constructing abstractions of affine control systems that preserve reachability properties, and, in particular, local accessibility. In this framework, showing local accessibility of the higher level, abstracted model is equivalent to showing local accessibility of the, more detailed, lower level model. Given an affine control system and a smooth surjective map, we present a canonical construction for extracting an affine control system describing the trajector… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
51
0

Year Published

2005
2005
2022
2022

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 76 publications
(53 citation statements)
references
References 31 publications
1
51
0
Order By: Relevance
“…It is a concept used widely in computer science, formally described in terms of a bisimulation relation [10]. In [13]- [15], (purely) continuous systems are related to each other in terms of their vector fields: the vector field of the quotient system is the image of that of the original system under a surjective (Φ) map. The link between this form of abstraction and the notion of bisimulation is made clearly (for the linear case) in [12] and (for the nonlinear case) in [17], [20].…”
Section: Introductionmentioning
confidence: 99%
“…It is a concept used widely in computer science, formally described in terms of a bisimulation relation [10]. In [13]- [15], (purely) continuous systems are related to each other in terms of their vector fields: the vector field of the quotient system is the image of that of the original system under a surjective (Φ) map. The link between this form of abstraction and the notion of bisimulation is made clearly (for the linear case) in [12] and (for the nonlinear case) in [17], [20].…”
Section: Introductionmentioning
confidence: 99%
“…Assumption A.II greatly simplifies the relation between state/inputs of Σ M and state/inputs of Σ N . In particular, it reduces the construction of φ-related control systems given in [PS02] to the sequence of seven steps described in the following construction: Construction 2.7 Input: Affine distribution A M satisfying Assumptions A.I and A.II with respect to surjective submersion φ : M → N .…”
Section: Theorem 24 ([Pls00])mentioning
confidence: 99%
“…problem was addressed in [PS02] by constructing the smallest affine distribution on N containing T φ(A M ). The resulting distribution adds new directions of motion to control system Σ N allowing for trajectories that are not refinable.…”
Section: Theorem 32 (Hierarchical Trajectory Refinement)mentioning
confidence: 99%
See 2 more Smart Citations