arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1409.3289math.OCcs.MAcs.SYeess.SYmath.DS
收藏

具有控制努力界限的最小执行器布置

Minimal Actuator Placement with Bounds on Control Effort

University of Pennsylvania(宾夕法尼亚大学)

V. Tzoumas, M. A. Rahimian, G. J. Pappas, A. Jadbabaie

AI总结:

本文研究了线性系统中最小执行器布置问题,证明其NP难,并提出一种近似算法,以O(logn)因子近似最优解,同时探讨了在控制努力最小化下的执行器布置问题。

摘要:

我们研究了线性系统中最小执行器布置问题,即确保在单位输入能量下可达状态集的体积下限满足给定值。首先,根据Olshevsky最近的工作,证明该问题NP难。然后,我们提供了一种高效算法,对于给定的问题参数范围,以O(logn)的乘法因子近似任何满足相同能量标准的最优执行器集;这是在多项式时间内可达到的最佳近似因子。此外,该算法使用一种扰动的控制能量度量,我们证明其为超模函数。接下来,我们聚焦于相关问题:在控制努力最小化下的执行器布置问题,其中最优执行器集被选择以最大化在单位输入能量下可达状态集的体积。尽管这也是NP难的问题,但我们的算法仍能有效近似其解。

英文摘要:

We address the problem of minimal actuator placement in linear systems so that the volume of the set of states reachable with one unit or less of input energy is lower bounded by a desired value. First, following the recent work of Olshevsky, we prove that this is NP-hard. Then, we provide an efficient algorithm which, for a given range of problem parameters, approximates up to a multiplicative factor of O(logn), n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time, in the worst case. Moreover, the algorithm uses a perturbed version of the involved control energy metric, which we prove to be supermodular. Next, we focus on the related problem of cardinality-constrained actuator placement for minimum control effort, where the optimal actuator set is selected to maximize the volume of the set of states reachable with one unit or less of input energy. While this is also an NP-hard problem, we use our proposed algorithm to efficiently approximate its solutions as well.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑