TACO框架通过在线检测与定期清理,提升位姿图优化在高异常值下的鲁棒性。
TACO: A Test and Check Framework for Robust Pose Graph Optimization

- 采用增量概率共识算法在线评估环路闭合一致性
- 在50%异常值下2D/3D SLAM成功率超90%/83%,收敛时间约45ms/100ms
- 适合需要实时部署的机器人定位系统,开源可复用
位姿图优化(PGO)是解决同步定位与地图构建(SLAM)问题最广泛采用的方法之一。然而,PGO对异常值极为敏感,可能显著降低轨迹估计质量。这些异常值源于环境感知混淆导致的错误位置识别关联。本文提出TACO(Test And Check Optimization),一种鲁棒优化框架,用于从PGO系统中过滤异常值。不同于显式建模测量为内点或外点,TACO通过两个互补组件逐步逼近最大一致测量集:(i) 检测组件——增量概率共识(IPC)算法,对每个新到达的环路闭合进行在线一致性评估;(ii) 检查组件——可切换异常值净化,利用现有可切换约束周期性剔除IPC误纳入的一致集合中的不一致测量。我们在2D SLAM和3D视觉SLAM数据集上对TACO进行了评估,结果表明其鲁棒性接近最先进的离线方法,同时保持了在线部署所需的计算效率,在异常值率高达50%的情况下,2D和3D的平均成功率分别超过90%和83%,平均收敛时间分别为约45毫秒和100毫秒。本文随论文发布开源实现。
原文摘要 · Abstract (English)
Pose Graph Optimization (PGO) is one of the most widely adopted approaches for solving Simultaneous Localization and Mapping (SLAM) problems. However, PGO approaches are particularly sensitive to outliers, which can substantially degrade the quality of the estimated trajectories. These outliers arise from incorrect place recognition associations caused by perceptual aliasing in the environment. In this paper, we present TACO (short for Test And Check Optimization), a robust optimization framework designed to filter out outliers from PGO systems. Rather than explicitly modeling measurements as inliers or outliers, TACO finds an approximation to the maximally consistent set of measurements incrementally through two complementary components: (i) The test component, namely the Incremental Probabilistic Consensus (IPC) algorithm, evaluates the consistency of each incoming loop closure online. (ii) The check component dubbed Switchable Outlier Sanitization leverages the existing Switchable Constraints to periodically sanitize any inconsistent measurements from the consistent set that IPC may have mistakenly included. We evaluate TACO on 2D SLAM and 3D Visual SLAM datasets against several state-of-the-art methods. The results show robustness comparable to state-of-the-art offline methods while preserving the computational efficiency required for online deployment, achieving a success rate above 90% in 2D and 83% in 3D across outlier rates up to 50%, with mean convergence times of approximately 45 ms and 100 ms, respectively. We release an open-source implementation of our method with this paper.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。