Mode Reduction for Markov Jump Systems

05/05/2022
by   Zhe Du, et al.
0

Switched systems are capable of modeling processes with underlying dynamics that may change abruptly over time. To achieve accurate modeling in practice, one may need a large number of modes, but this may in turn increase the model complexity drastically. Existing work on reducing system complexity mainly considers state space reduction, yet reducing the number of modes is less studied. In this work, we consider Markov jump linear systems (MJSs), a special class of switched systems where the active mode switches according to a Markov chain, and several issues associated with its mode complexity. Specifically, inspired by clustering techniques from unsupervised learning, we are able to construct a reduced MJS with fewer modes that approximates well the original MJS under various metrics. Furthermore, both theoretically and empirically, we show how one can use the reduced MJS to analyze stability and design controllers with significant reduction in computational cost while achieving guaranteed accuracy.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2022

Information-Theoretic Reduction of Markov Chains

We survey information-theoretic approaches to the reduction of Markov ch...
research
11/10/2020

Mode hunting through active information

We propose a new method to find modes based on active information. We de...
research
11/13/2021

Identification and Adaptive Control of Markov Jump Systems: Sample Complexity and Regret Bounds

Learning how to effectively control unknown dynamical systems is crucial...
research
09/09/2020

Using Spectral Submanifolds for Optimal Mode Selection in Model Reduction

Model reduction of large nonlinear systems often involves the projection...
research
07/05/2021

An Information-Theoretic Approach for Automatically Determining the Number of States when Aggregating Markov Chains

A fundamental problem when aggregating Markov chains is the specificatio...
research
10/02/2020

Data-driven model reduction for stochastic Burgers equations

We present a class of efficient parametric closure models for 1D stochas...
research
04/17/2017

Learning Linear Feature Space Transformations in Symbolic Regression

We propose a new type of leaf node for use in Symbolic Regression (SR) t...

Please sign up or login with your details

Forgot password? Click here to reset