Abstract
AbstractThis paper presents an algorithm of computing the robust viability kernel for discrete‐time switched systems with arbitrary switching rule and bounded disturbance based on the robust one‐step set and Pontryagin difference. The algorithm can be implemented by performing the relevant set computations using polyhedral algebra and computational geometry software when switched systems are linear. In addition, we propose a method of computing inner approximation of the robust viability kernel for switched systems based on the set theory. The convergence of the iterative algorithm is proved using a null controllable set. Finally, two examples are provided to show the effectiveness of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.