Complexity of stability and controllability of elementary hybrid systems

被引：147

作者：

Blondel, VD

Tsitsiklis, JN

机构：

[1] Univ Liege, Inst Math B37, B-4000 Liege, Belgium

[2] MIT, Informat & Decis Syst Lab, Cambridge, MA 02139 USA

来源：

AUTOMATICA | 1999年 / 35卷 / 03期

关键词：

hybrid systems; nonlinear systems; control; decidability; computability; computational complexity; NP-hard;

D O I：

10.1016/S0005-1098(98)00175-7

中图分类号：

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

学科分类号：

0812 ;

摘要：

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 stale space is partitioned into two halfspaces, and the dynamics in each halfspace correspond to a different linear system. (C) 1999 Elsevier Science Ltd. All rights reserved.

引用

页码：479 / 489

页数：11

共 25 条

[21] NON-LINEAR REGULATION - THE PIECEWISE LINEAR-APPROACH [J].