arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2404.18331cs.RO
收藏

多机器人目标SLAM使用分布式变分推断

Multi-Robot Object SLAM Using Distributed Variational Inference

University of California San Diego(加利福尼亚大学圣迭戈分校)

Hanwen Cao, Sriram Shreedharan, Nikolay Atanasov

AI总结:

本文提出一种基于分布式变分推断的多机器人目标SLAM方法,通过共识约束和镜像下降算法,在避免单点故障的同时提升轨迹与目标估计精度,并实现更好的扩展性。

摘要:

多机器人同时定位与地图构建(SLAM)使机器人团队能够依靠环境的共同地图实现协调任务。通过集中处理机器人观测来构建地图是不可取的,因为它会产生单点故障,并需要预先存在的基础设施和显著的通信吞吐量。本文将多机器人目标SLAM表述为通信图上的变分推断问题,并受到不同机器人维护的目标估计上的共识约束。为解决该问题,我们开发了一种分布式镜像下降算法,并带有正则化以在通信机器人之间强制执行共识。在算法中使用高斯分布,我们还推导了用于多机器人目标SLAM的分布式多状态约束卡尔曼滤波器(MSCKF)。在真实和模拟数据上的实验表明,与单机器人SLAM相比,我们的方法改善了轨迹和目标估计,同时与集中式多机器人SLAM相比,实现了对大型机器人团队的更好扩展性。

英文摘要:

Multi-robot simultaneous localization and mapping (SLAM) enables a robot team to achieve coordinated tasks by relying on a common map of the environment. Constructing a map by centralized processing of the robot observations is undesirable because it creates a single point of failure and requires pre-existing infrastructure and significant communication throughput. This paper formulates multi-robot object SLAM as a variational inference problem over a communication graph subject to consensus constraints on the object estimates maintained by different robots. To solve the problem, we develop a distributed mirror descent algorithm with regularization enforcing consensus among the communicating robots. Using Gaussian distributions in the algorithm, we also derive a distributed multi-state constraint Kalman filter (MSCKF) for multi-robot object SLAM. Experiments on real and simulated data show that our method improves the trajectory and object estimates, compared to individual-robot SLAM, while achieving better scaling to large robot teams, compared to centralized multi-robot SLAM.

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

↑