arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2004.14938cs.RO
收藏

非线性最小二乘问题的自适应鲁棒核

Adaptive Robust Kernels for Non-Linear Least Squares Problems

University of Bonn(波恩大学)

Nived Chebrolu, Thomas Läbe, Olga Vysotska, Jens Behley, Cyrill Stachniss

摘要:

状态估计是大多数机器人系统中的关键组成部分。通常,使用某种形式的最小二乘最小化来执行状态估计。基本上,所有适用于真实世界数据的误差最小化程序都使用鲁棒内核作为处理数据中异常值的标准方法。然而,这些内核通常是手工挑选的,有时是不同的组合,并且它们的参数需要针对特定问题手动调整。在本文中,我们提出了使用一个广义的强大的核家庭,这是自动调整的残差分布的基础上,包括常见的m-估计。我们测试了我们的自适应内核与机器人技术中两个流行的估计问题,即ICP和光束法平差。本文提出的实验表明,我们的方法提供了更高的鲁棒性,同时避免了手动调整的内核参数。

英文摘要:

State estimation is a key ingredient in most robotic systems. Often, state estimation is performed using some form of least squares minimization. Basically, all error minimization procedures that work on real-world data use robust kernels as the standard way for dealing with outliers in the data. These kernels, however, are often hand-picked, sometimes in different combinations, and their parameters need to be tuned manually for a particular problem. In this paper, we propose the use of a generalized robust kernel family, which is automatically tuned based on the distribution of the residuals and includes the common m-estimators. We tested our adaptive kernel with two popular estimation problems in robotics, namely ICP and bundle adjustment. The experiments presented in this paper suggest that our approach provides higher robustness while avoiding a manual tuning of the kernel parameters.

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

↑