.png){kind=icon}
返回
A Flow-Network-Based Polynomial-Time Approximation Algorithm for the Minimum Constrained Input Structural Controllability Problem
.png){kind=icon}
PRE
AI
DOI：10.1109/TAC.2018.2797210.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper deals with minimum cost constrained input selection (minCCIS) for state-space structured systems. Our goal is to optimally select an input set from the given inputs such that the system is structurally controllable when the set of states that each input can influence is prespecified and each input has a cost associated with it. This problem is known to be NP-hard. First, we give a flow-network-based novel necessary and sufficient graph theoretic condition for checking structural controllability. Using this condition, we propose a polynomial time reduction of the problem to a known NP-hard problem: the minimum-cost fixed-flow problem (MCFF). Subsequently, we show that approximation schemes of MCFF directly apply to the minCCIS problem. Using the special structure of the flow-network constructed for the structured system, we formulate a polynomial time approximation algorithm based on minimum weight bipartite matching problem and a greedy scheme for solving the MCFF problem on the system flow-network. The proposed algorithm gives a so-called Delta-approximate solution to MCFF, where Delta denotes the maximumin-degree of input vertices in the flow-network of the structured system.
Keyword:
Approximation algorithms
maximum flow problem
minimum input structural controllability
minimum-cost fixed-flow (MCFF) problem
structural controllability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7
论文数:
1.3W
被引数:
6.7W
机构
引用论文
.png){kind=icon}
分享收藏A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
OAAI
OAAI分享收藏Wave-induced chaotic radial transport of energetic electrons in a laboratory terrella experiment
PREAI
分享收藏
查看更多内容