日本フィジカルAI新聞

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

群制御arXiv:2102.12331

反復改善によるリアルタイム多ロボット経路計画

Iterative Refinement for Real-Time Multi-Robot Path Planning

シェア:XThreadsFacebookLINEはてブBluesky

劣最適なMAPFソルバで初期解を高速に得た後、エージェント部分集合を選んで最適ソルバで反復改善する anytime 手法を提案し、高速収束とスケーラビリティを示した。

著者: Keisuke Okumura, Yasumasa Tamura, Xavier Defago

分類: cs.RO

原文アブストラクト

We study the iterative refinement of path planning for multiple robots, known as multi-agent pathfinding (MAPF). Given a graph, agents, their initial locations, and destinations, a solution of MAPF is a set of paths without collisions. Iterative refinement for MAPF is desirable for three reasons: 1)~optimization is intractable, 2)~sub-optimal solutions can be obtained instantly, and 3)~it is anytime planning, desired in online scenarios where time for deliberation is limited. Despite the high demand, this is under-explored in MAPF because finding good neighborhoods has been unclear so far. Our proposal uses a sub-optimal MAPF solver to obtain an initial solution quickly, then iterates the two procedures: 1)~select a subset of agents, 2)~use an optimal MAPF solver to refine paths of selected agents while keeping other paths unchanged. Since the optimal solvers are used on small instances of the problem, this scheme yields efficient-enough solutions rapidly while providing high scalability. We also present reasonable candidates on how to select a subset of agents. Evaluations in various scenarios show that the proposal is promising; the convergence is fast, scalable, and with reasonable quality.

関連論文

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

PR・アフィリエイト広告

MINISFORUM(ミニPC)

MINISFORUM(ミニPC)の公式広告バナーMINISFORUM公式ストアを見る ↗
PR本紙発行元 EmplifAI