Open AccessPartial state bounding with a pre‐specified time of non‐linear discrete systems with time‐varying delays
Author(s) -
Thanh Nam Phan,
Nishantha Pathirana Pubudu,
Trinh Hieu
Publication year - 2016
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2015.1251
Subject(s) - bounding overwatch , infimum and supremum , discrete time and continuous time , mathematics , state (computer science) , control theory (sociology) , function (biology) , fractal , linear programming , mathematical optimization , computer science , algorithm , discrete mathematics , mathematical analysis , artificial intelligence , statistics , control (management) , evolutionary biology , biology
In this study, the authors address a new problem of finding, with a pre‐specified time, bounds of partial states of non‐linear discrete systems with a time‐varying delay. A novel computational method for deriving the smallest bounds is presented. The method is based on a new comparison principle, a new algorithm for finding the infimum of a fractal function, and linear programming. The effectiveness of our obtained results is illustrated through a numerical example.