arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1710.02871cs.ROmath.GR
收藏

路径同伦不变量及其在最优轨迹规划中的应用

Path Homotopy Invariants and their Application to Optimal Trajectory Planning

Lehigh University(理海大学);University of Pennsylvania(宾夕法尼亚大学)

Subhrajit Bhattacharya, Robert Ghrist

摘要:

考虑给定环境下不同同伦类的最优路径规划问题。虽然在机器人应用中很重要,但在机器人文献中,带有轨迹同伦类推理的路径规划通常集中在欧几里得平面的子集上。在更一般的配置空间中找到不同同伦类中的最佳轨迹(甚至描述这种轨迹的同伦类)的问题可能是困难的。在本文中,我们提出了自动化的解决方案,这个问题在几个一般类的配置空间,通过构建基本组的介绍,并给出算法,解决\emph{word problem}在这样的群体。我们给出了适用于3-空间中的纽结和链环补的明确结果,讨论了如何扩展到任意维度的圆柱删除协调空间,并且还给出了在欧几里得平面上导航的机器人协调空间中的结果。

英文摘要:

We consider the problem of optimal path planning in different homotopy classes in a given environment. Though important in robotics applications, path-planning with reasoning about homotopy classes of trajectories has typically focused on subsets of the Euclidean plane in the robotics literature. The problem of finding optimal trajectories in different homotopy classes in more general configuration spaces (or even characterizing the homotopy classes of such trajectories) can be difficult. In this paper we propose automated solutions to this problem in several general classes of configuration spaces by constructing presentations of fundamental groups and giving algorithms for solving the \emph{word problem} in such groups. We present explicit results that apply to knot and link complements in 3-space, discuss how to extend to cylindrically-deleted coordination spaces of arbitrary dimension, and also present results in the coordination space of robots navigating on an Euclidean plane.

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

↑