逐次パラメータ化運動計画とその複雑さ II
Sequential parametrized motion planning and its complexity, II
複数ロボットが障害物を避けながら指定された順序で状態を訪れる運動計画問題について、偶数次元ユークリッド空間での位相的複雑さを完全に解明し、最小複雑度を達成する明示的なアルゴリズムを提案した。
著者: Michael Farber, Amit Kumar Paul
分類: cs.RO, math.AT
原文アブストラクト
This is a continuation of our recent paper in which we developed the theory of sequential parametrized motion planning. A sequential parametrized motion planning algorithm produced a motion of the system which is required to visit a prescribed sequence of states, in a certain order, at specified moments of time. In the previous publication we analysed the sequential parametrized topological complexity of the Fadell - Neuwirth fibration which in relevant to the problem of moving multiple robots avoiding collisions with other robots and with obstacles in the Euclidean space. Besides, in the preceeding paper we found the sequential parametrised topological complexity of the Fadell - Neuwirth bundle for the case of the Euclidean space $\Bbb R^d$ of odd dimension as well as the case $d=2$. In the present paper we give the complete answer for an arbitrary $d\ge 2$ even. Moreover, we present an explicit motion planning algorithm for controlling multiple robots in $\Bbb R^d$ having the minimal possible topological complexity; this algorithm is applicable to any number $n$ of robots and any number $m\ge 2$ of obstacles.
