Answers are grounded in this paper and cite their sources.
Multiagent systems (MASs) are pivotal for large-scale monitoring and exploration, where achieving efficient area coverage is fundamental to comprehensive environmental sensing. However, practical deployments are often hindered by static, nonnavigable obstacles of unknown geometry, which complicate online exploration and degrade coverage efficiency. Existing methods frequently rely on prior environmental knowledge or suffer from redundant exploration near obstacle boundaries. To overcome these limitations, this paper presents a distributed antiflocking coverage algorithm for MASs in unknown environments. Our framework leverages a shared information map mechanism to fuse local observations from neighboring agents, extending situational awareness beyond individual sensing ranges. We introduce an adapted Bug-based navigation strategy to facilitate real-time obstacle detection, boundary following, and incremental mapping. Controlled by a hybrid strategy of antiflocking dynamics and pheromone-guided motion, agents maintain optimal spatial dispersion while minimizing redundant coverage. Extensive simulations demonstrate that the proposed approach effectively navigates unknown obstacles and considerably reduces overlap in noncoverable regions. The opposite flood-fill mechanism accurately reconstructs obstacle geometries without prior knowledge, while the shared information map mechanism (coverage and pheromone maps) enables each agent to maintain global situational awareness from local observations. Furthermore, the algorithm exhibits robust scalability under sensing and communication constraints, validating its suitability for large-scale distributed applications.
No takes yet. Share an insight, caveat, or question.
Xue et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: