arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2007.04842cs.ROcs.CG
收藏

求解窄通道运动规划问题的内点法

An Interior Point Method Solving Motion Planning Problems with Narrow Passages

Max Planck Institute for Intelligent Systems(马克斯·普朗克智能系统研究所);TU Berlin(柏林工业大学);University of Stuttgart(斯图加特大学)

Jim Mainprice, Nathan Ratliff, Marc Toussaint, Stefan Schaal

摘要:

运动规划问题的数学解决方案已经研究了五十年。自1969年A* 的发展以来,人们研究了许多方法,传统上分为网格分解,势场或基于采样的方法。在这项工作中,我们专注于使用数值优化,这是欠研究解决运动规划问题。对基于采样的方法缺乏兴趣主要是由于窄通道引入的非凸性。我们解决这个缺点接地的解决方案在微分几何。我们证明通过一系列的实验3自由度和6自由度窄通道问题,如何明确建模的基础黎曼流形导致一个有效的边界点非线性规划的解决方案。

英文摘要:

Algorithmic solutions for the motion planning problem have been investigated for five decades. Since the development of A* in 1969 many approaches have been investigated, traditionally classified as either grid decomposition, potential fields or sampling-based. In this work, we focus on using numerical optimization, which is understudied for solving motion planning problems. This lack of interest in the favor of sampling-based methods is largely due to the non-convexity introduced by narrow passages. We address this shortcoming by grounding the solution in differential geometry. We demonstrate through a series of experiments on 3 Dofs and 6 Dofs narrow passage problems, how modeling explicitly the underlying Riemannian manifold leads to an efficient interior-point non-linear programming solution.

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

↑