论文标题
线性系统的执行器调度：凸放松方法
Actuator Scheduling for Linear Systems: A Convex Relaxation Approach
论文作者
论文摘要
在这封信中，我们研究了网络控制系统的执行器调度问题。给定带有许多执行器的随机线性系统，我们认为每次都激活一个执行器。这个问题本质上是组合的，而NP难以解决。我们向执行器调度问题提出了凸放松，并使用其解决方案作为设计用于解决原始调度问题的算法的参考。使用动态编程参数，我们提供了我们提出的算法的次优界。此外，我们表明我们的框架可以扩展，以在每次和驱动费用下整合多个执行器的安排。提供了一个仿真示例，该示例表明我们所提出的方法的表现优于随机选择方法和贪婪的选择方法。
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 its 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 actuators 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.
