For access to this article, please select a purchase option:
IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.
Your recommendation has been sent to your librarian.
The reachable set estimation for linear systems subject to both discrete and distributed delays is considered in this study. By choosing appropriate Lyapunov–Krasovkii functionals, some sufficient conditions are established to guarantee that all the states starting from the origin are bounded by an ellipsoid. The problem of finding the smallest possible ellipsoid can be transformed into an optimisation problem with matrix inequality constraints. Moreover, the computational complexity is reduced since fewer variables are involved in the obtained results. These criteria are further extended to systems with polytopic uncertainties. It is shown that in the absence of distributed delay, the obtained condition is also less conservative than the existing ones.
Inspec keywords: optimisation; Lyapunov methods; estimation theory; set theory; distributed control; computational complexity; delays; matrix algebra; reachability analysis; discrete time systems; linear systems
Other keywords:
Subjects: Combinatorial mathematics; Stability in control theory; Other topics in statistics; Computational complexity; Multivariable control systems; Optimisation techniques; Discrete control systems; Distributed parameter control systems