DocumentCode :
700938
Title :
Complexity of elementary hybrid systems
Author :
Blondel, Vincent D. ; Tsitsiklis, John N.
Author_Institution :
Inst. of Math., Univ. of Liege, Liège, Belgium
fYear :
1997
fDate :
1-7 July 1997
Firstpage :
3007
Lastpage :
3012
Abstract :
In this paper, we consider simple classes of nonlinear systems and prove that basic questions related to their stability and controllability are either undecidable or computationally intractable (NP-hard). As a special case, we consider a class of "hybrid" systems in which the state space is partitioned into two halfspaces and the dynamics in each halfspace correspond to a different linear system.
Keywords :
computational complexity; continuous systems; controllability; discrete systems; nonlinear control systems; NP-hard; controllability; elementary hybrid system complexity; nonlinear systems; stability; state space partitioning; Asymptotic stability; Complexity theory; Controllability; Linear systems; Three-dimensional displays; Hybrid systems; computability; computational complexity; control; decidability; nonlinear systems;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Control Conference (ECC), 1997 European
Conference_Location :
Brussels
Print_ISBN :
978-3-9524269-0-6
Type :
conf
Filename :
7082569
Link To Document :
بازگشت