Paper Info
Title
The robust minimal controllability problem for switched linear continuous-time systems
Abstract
In this paper, we address the robust minimal controllability problem for switched linear continuous-time systems. The problem is to determine the minimal subset of state variables to actuate such that the switching linear system is controllable, under the scenario where a set of actuators may fail along the time. Two variations of this problem are considered, depending on whether we want to design an input matrix for each mode (i.e., a different set of actuators that may fail in each mode), or if we want to design a common input matrix common across all the modes, and a set of actuators may fail. In both cases, we want to ensure that, given an initial condition, we can drive the system towards any desired state. For both problems, we characterize the sparsest input matrices which ensure that the system is controllable, whenever the autonomous dynamics' matrix of each mode is simple, and for which a left-eigenbasis is available. We reduce these problems to set multi-covering problems, showing that using a sufficient condition for controllability, the first is NP-complete. These allow us to deploy known, close-to-optimal, polynomial algorithms approximating the solutions of the problems we study.
Year
DOI
Venue
2018
10.23919/ACC.2018.8431919
2018 Annual American Control Conference (ACC)
Keywords
Field
DocType
input matrix,multicovering problems,robust minimal controllability problem,switched linear continuous-time systems,minimal subset,switching linear system,state variables,NP-complete,polynomial algorithms
Linear system,Controllability,Matrix (mathematics),Control theory,Computer science,Robustness (computer science),State variable,Initial value problem,Polynomial algorithm,Actuator
Conference
ISSN
ISBN
Citations 
0743-1619
978-1-5386-5429-3
0
PageRank 
References 
Authors
0.34
9
3
Name
Order
Citations
PageRank
guilherme ramos1111.92
Sergio Daniel Pequito214620.72
Carlos Caleiro3144.23