论文标题
关于地图的目标复杂性
On the Targeted Complexity of a Map
论文作者
论文摘要
我们研究了相对于配置空间的某些子空间的工作图的拓扑复杂性，以及被视为机器人运动目标集的工作空间。动机是优化和减少工作图的运动计划者的数量。在这方面，我们专注于有用的作品集。我们检查了靶向复杂性的一些基本特性，例如同型不变性，降低，地图的乘积等。然后，我们比较了这些有针对性的复杂性，并发现减少运动计划者数量的一些不平等现象。我们表明，简短定义的一对空间的相对拓扑复杂性是工作图的目标复杂性的一种特殊情况。
We study the topological complexity of work maps with respect to some subspaces of the configuration space and a workspace considered as the target set of the motion of robots. The motivation is to optimize and reduce the number of motion planners for work maps. In this regard, we focus on the useful set of works. We check some basic properties of the targeted complexity of maps, such as homotopical invariance, reduction, the product of maps, and so on. Then we compare these targeted complexities, and we find some inequalities in reducing the number of motion planners. We show that the relative topological complexity of pair of spaces defined by Short is a special case of the targeted complexity of work maps.
