群れの分散自己組織化による局所感知目標への大域的ε最適経路探索
Distributed Self-Organization Of Swarms To Find Globally $\epsilon$-Optimal Routes To Locally Sensed Targets
大規模群れが局所情報のみを用いて目標への準最適経路を分散的に計画するアルゴリズムを提案し、収束性・頑健性・スケーラビリティを理論的に示すとともに1万体以上のシミュレーションで検証した。
分類: 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.
