This book provides robust analysis and synthesis tools for Markovian jump systems in the finite-time domain with specified performances. It explores how these tools can make the systems more applicable to fields such as economic systems, ecological systems and solar thermal central receivers, by limiting system trajectories in the desired bound in a given time interval.
Robust Control for Discrete-Time Markovian Jump Systems in the Finite-Time Domain focuses on multiple aspects of finite-time stability and control, including:
and also provides many methods and algorithms to solve problems related to Markovian jump systems with simulation examples that illustrate the design procedure and confirm the results of the methods proposed.
The thorough discussion of these topics makes the book a useful guide for researchers, industrial engineers and graduate students alike, enabling them systematically to establish the modeling, analysis and synthesis for Markovian jump systems in the finite-time domain.
Robust Control for Discrete-Time Markovian Jump Systems in the Finite-Time Domain focuses on multiple aspects of finite-time stability and control, including:
- finite-time H-infinity control;
- finite-time sliding mode control;
- finite-time multi-frequency control;
- finite-time model predictive control; and
- high-order moment finite-time control for multi-mode systems
and also provides many methods and algorithms to solve problems related to Markovian jump systems with simulation examples that illustrate the design procedure and confirm the results of the methods proposed.
The thorough discussion of these topics makes the book a useful guide for researchers, industrial engineers and graduate students alike, enabling them systematically to establish the modeling, analysis and synthesis for Markovian jump systems in the finite-time domain.
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.