日本フィジカルAI新聞

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

群制御arXiv:1901.08444

分割と合流を伴う移動ロボット群の逐次経路計画

Sequential path planning for a formation of mobile robots with split and merge

シェア:XThreadsFacebookLINEはてブBluesky

ロボット群のフォーメーション経路計画において、分割と再合流を考慮しつつグラフ上の拡張ダイクストラ法で決定的かつ計算負荷の低い解を求めるアルゴリズムを提案した。数十台規模の群れで複雑環境での有効性を実験的に示した。

著者: M. Estefanía Pereyra, R. Gastón Araguás, Miroslav Kulich

分類: cs.RO

原文アブストラクト

An algorithm for robot formation path planning is presented in this paper. Given a map of the working environment, the algorithm finds a path for a formation taking into account possible split of the formation and its consecutive merge. The key part of the solution works on a graph and sequentially employs an extended version of Dijkstra's graph-based algorithm for multiple robots. It is thus deterministic, complete, computationally inexpensive, and finds a solution for a fixed source node to another node in the graph. Moreover, the presented solution is general enough to be incorporated into high-level tasks like cooperative surveillance and it can benefit from state-of-the-art formation motion planning approaches, which can be used for evaluation of edges of an input graph. The performed experimental results demonstrate the behavior of the method in complex environments for formations consisting of tens of robots.

関連論文

  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・アフィリエイト広告

MINISFORUM(ミニPC)

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