Name
Abstract | ||
|---|---|---|
In this paper, the problem of time-varying actuator selection for linear dynamical systems is investigated. By leveraging recent advances in the graph sparsification literature, we develop a framework for designing a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using a polynomial-time algorithm. Current approaches based on polynomial time relaxations of the subset selection problem require an extra multiplicative factor of log n sensors/actuators times the minimal number in order to just maintain controllability/observability. In contrast, we show that there exists a polynomial-time actuator schedule that on average selects only a constant number of actuators at each time, to approximate the controllability/observability metrics of the system when all actuators/sensors are in use. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.23919/ECC.2018.8550198 | 2018 European Control Conference (ECC) |
Keywords | Field | DocType |
sparse actuator schedule,large-scale linear system,polynomial-time algorithm,polynomial time relaxations,subset selection problem,deterministic polynomial-time actuator scheduling,time-varying actuator selection,linear dynamical systems,graph sparsification literature,multiplicative factor,sensors,controllability-observability | Linear dynamical system,Approximation algorithm,Mathematical optimization,Observability,Linear system,Controllability,Computer science,Schedule,Time complexity,Sparse matrix | Conference |
ISBN | Citations | PageRank |
978-1-5386-5303-6 | 1 | 0.35 |
References | Authors | |
15 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milad Siami | 1 | 122 | 15.65 |
| Ali Jadbabaie | 2 | 4806 | 581.69 |