穴あき多角形環境における可視性被覆のためのマルチエージェント展開
Multi-Agent Deployment for Visibility Coverage in Polygonal Environments with Holes
未知の穴あき非凸多角形環境で、全方位視覚を持つロボット群が見通し通信を保ちながら環境を分割し、全領域を可視被覆する分散アルゴリズムを提案し、収束性や必要時間・台数の上限を証明した。
著者: Karl J. Obermeyer, Anurag Ganguli, Francesco Bullo
分類: cs.RO, cs.DC, cs.MA
原文アブストラクト
This article presents a distributed algorithm for a group of robotic agents with omnidirectional vision to deploy into nonconvex polygonal environments with holes. Agents begin deployment from a common point, possess no prior knowledge of the environment, and operate only under line-of-sight sensing and communication. The objective of the deployment is for the agents to achieve full visibility coverage of the environment while maintaining line-of-sight connectivity with each other. This is achieved by incrementally partitioning the environment into distinct regions, each completely visible from some agent. Proofs are given of (i) convergence, (ii) upper bounds on the time and number of agents required, and (iii) bounds on the memory and communication complexity. Simulation results and description of robust extensions are also included.
