日本フィジカルAI新聞

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

群制御arXiv:1905.10149

winPIBT:反復型マルチエージェント経路探索のための拡張優先度アルゴリズム

winPIBT: Extended Prioritized Algorithm for Iterative Multi-agent Path Finding

シェア:XThreadsFacebookLINEはてブBluesky

PIBTを時間窓で一般化し複数ステップ先読みを可能にしたwinPIBTを提案。ライブロックを緩和し、適切な窓幅でより効率的な経路を計画できることを示した。

著者: Keisuke Okumura, Yasumasa Tamura, Xavier Défago

分類: cs.MA, cs.DC, cs.RO

原文アブストラクト

The problem of Multi-agent Path Finding (MAPF) consists in providing agents with efficient paths while preventing collisions. Numerous solvers have been developed so far since MAPF is critical for practical applications such as automated warehouses. The recently-proposed Priority Inheritance with Backtracking (PIBT) is a promising decoupled method that solves MAPF iteratively with flexible priorities. The method is aimed to be decentralized and has a very low computational cost, but it is shortsighted in the sense that it plans only one step ahead, thus occasionally resulting in inefficient plannings. This work proposes a generalization of PIBT, called windowed PIBT (winPIBT), that introduces a configurable time window. winPIBT allows agents to plan paths anticipating multiple steps ahead. We prove that, similarly to PIBT, all agents reach their own destinations in finite time as long as the environment is a graph with adequate properties, e.g., biconnected. Experimental results over various scenarios confirm that winPIBT mitigates livelock situations occurring in PIBT, and usually plans more efficient paths given adequate window size.

関連論文

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

PR・アフィリエイト広告

OZ GAMING(GPU搭載BTOゲーミングPC)

OZ GAMING(GPU搭載BTOゲーミングPC)の公式広告バナーOZ GAMINGで完成品PCを見る ↗
PR本紙発行元 EmplifAI