日本フィジカルAI新聞

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

群制御arXiv:1104.4251

群れの分散自己組織化による局所感知目標への大域的ε最適経路探索

Distributed Self-Organization Of Swarms To Find Globally $\epsilon$-Optimal Routes To Locally Sensed Targets

シェア:XThreadsFacebookLINEはてブBluesky

大規模群れが局所情報のみを用いて目標への準最適経路を分散的に計画するアルゴリズムを提案し、収束性・頑健性・スケーラビリティを理論的に示すとともに1万体以上のシミュレーションで検証した。

著者: Ishanu Chattopadhyay

分類: cs.RO, cs.MA, cs.SY, eess.SY, math.OC

原文アブストラクト

The problem of near-optimal distributed path planning to locally sensed targets is investigated in the context of large swarms. The proposed algorithm uses only information that can be locally queried, and rigorous theoretical results on convergence, robustness, scalability are established, and effect of system parameters such as the agent-level communication radius and agent velocities on global performance is analyzed. The fundamental philosophy of the proposed approach is to percolate local information across the swarm, enabling agents to indirectly access the global context. A gradient emerges, reflecting the performance of agents, computed in a distributed manner via local information exchange between neighboring agents. It is shown that to follow near-optimal routes to a target which can be only sensed locally, and whose location is not known a priori, the agents need to simply move towards its "best" neighbor, where the notion of "best" is obtained by computing the state-specific language measure of an underlying probabilistic finite state automata. The theoretical results are validated in high-fidelity simulation experiments, with excess of $10^4$ agents.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2Google DeepMind、ロボット向けAIを発表新製品・発表
  3. 3GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  4. 4SoftBank主導、Agile Robotsが5億ドル調達 NVIDIAと日立も参加資金調達
  5. 5NTT、ロボットの行動前に荷崩れを予測研究・技術

PR・アフィリエイト広告

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

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