2013
DOI: 10.1016/j.automatica.2013.03.020
|View full text |Cite
|
Sign up to set email alerts
|

Lagrangian methods for approximating the viability kernel in high-dimensional systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

1
126
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 122 publications
(130 citation statements)
references
References 18 publications
1
126
0
Order By: Relevance
“…This is a fair assumption because we are mainly concerned with discrete-time systems that arise from the discretization of continuous time systems. Such systems have a dynamics matrix of the form A = exp(A c ) which is always invertible [3]. Following computation algorithm in [7], we can find this reachable set using zonotopes by…”
Section: Viability Theory Background a Viability Theory Conceptsmentioning
confidence: 99%
See 2 more Smart Citations
“…This is a fair assumption because we are mainly concerned with discrete-time systems that arise from the discretization of continuous time systems. Such systems have a dynamics matrix of the form A = exp(A c ) which is always invertible [3]. Following computation algorithm in [7], we can find this reachable set using zonotopes by…”
Section: Viability Theory Background a Viability Theory Conceptsmentioning
confidence: 99%
“…Viability is a theory that until now has mostly used in safety verification in control systems [3]. Viability theory has also been found useful in areas different from automatic control as e.g.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…Non-Lyapunov methods also exist for estimating the RA [12]- [14]. Among these approaches, the backward reachable sets approach provides the domain from which the trajectories of a system converge to some selected target set, thus making it useful for estimating the RA of a given…”
Section: Introductionmentioning
confidence: 99%
“…In [20], a Lagrangian method is proposed for computing the viability kernel via ellipsoidal representation. In [14], this method is extended by using polytopic and support vector representations. However, the problem of estimating and enlarging the RA is rarely considered via backward reachable sets.…”
Section: Introductionmentioning
confidence: 99%