Analysis and synthesis of randomly switched systems with known sojourn probabilities

Tian, Engang, Yue, Dong and Yang, Tai-cheng (2014) Analysis and synthesis of randomly switched systems with known sojourn probabilities. Information Sciences, 277. pp. 481-491. ISSN 0020-0255

[img] PDF - Accepted Version
Available under License Creative Commons Attribution-NonCommercial No Derivatives.

Download (188kB)

Abstract

In this paper, a new approach is proposed and investigated for the stability analysis and stabilizing controller design of randomly switched linear discrete systems. The approach is based on sojourn probabilities and it is assumed that these probabilities are known a prior. A new Lyapunov functional is constructed and two main theorems are proved in this paper. Theorem 1 gives a sufficient condition for a switched system with known sojourn probabilities to be mean square stable. Theorem 2 gives a sufficient condition for the design of a stabilizing controller. The applications of these theorems and the corresponding corollary and lemma are demonstrated by three numerical examples. Finally, some future research is proposed.

Item Type: Article
Schools and Departments: School of Engineering and Informatics > Engineering and Design
Depositing User: Tai Yang
Date Deposited: 16 Feb 2018 12:54
Last Modified: 16 Feb 2018 12:54
URI: http://sro.sussex.ac.uk/id/eprint/73621

View download statistics for this item

📧 Request an update