arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.06911math.OC
收藏

结构系统任意极点配置的最小代价反馈选择

Minimum Cost Feedback Selection for Arbitrary Pole Placement in Structured Systems

Shana Moothedath, Prasanna Chaporkar, Madhu N. Belur

摘要:

本文讨论了结构系统一般任意极点配置的最优反馈选择问题,当每个反馈边都与一个代价相关联时。给定一个结构化系统和一个反馈代价矩阵,我们的目标是找到一个可行的最小代价反馈矩阵,以保证闭环结构化系统的任意极点配置。我们首先给出了一个多项式时间减少的加权集覆盖问题的反馈选择问题的一个实例,从而表明该问题是NP-困难的。然后,我们证明了问题的不可近似性,表明常数因子近似的问题不存在,除非集合覆盖问题可以近似在一个常数因子。由于这个问题是困难的,我们研究了一个子类的系统,其使用状态有向图的强连通分支构造的有向无圈图是线图,并且状态二部图具有完美匹配。针对这类系统,提出了一种基于动态规划的多项式时间优化算法。进一步地,在同类系统上,我们放宽了完美匹配的假设,并给出了一个基于动态规划的多项式时间2-最优解和一个最小代价完美匹配算法。

英文摘要:

This paper addresses optimal feedback selection for generic arbitrary pole placement of structured systems when each feedback edge is associated with a cost. Given a structured system and a feedback cost matrix, our aim is to find a feasible feedback matrix of minimum cost that guarantees arbitrary pole placement of the closed-loop structured system. We first give a polynomial time reduction of the weighted set cover problem to an instance of the feedback selection problem and thereby show that the problem is NP-hard. Then we prove the inapproximability of the problem by showing that constant factor approximation for the problem does not exist unless the set cover problem can be approximated within a constant factor. Since the problem is hard, we study a subclass of systems whose directed acyclic graph constructed using the strongly connected components of the state digraph is a line graph and the state bipartite graph has a perfect matching. We propose a polynomial time optimal algorithm based on dynamic programming for solving the problem on this class of systems. Further, over the same class of systems we relax the perfect matching assumption, and provide a polynomial time 2-optimal solution based on dynamic programming and a minimum cost perfect matching algorithm.

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

↑