Further Results on Reachable Set Bounding for Discrete-Time System with Time-Varying Delay and Bounded Disturbance Inputs

Wei Kang, Hao Chen, Kaibo Shi and Jun Cheng

Complexity, 2018, vol. 2018, 1-11

Abstract:

This paper investigates the problem of reachable set bounding for discrete-time system with time-varying delay and bounded disturbance inputs. Together with a new Lyapunov-Krasovskii functional, discrete Wirtinger-based inequality, and reciprocally convex approach, sufficient conditions are derived to find an ellipsoid to bound the reachable sets of discrete-time delayed system. The main advantage of this paper lies in two aspects: first, the initial state vectors are not necessarily zero; second, the obtained criteria in this paper do not really require all the symmetric matrices involved in the employed Lyapunov-Krasovskii functional to be positive definite. Finally, two numerical examples are provided to illustrate the effectiveness of the proposed method.

Date: 2018
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2018/9259284.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2018/9259284.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9259284

DOI: 10.1155/2018/9259284

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().