Abstract
In this paper we consider the l/sub 1/-state feedback problem with an internal stability constraint. In particular, we establish the connection between controlled-invariant contractive sets and static control laws that achieve a level of l/sub 1/ performance as well as a desired unforced rate of convergence. We outline two algorithms for computing controlled-invariant contractive sets. The first is a modification of standard recursive techniques used in the literature, whereas the second is based on dynamic games and involves solving an appropriate discrete Isaacs recursion. The latter approach results in a min-max characterization of l/sub 1/-state feedback controllers. We point out that the Isaacs recursion provides a one-shot (as opposed to iterative) computation of the optimal l/sub 1/ performance.
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.
