Complexity of stability and controllability of elementary hybrid systems

Blondel, Vincent;Tsitsiklis, John N.
(1999) Automatica — Vol. 35, n° 3, p. 479-489 (1999)

Files

pdfdocument.pdf
  • Restricted Access
  • Adobe PDF
  • 186 KB
Request a copy

Details

Authors
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.
Affiliations
  • Université de LiègeInstitut de mathématiques
  • MITLIDS

Citations

  • APA
  • Chicago
  • FWB

Blondel, V., & Tsitsiklis, J. N. (1999). Complexity of stability and controllability of elementary hybrid systems. Automatica, 35(3), 479-489. https://doi.org/10.1016/S0005-1098(98)00175-7 (Original work published 1999)