基于核函数的快速遍历搜索
Fast Ergodic Search with Kernel Functions
AI总结:
本文提出基于核函数的快速遍历搜索方法,将遍历度量从欧几里得空间推广到李群并实现线性复杂度,通过一阶最优性条件加速轨迹优化,在销孔插入任务中取得100%成功率。
摘要:
遍历搜索能够在保证搜索空间渐近覆盖的同时,实现对信息分布的最优探索。然而,现有方法通常在搜索空间维度上具有指数级计算复杂度,并且仅限于欧几里得空间。我们提出了一种计算高效的遍历搜索方法。本文贡献有两方面。首先,我们开发了一种基于核的遍历度量,并将其从欧几里得空间推广到李群。我们正式证明了所提出的度量与标准遍历度量一致,同时在搜索空间维度上保证线性复杂度。其次,我们推导了非线性系统核遍历度量的一阶最优性条件,从而能够实现高效的轨迹优化。全面的数值基准测试表明,所提出的方法比最先进算法至少快两个数量级。最后,我们通过一个销孔插入任务演示了所提出的算法。我们将该问题形式化为 SE(3) 空间中的覆盖任务,并使用一段 30 秒长的人类演示作为遍历覆盖的先验分布。只要解存在于先验信息分布中,遍历性就保证了销孔插入问题的渐近求解,这一点体现在 100% 的成功率上。
英文摘要:
Ergodic search enables optimal exploration of an information distribution while guaranteeing the asymptotic coverage of the search space. However, current methods typically have exponential computation complexity in the search space dimension and are restricted to Euclidean space. We introduce a computationally efficient ergodic search method. Our contributions are two-fold. First, we develop a kernel-based ergodic metric and generalize it from Euclidean space to Lie groups. We formally prove the proposed metric is consistent with the standard ergodic metric while guaranteeing linear complexity in the search space dimension. Secondly, we derive the first-order optimality condition of the kernel ergodic metric for nonlinear systems, which enables efficient trajectory optimization. Comprehensive numerical benchmarks show that the proposed method is at least two orders of magnitude faster than the state-of-the-art algorithm. Finally, we demonstrate the proposed algorithm with a peg-in-hole insertion task. We formulate the problem as a coverage task in the space of SE(3) and use a 30-second-long human demonstration as the prior distribution for ergodic coverage. Ergodicity guarantees the asymptotic solution of the peg-in-hole problem so long as the solution resides within the prior information distribution, which is seen in the 100% success rate.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。