RT Conference Proceedings
T1 An algorithmic approach to stability verification of polyhedral switched systems
A1 Prabhakar, Pavithra
A1 García Soto, Miriam
AB We present an algorithmic approach for analyzing Lyapunov and asymptotic stability of polyhedral switched systems. A polyhedral switched system is a hybrid system in which the continuous dynamics is specified by polyhedral differential inclusions, the invariants and guards are specified by polyhedral sets and the switching between the modes do not involve reset of variables. The analysis consists of first constructing a finite weighted graph from the switched system and a finite partition of the state space, which represents a conservative approximation of the switched system. Then, the weighted graph is analyzed for certain structural properties, satisfaction of which implies stability. However, in the event that the weighted graph does not satisfy the properties, one cannot, in general, conclude that the system is not stable due to the conservativeness of the graph. Nevertheless, when the structural properties do not hold in the graph, a counterexample indicating a potential reason for the failure is returned. Further, a more precise approximation of the switched system can be constructed by considering a finer partition of the statespace in the construction of the finite weighted graph. We present experimental results on analyzing stability of switched systems using the above method.
YR 2014
FD 2014-06-04
LK https://hdl.handle.net/20.500.14352/114487
UL https://hdl.handle.net/20.500.14352/114487
LA eng
NO P. Prabhakar and M. G. Soto, "An algorithmic approach to stability verification of polyhedral switched systems," 2014 American Control Conference, Portland, OR, USA, 2014, pp. 2318-2323, doi: 10.1109/ACC.2014.6859056.keywords: {Switched systems;Switches;Asymptotic stability;Stability analysis;Heuristic algorithms;Lyapunov methods;Time-domain analysis;Stability of hybrid systems;Computational methods;Switched systems},
DS Docta Complutense
RD 7 abr 2025