Abstract
The problem of reachable set estimation for linear delayed systems subject to polytopic uncertainties is revisited in this paper. The maximal Lyapunov–Krasovskii functional, combined with the free-weighting matrix technique, is utilized to derive a refined condition for a non-ellipsoidal reachable set bound. One of our discoveries is that the number of Lyapunov matrices can be chosen to be greater than the number of vertices for the uncertain polytope. Moreover, the choice of appropriate Lyapunov–Krasovskii functional candidate and the introduction of Leibniz–Newton formula lead to decoupling of the system matrices and the Lyapunov matrices. The useful term which was ignored in our previous result is retained. These treatments bring much tighter bound of the reachable set than the existing ones. Finally, the negligence in our previous paper is pointed out.
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.
