Invariant approximations of the minimal robust positively Invariant set

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Please contact us in case of a broken link from here

Authors S.V. Rakovic, E.C. Kerrigan, K.I. Kouramas, D.Q. Mayne
Journal/Conference Name IEEE Transactions on Automatic Control
Paper Category
Paper Abstract This note provides results on approximating the minimal robust positively invariant (mRPI) set (also known as the 0-reachable set) of an asymptotically stable discrete-time linear time-invariant system. It is assumed that the disturbance is bounded, persistent and acts additively on the state and that the constraints on the disturbance are polyhedral. Results are given that allow for the computation of a robust positively invariant, outer approximation of the mRPI set. Conditions are also given that allow one to a priori specify the accuracy of this approximation.
Date of publication 2005
Code Programming Language Python
Comment

Copyright Researcher 2022