Abstract
In this letter, we investigate the problem of actuator scheduling for networked control systems. Given a stochastic linear system with a number of actuators, we consider the case that one actuator is activated at each time. This problem is combinatorial in nature and NP-Hard to solve. We propose a convex relaxation to the actuator scheduling problem, and use the relaxed solution as a reference to design an algorithm for solving the original scheduling problem. Using dynamic programming arguments, we provide a suboptimality bound of our proposed algorithm. Furthermore, we show that our framework can be extended to incorporate multiple actuator scheduling at each time and actuation costs. A simulation example is provided, which shows that our proposed method outperforms a random selection approach and a greedy selection approach.
Original language | English |
---|---|
Pages (from-to) | 7-12 |
Number of pages | 6 |
Journal | IEEE Control Systems Letters |
Volume | 7 |
DOIs | |
State | Published - 2023 |
Keywords
- Actuator scheduling
- LQG control