日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

運動計画arXiv:math/0210018

トポロジカルロボティクス:射影空間における運動計画

Topological robotics: motion planning in projective spaces

シェア:XThreadsFacebookLINEはてブBluesky

回転関節で固定された直線を連続的に動かす運動計画問題をトポロジーの視点から解析し、実射影空間のトポロジカル複雑度TC(RP^n)をn<24で計算、その計算が没入問題と等価であることを示した。

著者: Michael Farber, Serge Tabachnikov, Sergey Yuzvinsky

分類: math.AT, cs.RO, math.DG

原文アブストラクト

We study an elementary problem of topological robotics: rotation of a line, which is fixed by a revolving joint at a base point: one wants to bring the line from its initial position to a final position by a continuous motion in the space. The final goal is to construct an algorithm which will perform this task once the initial and final positions are given. Any such motion planning algorithm will have instabilities, which are caused by topological reasons. A general approach to study instabilities of robot motion was suggested recently by the first named author. With any path-connected topological space X one associates a number TC(X), called the topological complexity of X. This number is of fundamental importance for the motion planning problem: TC(X) determines character of instabilities which have all motion planning algorithms in X. In the present paper we study the topological complexity of real projective spaces. In particular we compute TC(RP^n) for all n<24. Our main result is that (for n distinct from 1, 3, 7) the problem of calculating of TC(RP^n) is equivalent to finding the smallest k such that RP^n can be immersed into the Euclidean space R^{k-1}.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  3. 3Google DeepMind、ロボット向けAIを発表新製品・発表
  4. 4NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  5. 5GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開

PR・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

FRONTIER(GPU搭載BTOパソコン)の公式広告バナーFRONTIERでGPU搭載PCを見る ↗
PR本紙発行元 EmplifAI