By Topic

[Brief Paper] Reachable set estimation for linear systems in the presence of both discrete and distributed delays

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Z. Zuo ; Tianjin Key Laboratory of Process Measurement and Control, School of Electrical Engineering and Automation, Tianjin University, Tianjin 300072, People's Republic of China; Department of Mathematics, City University of Hong Kong, Kowloon, Hong Kong ; D. W. C. Ho ; Y. Wang

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.

Published in:

IET Control Theory & Applications  (Volume:5 ,  Issue: 15 )