Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds
@article{Siami2021DeterministicAR, title={Deterministic and Randomized Actuator Scheduling With Guaranteed Performance Bounds}, author={M. Siami and A. Olshevsky and A. Jadbabaie}, journal={IEEE Transactions on Automatic Control}, year={2021}, volume={66}, pages={1686-1701} }
In this article, we investigate the problem of actuator selection for linear dynamical systems. We develop a framework to design a sparse actuator schedule for a given large-scale linear system with guaranteed performance bounds using deterministic polynomial-time and randomized approximately linear-time algorithms. First, we introduce systemic controllability metrics for linear dynamical systems that are monotone and homogeneous with respect to the controllability Gramian. We show that several… Expand
Figures, Tables, and Topics from this paper
16 Citations
A Separation Theorem for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds
- Computer Science, Engineering
- Autom.
- 2020
- PDF
A Separation Principle for Joint Sensor and Actuator Scheduling with Guaranteed Performance Bounds
- Computer Science
- 2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019
- 1
Time-Varying Sensor and Actuator Selection for Uncertain Cyber-Physical Systems
- Computer Science, Mathematics
- IEEE Transactions on Control of Network Systems
- 2019
- 21
- PDF
Controllability of Linear Dynamical Systems Under Input Sparsity Constraints
- Computer Science, Engineering
- IEEE Transactions on Automatic Control
- 2021
- 4
- PDF
Matroid-Constrained Approximately Supermodular Optimization for Near-Optimal Actuator Scheduling
- Computer Science
- 2019 IEEE 58th Conference on Decision and Control (CDC)
- 2019
- 3
- PDF
Controllability of a Linear System with Nonnegative Sparse Controls
- Computer Science, Engineering
- ArXiv
- 2020
- 1
- PDF
On a Relaxation of Time-Varying Actuator Placement
- Mathematics, Engineering
- IEEE Control Systems Letters
- 2020
- 2
- PDF
Approximately Supermodular Scheduling Subject to Matroid Constraints
- Mathematics, Computer Science
- ArXiv
- 2020
- PDF
References
SHOWING 1-10 OF 59 REFERENCES
Deterministic Polynomial-Time Actuator Scheduling With Guaranteed Performance
- Computer Science
- 2018 European Control Conference (ECC)
- 2018
- 7
Limitations and Tradeoffs in Minimum Input Selection Problems
- Computer Science
- 2018 Annual American Control Conference (ACC)
- 2018
- 5
Minimal Actuator Placement With Bounds on Control Effort
- Computer Science, Mathematics
- IEEE Transactions on Control of Network Systems
- 2016
- 147
- PDF
Optimal actuator placement for linear systems with limited number of actuators
- Mathematics, Computer Science
- 2017 American Control Conference (ACC)
- 2017
- 16
Minimal input selection for robust control
- Computer Science, Mathematics
- 2017 IEEE 56th Annual Conference on Decision and Control (CDC)
- 2017
- 9
- PDF
On Submodularity and Controllability in Complex Dynamical Networks
- Mathematics, Computer Science
- IEEE Transactions on Control of Network Systems
- 2016
- 316
- PDF
Minimal reachability problems
- Mathematics, Computer Science
- 2015 54th IEEE Conference on Decision and Control (CDC)
- 2015
- 17
- PDF
Minimal Controllability Problems
- Mathematics, Computer Science
- IEEE Transactions on Control of Network Systems
- 2014
- 225
- PDF
Controllability metrics, limitations and algorithms for complex networks
- Mathematics, Computer Science
- 2014 American Control Conference
- 2014
- 332
- PDF