A One-Step Approach to Computing a Polytopic Robust Positively Invariant Set

From MaRDI portal
Publication:2979362

DOI10.1109/TAC.2016.2541300zbMATH Open1359.93404arXiv1504.06488OpenAlexW1870770210MaRDI QIDQ2979362FDOQ2979362


Authors: Paul A. Trodden Edit this on Wikidata


Publication date: 3 May 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Abstract: A procedure and theoretical results are presented for the problem of determining a minimal robust positively invariant (RPI) set for a linear discrete-time system subject to unknown, bounded disturbances. The procedure computes, via the solving of a single LP, a polytopic RPI set that is minimal with respect to the family of RPI sets generated from a finite number of inequalities with pre-defined normal vectors.


Full work available at URL: https://arxiv.org/abs/1504.06488







Cited In (14)





This page was built for publication: A One-Step Approach to Computing a Polytopic Robust Positively Invariant Set

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2979362)