arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1503.07021eess.SYcs.SY
收藏

最小子集可达性问题

Minimal Reachability Problems

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

Vasileios Tzoumas, Ali Jadbabaie, George J. Pappas

AI总结:

本文研究了线性时不变系统中最小 actuators 的可达性问题,提出零一对角输入矩阵 B 的构造方法,证明前两个问题为 NP 难,并提供多项式时间算法及性能验证。

摘要:

本文针对线性时不变系统中的状态空间可达性问题,使用最少的执行器设计零一对角输入矩阵 B,使得指定状态向量从给定初始状态可达。此外,设计 B 使系统能被引导至给定子空间或接近期望状态。本文扩展了 Olshevsky 和 Pequito 的最新结果,证明前两个问题为 NP 难,并提供多项式时间算法及最坏情况近似保证,最后在大规模随机网络上展示了性能。

英文摘要:

In this paper, we address a collection of state space reachability problems, for linear time-invariant systems, using a minimal number of actuators. In particular, we design a zero-one diagonal input matrix B, with a minimal number of non-zero entries, so that a specified state vector is reachable from a given initial state. Moreover, we design a B so that a system can be steered either into a given subspace, or sufficiently close to a desired state. This work extends the recent results of Olshevsky and Pequito, where a zero-one diagonal or column matrix B is constructed so that the involved system is controllable. Specifically, we prove that the first two of our aforementioned problems are NP-hard; these results hold for a zero-one column matrix B as well. Then, we provide efficient polynomial time algorithms for their general solution, along with their worst case approximation guarantees. Finally, we illustrate their performance over large random networks.

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

↑