arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1703.06387cs.ROcs.SYeess.SY
收藏

一种机会主义的线性-凸算法用于移动机器人网络的定位

An opportunistic linear-convex algorithm for localization in mobile robot networks

Tufts University(塔夫茨大学)

Sam Safavi, Usman Khan

AI总结:

本文提出一种分布式算法用于定位在有界区域内任意移动的机器人网络,通过机会主义策略在附近机器人存在时更新位置,基于重心坐标设计线性-凸更新方法,并证明其在噪声下的渐近收敛性。

摘要:

本文开发了一种分布式算法,用于定位在有界区域内任意移动的机器人网络。在移动网络中,主要挑战是机器人可能无法找到附近的机器人来实现分布式算法。我们通过提供一种机会主义算法来解决这个问题,该算法仅在附近有机器人时进行位置更新,否则不更新。我们假设每个机器人测量其运动和到附近机器人的距离的噪声版本。为了在$\mathbb{R}^m$中定位移动机器人网络,我们提供了一个简单的线性更新,基于重心坐标并具有线性-凸性质。我们将相应的定位算法抽象为线性时变(LTV)系统,并证明其渐近收敛到真实位置。我们首先考虑噪声less情况,其中距离和运动向量已知(测量完美),并提供收敛性的充分条件。然后评估算法在存在噪声时的性能,并提供修改以抵消噪声的不利影响。我们进一步证明,只要至少有一个已知的基站(位置完全已知的节点)存在,我们的算法可以精确跟踪移动网络。

英文摘要:

In this paper, we develop a \textcolor{black}{\emph{distributed}} algorithm to localize a network of robots moving arbitrarily in a bounded region. In the case of such mobile networks, the main challenge is that the robots may not be able to find nearby robots to implement a distributed algorithm. We address this issue by providing an opportunistic algorithm that only implements a location update when there are nearby robots and does not update otherwise. We assume that each robot measures a noisy version of its motion and the distances to the nearby robots. To localize a network of mobile robots in~$\mathbb{R}^m$, we provide a simple \emph{linear} update, which is based on barycentric coordinates and is linear-convex. We abstract the corresponding localization algorithm as a Linear Time-Varying (LTV) system and show that it asymptotically converges to the true locations~of~the robots. We first focus on the noiseless case, where the distance and motion vectors are known (measured) perfectly, and provide sufficient conditions on the convergence of the algorithm. We then evaluate the performance of the algorithm in the presence of noise and provide modifications to counter the undesirable effects of noise. \textcolor{black}{We further show that our algorithm precisely tracks a mobile network as long as there is at least one known beacon (a node whose location is perfectly known).

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

↑