Algebraic necessary and sufficient conditions for the controllability of conewise linear systems

M.K. Camlibel, W.P.M.H. Heemels, J.M. Schumacher

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The problem of checking certain controllability properties of even very simple piecewise linear systems is known to be undecidable. This paper focuses on conewise linear systems, i.e., systems for which the state space is partitioned into conical regions and a linear dynamics is active on each of these regions. For this class of systems, we present algebraic necessary and sufficient conditions for controllability. We also show that the classical results of controllability of linear systems and input-constrained linear systems can be recovered from our main result. Our treatment employs tools both from geometric control theory and mathematical programming.
Original languageEnglish
Pages (from-to)762-774
JournalIEEE Transactions on Automatic Control
Volume53
Publication statusPublished - 2008

Fingerprint

Controllability
Linear systems
Mathematical programming
Control theory

Cite this

Camlibel, M.K. ; Heemels, W.P.M.H. ; Schumacher, J.M. / Algebraic necessary and sufficient conditions for the controllability of conewise linear systems. In: IEEE Transactions on Automatic Control. 2008 ; Vol. 53. pp. 762-774.
@article{54e5b6a5d3864e8a9f7a2582a1133987,
title = "Algebraic necessary and sufficient conditions for the controllability of conewise linear systems",
abstract = "The problem of checking certain controllability properties of even very simple piecewise linear systems is known to be undecidable. This paper focuses on conewise linear systems, i.e., systems for which the state space is partitioned into conical regions and a linear dynamics is active on each of these regions. For this class of systems, we present algebraic necessary and sufficient conditions for controllability. We also show that the classical results of controllability of linear systems and input-constrained linear systems can be recovered from our main result. Our treatment employs tools both from geometric control theory and mathematical programming.",
author = "M.K. Camlibel and W.P.M.H. Heemels and J.M. Schumacher",
year = "2008",
language = "English",
volume = "53",
pages = "762--774",
journal = "IEEE Transactions on Automatic Control",
issn = "0018-9286",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

Algebraic necessary and sufficient conditions for the controllability of conewise linear systems. / Camlibel, M.K.; Heemels, W.P.M.H.; Schumacher, J.M.

In: IEEE Transactions on Automatic Control, Vol. 53, 2008, p. 762-774.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Algebraic necessary and sufficient conditions for the controllability of conewise linear systems

AU - Camlibel, M.K.

AU - Heemels, W.P.M.H.

AU - Schumacher, J.M.

PY - 2008

Y1 - 2008

N2 - The problem of checking certain controllability properties of even very simple piecewise linear systems is known to be undecidable. This paper focuses on conewise linear systems, i.e., systems for which the state space is partitioned into conical regions and a linear dynamics is active on each of these regions. For this class of systems, we present algebraic necessary and sufficient conditions for controllability. We also show that the classical results of controllability of linear systems and input-constrained linear systems can be recovered from our main result. Our treatment employs tools both from geometric control theory and mathematical programming.

AB - The problem of checking certain controllability properties of even very simple piecewise linear systems is known to be undecidable. This paper focuses on conewise linear systems, i.e., systems for which the state space is partitioned into conical regions and a linear dynamics is active on each of these regions. For this class of systems, we present algebraic necessary and sufficient conditions for controllability. We also show that the classical results of controllability of linear systems and input-constrained linear systems can be recovered from our main result. Our treatment employs tools both from geometric control theory and mathematical programming.

M3 - Article

VL - 53

SP - 762

EP - 774

JO - IEEE Transactions on Automatic Control

JF - IEEE Transactions on Automatic Control

SN - 0018-9286

ER -