位形空间与机器人运动规划算法
Configuration Spaces and Robot Motion Planning Algorithms
摘要:
本文综述了与机器人运动规划问题相关的拓扑问题,并包括一些新的结果和结构。首先,我们分析的概念,拓扑复杂性的配置空间,负责机器人导航算法的不连续性。然后,我们提出了明确的运动规划算法协调碰撞自由控制的多个粒子在欧几里得空间或图形上移动。这些算法是最佳的意义上说,他们有最小数量的区域的连续性。此外,我们详细描述了树上两个粒子的位形空间的拓扑结构,并利用它构造了树上n个粒子的位形空间中的一些顶维上同调类。
英文摘要:
The paper surveys topological problems relevant to the motion planning problem of robotics and includes some new results and constructions. First we analyse the notion of topological complexity of configuration spaces which is responsible for discontinuities in algorithms for robot navigation. Then we present explicit motion planning algorithms for coordinated collision free control of many particles moving in Euclidean spaces or on graphs. These algorithms are optimal in the sense that they have minimal number of regions of continuity. Moreover, we describe in full detail the topology of configuration spaces of two particles on a tree and use it to construct some top-dimensional cohomology classes in configuration spaces of n particles on a tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。