Deterministic Polynomial-Time Actuator Scheduling With Guaranteed Performance
Deterministic Polynomial-Time Actuator Scheduling With Guaranteed Performance
复制标题
具有保证性能的确定性多项式时间执行器调度
DOI：
--
复制
发表时间：
2018
期刊：
影响因子：
--
通讯作者：
A. Jadbabaie
中科院分区：
文献类型：
--
作者：
Milad Siami;A. Jadbabaie
本文研究线性动力系统的时变执行器选择问题。通过利用最新的进展图稀疏化文献，我们开发了一个框架，设计一个稀疏的执行器调度给定的大规模线性系统，保证性能界限使用多项式时间算法。目前的方法基于多项式时间松弛的子集选择问题需要一个额外的乘法因子的$log n$传感器/执行器的最小数量倍，以保持可控性/可观测性。相比之下，我们表明，存在一个多项式时间的执行器调度，平均只选择一个常数数量的执行器在每个时间，近似的可控性/可观性指标的系统时，所有的执行器/传感器都在使用中。
In this paper, the problem of time-varying actu- ator 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.