Skip to Main Content
This paper discusses the distributed connected coverage problem for a group of mobile agents in 3-dimensional space and with limited-range interactions. A self-deployment algorithm is proposed, which spreads out the agent group while preserving some special core structures of the time-variant communication topologies. It should be pointed out that the core structure keeps the connectivity of the communication topology and can be preserved without hindering the agents from traversing over the maximal distance from their neighbors; thus distributed coverage can be achieved with preserved connectivity. The resulting performance is demonstrated by both theoretical analysis and numerical simulation.
Asian Control Conference, 2009. ASCC 2009. 7th
Date of Conference: 27-29 Aug. 2009