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

基于PDE的路径规划中的球面游走算法

Walk on Spheres for PDE-based Path Planning

KTH Royal Institute of Technology(皇家理工学院)

Rafael I. Cabral Muchacho, Florian T. Pokorny

AI总结:

本文首次研究了Walk on Spheres算法在机器人配置空间运动规划中的应用,通过将势场定义为屏蔽泊松方程的解,实验验证了该方法具备平凡并行化能力、O(1/N)的维度无关收敛特性及在RR平台上的有效性。

摘要:

本文研究了球面游走算法(Walk on Spheres, WoS)在机器人运动规划中的应用。WoS是Muller在50年代开发的一种用于解决Dirichlet问题的Monte Carlo方法,最近被Sawhney和Crane重新推广,他们展示了其在体积域几何处理中的适用性。本文首次研究了WoS在配置空间中机器人运动规划的适用性,其中势场被定义为屏蔽泊松方程的解。本文的实验实证了该方法的平凡并行化特性、其步数与维度无关的O(1/N)收敛特性,以及在RR平台上的验证实验。

英文摘要:

In this paper, we investigate the Walk on Spheres algorithm (WoS) for motion planning in robotics. WoS is a Monte Carlo method to solve the Dirichlet problem developed in the 50s by Muller and has recently been repopularized by Sawhney and Crane, who showed its applicability for geometry processing in volumetric domains. This paper provides a first study into the applicability of WoS for robot motion planning in configuration spaces, with potential fields defined as the solution of screened Poisson equations. The experiments in this paper empirically indicate the method's trivial parallelization, its dimension-independent convergence characteristic of $O(1/N)$ in the number of walks, and a validation experiment on the RR platform.

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

↑