Abstract
We present a new method for the approximation of the largest constraint admissible set (CAS) for linear continuous-time systems with state and input constraints. The CAS is the set of initial states for which the controlled system does not violate the input or state constraints. The presented approach is based on a suitable discretization of the continuous-time system. In fact, we will show that CAS in the continuous-time case can be computed analogously to the discrete-time case, given an appropriate sampling time was chosen. We stress that the computation of CAS for continuous-time systems is considerably more difficult than for discrete-time systems, since one has to guarantee that the system does not violate the constraints in between the sampling instances.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
