日本フィジカルAI新聞

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

群制御arXiv:2503.02719

信号時相論理仕様下でのスケーラブルなマルチロボットタスク割当と協調

Scalable Multi-Robot Task Allocation and Coordination under Signal Temporal Logic Specifications

シェア:XThreadsFacebookLINEはてブBluesky

単一ロボットの経路計画で候補経路を生成し、信号時相論理(STL)で協調要件を記述、混合整数線形計画でタスク割当と進捗目標を計算することで、大規模マルチロボット系での複雑なタスクを効率的に処理する手法を提案。

著者: Wenliang Liu, Nathalie Majcherczyk, Federico Pecora

分類: cs.RO, cs.FL, cs.SY, eess.SY

原文アブストラクト

Motion planning with simple objectives, such as collision-avoidance and goal-reaching, can be solved efficiently using modern planners. However, the complexity of the allowed tasks for these planners is limited. On the other hand, signal temporal logic (STL) can specify complex requirements, but STL-based motion planning and control algorithms often face scalability issues, especially in large multi-robot systems with complex dynamics. In this paper, we propose an algorithm that leverages the best of the two worlds. We first use a single-robot motion planner to efficiently generate a set of alternative reference paths for each robot. Then coordination requirements are specified using STL, which is defined over the assignment of paths and robots' progress along those paths. We use a Mixed Integer Linear Program (MILP) to compute task assignments and robot progress targets over time such that the STL specification is satisfied. Finally, a local controller is used to track the target progress. Simulations demonstrate that our method can handle tasks with complex constraints and scales to large multi-robot teams and intricate task allocation scenarios.

関連論文

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

PR・アフィリエイト広告

FRONTIER(GPU搭載BTOパソコン)

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