Stabilization and control Lyapunov functions for language constrained discrete-time switched linear systems

被引：29

作者：

Fiacchini, Mirko ^{[1
]}

Jungers, Marc ^{[2
,3
]}

Girard, Antoine ^{[4
]}

机构：

[1] Univ Grenoble Alpes, CNRS, Grenoble INP, GIPSA Lab, F-38000 Grenoble, France

[2] Univ Lorraine, CRAN, UMR 7039, 2 Ave Foret de Haye, F-54516 Vandoeuvre Les Nancy, France

[3] CNRS, CRAN, UMR 7039, Paris, France

[4] Univ Paris Saclay, Univ Paris Sud, Cent Supelec, L2S,CNRS, 3 Rue Joliot Curie, F-91192 Gif Sur Yvette, France

来源：

AUTOMATICA | 2018年 / 93卷

关键词：

Switched linear systems; Set-theory; Stabilizability; Automata; STABILITY; STABILIZABILITY;

D O I：

10.1016/j.automatica.2018.03.039

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, the stabilizability of discrete-time switched linear systems subject to constraints on the switching law is considered. The admissible switching sequences are given by the language generated by a nondeterministic finite state automaton. Constructive necessary and sufficient conditions for recurrent stabilizability are given and the exact relations with the existence of control Lyapunov functions and with general stabilizability are provided. The dependence of stabilizability on the automaton initial state is also proved. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：64 / 74

页数：11

共 26 条

[1] JOINT SPECTRAL RADIUS AND PATH-COMPLETE GRAPH LYAPUNOV FUNCTIONS [J].