Abstract
This paper investigates the reachable set estimation problem for discrete-time Markov jump LPV systems with time-varying delays and bounded disturbance. The main consideration is that under zero initial conditions, how to obtain a bound set as small as possible that includes system states. Based on this, by applying a novel summation inequality integrated with the reciprocally convex approach under the framework of the Lyapunov functional method, the delay-dependent conditions are provided to guarantee the presence of an ellipsoid that bounds the system state in the existence of bounded disturbances. Some derived conditions expressed by linear matrix inequalities can be solved via utilizing different computational tools, and the minimum possible ellipsoidal bound can also be determined. Additionally, the obtained results are extensively used in the case with partially known transition probability, and some conditions with more universality are derived. Finally, a numerical example is given to illustrate the effectiveness of the results.
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.
