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

网络内领导者选择用于无环图

In-Network Leader Selection for Acyclic Graphs

Rensselaer Polytechnic Institute(伦斯勒理工学院)

Stacy Patterson

AI总结:

研究在存在随机扰动的领导者-追随者多智能体系统中领导者选择问题,提出网络内领导者选择方法,通过邻居通信协作寻找最小化轨迹偏差方差的领导者。

摘要:

研究在存在随机扰动的领导者-追随者多智能体系统中领导者选择问题,提出网络内领导者选择方法,通过邻居通信协作寻找最小化轨迹偏差方差的领导者。

英文摘要:

We study the problem of leader selection in leader-follower multi-agent systems that are subject to stochastic disturbances. This problem arises in applications such as vehicle formation control, distributed clock synchronization, and distributed localization in sensor networks. We pose a new leader selection problem called the in-network leader selection problem. Initially, an arbitrary node is selected to be a leader, and in all consequent steps the network must have exactly one leader. The agents must collaborate to find the leader that minimizes the variance of the deviation from the desired trajectory, and they must do so within the network using only communication between neighbors. To develop a solution for this problem, we first show a connection between the leader selection problem and a class of discrete facility location problems. We then leverage a previously proposed self-stabilizing facility location algorithm to develop a self-stabilizing in-network leader selection algorithm for acyclic graphs.

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

↑