Polyhedral approximation method for reachable sets of linear delay systems. Issue 12 (7th July 2020)

• Record Type: Journal Article
• Authors: Hu, Renhong; Shao, Lizhen; Cong, Yuhao
• Is Part Of: IET control theory & applications. Volume 14:Issue 12(2020)
• Page Start: 1548
• Page End: 1556
• Publication Date: 2020-07-07
• Subjects: convex programming -- delay systems -- linear systems -- interpolation -- optimisation -- approximation theory -- delays; polyhedral approximation method -- reachable sets -- linear delay systems -- continuous linear system -- multiple delays -- linear interpolation -- discrete reachable -- approximation error -- approximation quality -- linear delay control systems; Control theory -- Periodicals; Automatic control -- Periodicals; 629.8312
• DOI: 10.1049/iet-cta.2019.0841
• Languages: English
• ISSNs: 1751-8644

Abstract

Abstract : In this study, a polyhedral approximation method for reachable sets of linear delay systems is investigated. For a continuous linear system with multiple delays, the first Euler scheme combining with linear interpolation is used to transform it into a discrete one. Then a polyhedral approximation method based on optimisation techniques is proposed to compute the discrete reachable set. By specifying an approximation error and solving a finite number of convex optimisation problems, a polyhedron can be constructed as the approximation of the discrete reachable set. The approximation quality measured in Hausdorff distance can be directly controlled. Next, illustrated examples are given to demonstrate the effectiveness of the proposed method. Finally, the authors show some reachable sets of linear delay control systems, and they compare the proposed method with some other methods in the literature. Numerical results clearly show the superior performance of the proposed method.