A One-Step Approach to Computing a Polytopic Robust Positively Invariant Set
- Submitting institution
-
The University of Sheffield
- Unit of assessment
- 12 - Engineering
- Output identifier
- 2698
- Type
- D - Journal article
- DOI
-
10.1109/TAC.2016.2541300
- Title of journal
- IEEE Transactions on Automatic Control
- Article number
- -
- First page
- 4100
- Volume
- 61
- Issue
- 12
- ISSN
- 0018-9286
- Open access status
- Out of scope for open access requirements
- Month of publication
- March
- Year of publication
- 2016
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
0
- Research group(s)
-
-
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Invariant sets are widely studied in systems and control, being of fundamental importance in analysis and design, e.g. model predictive controllers use them as design constituents to provide stability guarantees. This paper rigorously demonstrates for the first time that a robust invariant set for an uncertain linear system can be computed exactly by solving a single linear programming (LP) problem. This usurps previous understanding and application in state-of-the-art methods which held that solving a finite (but unknown in advance) number of LPs was required. The outcome reduces computation time by several orders of magnitude and has been adopted by doi.org/10.1016/j.automatica.2018.12.037.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -