The complexity of deciding controllability

Matthias Kawski

doi:10.1016/0167-6911(90)90038-V

The complexity of deciding controllability

Matthias Kawski

Mathematical and Statistical Sciences, School of (SoMSS)

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

It is shown that the problem of deciding whether a control system is small-time locally controllable or not is NP-hard. This is an extension of a recent paper by Sontag to single-input systems and to bounded controls.

Original language	English (US)
Pages (from-to)	9-14
Number of pages	6
Journal	Systems and Control Letters
Volume	15
Issue number	1
DOIs	https://doi.org/10.1016/0167-6911(90)90038-V
State	Published - Jul 1990

Keywords

Local controllability
complexity
nonlinear control

ASJC Scopus subject areas

Control and Systems Engineering
Computer Science(all)
Mechanical Engineering
Electrical and Electronic Engineering

Access to Document

10.1016/0167-6911(90)90038-V

Cite this

@article{d26fa15eae314a40953b8b5181214bac,

title = "The complexity of deciding controllability",

abstract = "It is shown that the problem of deciding whether a control system is small-time locally controllable or not is NP-hard. This is an extension of a recent paper by Sontag to single-input systems and to bounded controls.",

keywords = "Local controllability, complexity, nonlinear control",

author = "Matthias Kawski",

note = "Funding Information: * This work was partially supported by NSF-grant DMS 880-5815. This paper was presented at the MTNS 89 con-ference in Amsterdam.",

year = "1990",

month = jul,

doi = "10.1016/0167-6911(90)90038-V",

language = "English (US)",

volume = "15",

pages = "9--14",

journal = "Systems and Control Letters",

issn = "0167-6911",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

T1 - The complexity of deciding controllability

AU - Kawski, Matthias

N1 - Funding Information: * This work was partially supported by NSF-grant DMS 880-5815. This paper was presented at the MTNS 89 con-ference in Amsterdam.

PY - 1990/7

Y1 - 1990/7

N2 - It is shown that the problem of deciding whether a control system is small-time locally controllable or not is NP-hard. This is an extension of a recent paper by Sontag to single-input systems and to bounded controls.

AB - It is shown that the problem of deciding whether a control system is small-time locally controllable or not is NP-hard. This is an extension of a recent paper by Sontag to single-input systems and to bounded controls.

KW - Local controllability

KW - complexity

KW - nonlinear control

UR - http://www.scopus.com/inward/record.url?scp=0025464554&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0025464554&partnerID=8YFLogxK

U2 - 10.1016/0167-6911(90)90038-V

DO - 10.1016/0167-6911(90)90038-V

M3 - Article

AN - SCOPUS:0025464554

SN - 0167-6911

VL - 15

SP - 9

EP - 14

JO - Systems and Control Letters

JF - Systems and Control Letters

IS - 1

ER -

The complexity of deciding controllability

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this