トポロジカルロボティクス:部分空間配置と衝突回避運動計画
Topological Robotics: Subspace Arrangements and Collision Free Motion Planning
n個の粒子を衝突させずに初期配置から最終配置へ動かす問題を、配置空間のトポロジカル複雑度として定式化し、平面および奇数次元空間の場合に解いた。
著者: Michael Farber, Sergey Yuzvinsky
分類: math.AT, cs.RO, math.DG
原文アブストラクト
We study an elementary problem of the topological robotics: collective motion of a set of $n$ distinct particles which one has to move from an initial configuration to a final configuration, with the requirement that no collisions occur in the process of motion. The ultimate goal is to construct an algorithm which will perform this task once the initial and the final configurations are given. This reduces to a topological problem of finding the topological complexity TC(C_n(\R^m)) of the configutation space C_n(\R^m) of $n$ distinct ordered particles in \R^m. We solve this problem for m=2 (the planar case) and for all odd m, including the case m=3 (particles in the three-dimensional space). We also study a more general motion planning problem in Euclidean space with a hyperplane arrangement as obstacle.
