Abstract

The problem of reachable set estimation of linear uncertain polytopic time-varying delay systems subject to bounded peak inputs is studied in this paper. The delays considered in this paper are assumed to be non-differentiable and vary within an interval where the lower and upper bounds are known. Based on the Lyapunov–Krasovskii method and delay decomposition technique, a sufficient condition for the existence of a ball that bounds the reachable set of the system is proposed in terms of matrix inequalities containing only one scalar which can be solved by using an one-dimensional search method and Matlab’s LMI Toolbox and allow us to find the smallest radius. A numerical example is given to illustrate the effectiveness of the proposed result.

Full Text
Paper version not known

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 call

Disclaimer: 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.