Performance and Robustness Analysis of Stochastic Jump Linear Systems using Wasserstein metric
arXiv:1403.2013 · doi:10.1016/j.automatica.2014.10.080
Abstract
This paper focuses on the performance and the robustness analysis of stochastic jump linear systems. The state trajectory under stochastic jump process becomes random variables, which brings forth the probability distributions in the system state. Therefore, we need to adopt a proper metric to measure the system performance with respect to stochastic switching. In this perspective, Wasserstein metric that assesses the distance between probability density functions is applied to provide the performance and the robustness analysis. Both the transient and steady-state performance of the systems with given initial state uncertainties can be measured in this framework. Also, we prove that the convergence of this metric implies the mean square stability. Overall, this study provides a unifying framework for the performance and the robustness analysis of general stochastic jump linear systems, but not necessarily Markovian jump process that is commonly used for stochastic switching. The practical usefulness and efficiency of the proposed method are verified through numerical examples.
Cited by in corpus (8)
- Stability Analysis of Large-Scale Distributed Networked Control Systems with Random Communication Delays: A Switched System Approach
- On the Convergence Analysis of Asynchronous Distributed Quadratic Programming via Dual Decomposition
- A Switched Dynamical System Framework for Analysis of Massively Parallel Asynchronous Numerical Algorithms
- Mean Square Stability for Stochastic Jump Linear Systems via Optimal Transport
- Convergence Analysis of Asynchronous Consensus in Discrete-time Multi-agent Systems with Fixed Topology
- Asynchronous Distributed Averaging: A Switched System Framework for Average Error Analysis
- Efficient Multi-Robot Exploration with Energy Constraint based on Optimal Transport Theory
- A Stabilizing Control Algorithm for Asynchronous Parallel Quadratic Programming via Dual Decomposition