论文标题
最小的领导者设置了K-Distant树的可控性
Minimal Leader Set for Controllability of k-distant Trees
论文作者
论文摘要
最小可控性问题在网络控制领域起着重要作用。提出了一个新的概念最小的完美关键集（MPC）。发现四个不同的MPCS用于K-Distant树图。基于此MPC的概念，提供了用于查找最小领导者集的算法。数值实验表明，这些理论使该算法能够找到一个最小的领导者设置，其概率超过0.98。此外，发现了最小的K-Distant树的领导者集合的其他一些数值特征。
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.
