通过子模优化降低位姿SLAM不确定性的协同图探索
Collaborative Graph Exploration with Reduced Pose-SLAM Uncertainty via Submodular Optimization
AI总结：
本文针对GPS拒止环境下的多机器人协同图探索，提出两阶段策略，将闭环动作选择建模为非单调子模最大化问题，以高效降低位姿SLAM不确定性并保证近似最优性。
摘要：
本文研究GPS拒止环境下的协同图探索问题，其中一组机器人需要覆盖一个图环境，同时在协同同时定位与建图（SLAM）中保持可靠的位姿估计。同时考虑这两个目标给多机器人路径规划带来挑战，因为它涉及用于SLAM不确定性评估的昂贵协方差推断，尤其是考虑到机器人路径的各种组合。为了降低计算复杂度，我们提出一种高效的两阶段策略：首先生成用于快速覆盖的探索路径，然后通过沿路径添加信息丰富且距离高效的闭环动作（称为loop edges）来增强路径，以实现可靠的位姿估计。我们将后一问题形式化为非单调子模最大化问题，通过将SLAM不确定性与位姿图拓扑相关联，这（1）有助于比协方差推断更高效地评估SLAM不确定性，（2）允许应用子模优化中的近似算法以提供最优性保证。我们进一步引入排序启发式方法以改善目标值，同时保持最优性界。在随机生成的图环境上的仿真实验验证了我们的方法在寻找快速覆盖路径和增强位姿图可靠性方面的效率，并对近似算法和基于贪心的算法在loop edge选择问题中的性能进行了基准测试。我们的实现将在https://github.com/bairuofei/CGE开源。
英文摘要：
This paper considers the collaborative graph exploration problem in GPS-denied environments, where a group of robots are required to cover a graph environment while maintaining reliable pose estimations in collaborative simultaneous localization and mapping (SLAM). Considering both objectives presents challenges for multi-robot pathfinding, as it involves the expensive covariance inference for SLAM uncertainty evaluation, especially considering various combinations of robots' paths. To reduce the computational complexity, we propose an efficient two-stage strategy where exploration paths are first generated for quick coverage, and then enhanced by adding informative and distance-efficient loop-closing actions, called loop edges, along the paths for reliable pose estimation. We formulate the latter problem as a non-monotone submodular maximization problem by relating SLAM uncertainty with pose graph topology, which (1) facilitates more efficient evaluation of SLAM uncertainty than covariance inference, and (2) allows the application of approximation algorithms in submodular optimization to provide optimality guarantees. We further introduce the ordering heuristics to improve objective values while preserving the optimality bound. Simulation experiments over randomly generated graph environments verify the efficiency of our methods in finding paths for quick coverage and enhanced pose graph reliability, and benchmark the performance of the approximation algorithms and the greedy-based algorithm in the loop edge selection problem. Our implementations will be open-source at https://github.com/bairuofei/CGE.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
