k-距离树可控性的最小领导集
Minimal Leader Set for Controllability of k-distant Trees
摘要：
极小能控性问题在网络控制领域中占有重要地位。提出了最小完美临界集的概念。四个不同的MPC被发现的k-距离树图。基于MPCS的概念，给出了一个求最小领导集的算法。数值实验表明，这些理论使算法能够找到一个最小的领导集的概率大于0.98。此外，还发现了k-距离树的最小前导集的一些其它的数值特征。
英文摘要：
Minimal controllability problem plays an important role in the field of network control. A New concept-Minimum Perfect Critical Set (MPCS)is proposed. Four different MPCSs were found for k-distant tree graphs. Based on this concept of MPCS, an algorithm for finding the minimal leader set is provided. Numerical experiments show that these theories enable the algorithm to find a minimal leader set with a probability of more than 0.98. Further, some other numerical characteristics of the minimal leader set of k-distant trees were found.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
