Name
Abstract | ||
|---|---|---|
We consider controllable linear discrete-time systems with bounded perturbations and present two methods to compute robust controlled invariant sets. The first method tolerates an arbitrarily small constraint violation to compute an arbitrarily precise outer approximation of the maximal robust controlled invariant set, while the second method provides an inner approximation. The outer approximation scheme is -complete, given that the constraint sets are formulated as finite unions of polytopes. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1109/TAC.2017.2672859 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Robustness,Trajectory,Approximation algorithms,Convergence,Linear systems,Force,Heuristic algorithms | Convergence (routing),Approximation algorithm,Mathematical optimization,Linear system,Robustness (computer science),Polytope,Invariant (mathematics),Mathematics,Trajectory,Bounded function | Journal |
Volume | Issue | ISSN |
abs/1601.00416 | 7 | 0018-9286 |
Citations | PageRank | References |
11 | 0.74 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matthias Rungger | 1 | 105 | 13.44 |
| Paulo Tabuada | 2 | 4281 | 264.80 |