Abstract
Summary This paper is concerned with the problem of reachable set estimation (RSE) for linear systems with time-varying delays and bounded peak inputs. The purpose is to find an ellipsoid that contains the system state in presence of all bounded peak inputs. First, the RSE problem for nominal time-delay systems is studied based on a relaxed Lyapunov–Krasovskii functional which does not require all the involved symmetric matrices to be positive definite. Delay-dependent and delay-rate-dependent conditions for the existence of a desired ellipsoid are obtained. Second, the RSE problem for time-delay systems with time-varying polytopic uncertainties is investigated. Under the assumption that the uncertain parameters are differentiable and their derivatives are bounded by known scalars, parameter-rate-dependent conditions for the existence of a desired ellipsoid are derived by using a parameter-dependent Lyapunov–Krasovskii functional. When the differentiability of the uncertain parameters is not taken into account, a common Lyapunov–Krasovskii functional is employed to tackle the addressed problem, and parameter-rate-independent conditions are presented. All the obtained conditions are given in terms of matrix inequalities, which become linear matrix inequalities when only one non-convex scalar is prescribed. Finally, the reduced conservatism of the obtained results in comparison with recent ones in the literature is shown through numerical examples. Copyright © 2015 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Robust and Nonlinear Control
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.