Probabilistic robustness analysis: explicit bounds for the minimum number of samples
Systems & Control Letters
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Probability and Computing: Randomized Algorithms and Probabilistic Analysis
Survey Research on gain scheduling
Automatica (Journal of IFAC)
Analysis and synthesis of switched linear control systems
Automatica (Journal of IFAC)
Probabilistic design of LPV control systems
Automatica (Journal of IFAC)
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
Randomized Algorithms for Analysis and Control of Uncertain Systems: With Applications
Survey paper: Research on probabilistic methods for control system design
Automatica (Journal of IFAC)
| Hi-index | 22.15 |
In this paper, 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. It is shown that the class of randomized algorithms known as the Las Vegas type is useful in the design procedure. A third-order example illustrating the efficacy of the approach is presented.