带有禁止节点的线性结构广义系统的最小能控性问题
Minimal controllability problem on linear structural descriptor systems with forbidden nodes
AI总结:
研究广义系统最小能控性问题中无法与输入连接的禁止节点,利用二部图和Dulmage-Mendelsohn分解给出可解性条件,推导出最优值,并基于交替路径算法提出高效求解算法。
摘要:
我们考虑一个最小能控性问题(MCP),该问题确定广义系统实现结构能控所需的最少输入节点数。我们研究了广义系统中的“禁止节点”,表示无法与输入组件建立连接的节点。本工作的三个主要结果如下。首先,我们利用图论(如二部图及其Dulmage--Mendelsohn分解)展示了带有禁止节点的MCP的可解性条件。其次,我们推导了带有禁止节点的MCP的最优值。该最优值由受约束最大匹配的最优解确定,且该结果包含了先前工作中标准MCP的结果。最后,我们提供了一种基于交替路径算法的高效算法,用于求解带有禁止节点的MCP。
英文摘要:
We consider a minimal controllability problem (MCP), which determines the minimum number of input nodes for a descriptor system to be structurally controllable. We investigate the "forbidden nodes" in descriptor systems, denoting nodes that are unable to establish connections with input components. The three main results of this work are as follows. First, we show a solvability condition for the MCP with forbidden nodes using graph theory such as a bipartite graph and its Dulmage--Mendelsohn decomposition. Next, we derive the optimal value of the MCP with forbidden nodes. The optimal value is determined by an optimal solution for constrained maximum matching, and this result includes that of the standard MCP in the previous work. Finally, we provide an efficient algorithm for solving the MCP with forbidden nodes based on an alternating path algorithm.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。