arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1412.6595math.OCcs.DScs.SYeess.SY
收藏

高效、最优的k-领导者选择用于一致的一维编队

Efficient, Optimal $k$-Leader Selection for Coherent, One-Dimensional Formations

Rensselaer Polytechnic Institute(伦斯勒理工学院);Johns Hopkins University(约翰斯·霍普金斯大学)

Stacy Patterson, Neil McGlohon, Kirill Dyagilev

AI总结:

研究在存在噪声相对信息的共识网络中最优领导者选择问题,提出在路径图和环图中可通过多项式时间算法解决k-领导者选择问题。

摘要:

我们研究在存在噪声相对信息的共识网络中最优领导者选择问题。目标是确定k个领导者集合,以最小化编队偏离领导者建立的期望轨迹的程度。通过穷举所有可能的领导者集合可以找到最优领导者集合;然而,这种方法无法扩展到大规模网络。近年来,一些工作提出了k-领导者选择问题的近似算法,但是否存在高效的、非组合的方法来确定最优领导者集合仍是一个开放问题。本文首次尝试回答这个问题。我们证明,在一维加权图,即路径图和环图中,k-领导者选择问题可以在多项式时间内解决(在k和网络规模n中)。我们为路径图提供了O(n³)的最优k-领导者选择解法,为环图提供了O(kn³)的最优k-领导者选择解法。

英文摘要:

We study the problem of optimal leader selection in consensus networks with noisy relative information. The objective is to identify the set of $k$ leaders that minimizes the formation's deviation from the desired trajectory established by the leaders. An optimal leader set can be found by an exhaustive search over all possible leader sets; however, this approach is not scalable to large networks. In recent years, several works have proposed approximation algorithms to the $k$-leader selection problem, yet the question of whether there exists an efficient, non-combinatorial method to identify the optimal leader set remains open. This work takes a first step towards answering this question. We show that, in one-dimensional weighted graphs, namely path graphs and ring graphs, the $k$-leader selection problem can be solved in polynomial time (in both $k$ and the network size $n$). We give an $O(n^3)$ solution for optimal $k$-leader selection in path graphs and an $O(kn^3)$ solution for optimal $k$-leader selection in ring graphs.

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

↑