Abstract
AbstractThis article investigates the problem of reachable set estimation for linear discrete‐time systems (LDSs) with both discrete and distributed delays as well as bounded disturbance inputs. The purpose is to determine a bounded set in which all the LDSs states are in the set. By exploiting Wirtinger‐based summation inequality and linear matrix inequalities techniques, a sufficient criterion is established which guarantees the states of LDSs are bounded by the ellipsoid. An improved Lyapunov–Krasovskii (L‐K) functional is addressed and the L‐K functional matrices are not required all to be positive definite. Finally, the effectiveness and superiority of the proposed methods are substantiated by two numerical examples.
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.
