arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.02276cs.ROcs.MAcs.SYeess.SYmath.DS
收藏

多机器人系统中的去中心化双连通性条件

Decentralized Biconnectivity Conditions in Multi-robot Systems

Mehran Zareh, Lorenzo Sabattini, Cristian Secchi

AI总结:

本文提出去中心化方法,通过拉普拉斯矩阵的第三小特征值提供双连通性条件,确保网络在单个机器人失效时仍保持连通。

摘要:

群体协作机器人网络的连通性容易因单个机器人与其余部分断开连接而破坏。在考虑对单个机器人失效具有鲁棒性的前提下,通信网络被称为双连通的。简而言之,要证明双连通网络图不存在割点,我们需要提出一种去中心化方法,提供网络双连通性的充分条件,并证明这些条件与拉普拉斯矩阵的第三小特征值相关。机器人间的数据交换假定为邻居间直接交换。

英文摘要:

The network connectivity in a group of cooperative robots can be easily broken if one of them loses its connectivity with the rest of the group. In case of having robustness with respect to one-robot-fail, the communication network is termed biconnected. In simple words, to have a biconnected network graph, we need to prove that there exists no articulation point. We propose a decentralized approach that provides sufficient conditions for biconnectivity of the network, and we prove that these conditions are related to the third smallest eigenvalue of the Laplacian matrix. Data exchange among the robots is supposed to be neighbor-to-neighbor.

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

↑