Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
711367 | IFAC Proceedings Volumes | 2008 | 6 Pages |
Abstract
We consider Lyapunov stability of switched linear systems whose switching signal is constrained to a subset of indices. We propose a switching rule that chooses the most stable subsystem among those belonging to the subset. This rule is based on an ordering of the subsystems using a common Lyapunov function. We develop randomized algorithms for finding the ordering as well as for finding a subset of systems for which a common Lyapunov function exists. We show that the class of Las Vegas randomized algorithms is useful in the design.
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Hideaki Ishii, Roberto Tempo,