arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.00756cs.ROcs.MA
收藏

基于测距的移动机器人网络可定位性优化

Ranging-Based Localizability Optimization for Mobile Robotic Networks

Justin Cano, Jerome Le Ny

AI总结:

针对移动机器人网络协作定位精度受网络几何影响的问题,提出基于CRLB势场的轨迹规划与分布式部署方法,建立与图刚性联系,经仿真和实验验证。

摘要:

在依赖智能体之间含噪声测距进行协作定位的机器人网络中,可达到的定位精度强烈依赖于网络几何构型。这促使了在多机器人系统中规划机器人轨迹以保持高定位精度的问题。我们提出了基于势场的规划方法,其中引入可定位性势场来表征用于协作位置估计的网络几何质量。这些势场基于克拉美-罗下界(CRLB),并为任何无偏位置估计器可达到的误差协方差提供了理论下界。在此过程中,我们建立了CRLB与图刚性理论之间的联系,图刚性理论先前已被用于规划机器人网络的运动。我们开发了适用于大型网络的分布式部署算法,并使用等式约束的CRLB将可定位性概念扩展到已知测距传感器相对位置额外信息的场景。我们通过仿真示例和实验展示了所提出的机器人部署方法。

英文摘要:

In robotic networks relying on noisy range measurements between agents for cooperative localization, the achievable positioning accuracy strongly strongly depends on the network geometry. This motivates the problem of planning robot trajectories in such multi-robot systems in a way that maintains high localization accuracy. We present potential-based planning methods, where localizability potentials are introduced to characterize the quality of the network geometry for cooperative position estimation. These potentials are based on Cramer Rao Lower Bounds (CRLB) and provide a theoretical lower bound on the error covariance achievable by any unbiased position estimator. In the process, we establish connections between CRLBs and the theory of graph rigidity, which has been previously used to plan the motion of robotic networks. We develop decentralized deployment algorithms appropriate for large networks, and we use equality-constrained CRLBs to extend the concept of localizability to scenarios where additional information about the relative positions of the ranging sensors is known. We illustrate the resulting robot deployment methodology through simulated examples and an experiment.

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

↑