日本フィジカルAI新聞

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

群制御arXiv:2209.04286

強連結有向グラフ上のマルチエージェント経路探索:実行可能性と解法アルゴリズム

Multi-Agent Path Finding on Strongly Connected Digraphs: feasibility and solution algorithms

シェア:XThreadsFacebookLINEはてブBluesky

強連結有向グラフ上でのマルチエージェント経路探索問題に対し、穴が2つ以上ある場合に実行可能性を線形時間で判定し、多項式時間で実行可能解を求めるアルゴリズムを提案した。

著者: Stefano Ardizzoni, Irene Saccani, Luca Consolini, Marco Locatelli

分類: cs.MA, cs.RO

原文アブストラクト

On an assigned graph, the problem of Multi-Agent Pathfinding (MAPF) consists in finding paths for multiple agents, avoiding collisions. Finding the minimum-length solution is known to be NP-hard, and computation times grows exponentially with the number of agents. However, in industrial applications, it is important to find feasible, suboptimal solutions, in a time that grows polynomially with the number of agents. Such algorithms exist for undirected and biconnected directed graphs. Our main contribution is to generalize these algorithms to the more general case of strongly connected directed graphs. In particular, given a MAPF problem with at least two holes, we present an algorithm that checks the problem feasibility in linear time with respect to the number of nodes, and provides a feasible solution in polynomial time.

関連論文

  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