Ant Robotics: Covering Continuous Domains by Multi-A(ge)nt Systems
Eliyahu Osherovich

TL;DR
This paper introduces a simple, memoryless ant-like robot algorithm for efficiently covering continuous connected domains, including complex multidimensional spaces, using only pheromone-based indirect communication.
Contribution
The novel algorithm enables continuous domain coverage without relying on underlying graphs, and is robust to noise and suitable for patrolling tasks.
Findings
Ensures complete coverage of arbitrary connected domains.
Operates effectively in multidimensional and non-planar spaces.
Provides bounded time between robot visits, suitable for surveillance.
Abstract
In this work we present an algorithm for covering continuous connected domains by ant-like robots with very limited capabilities. The robots can mark visited places with pheromone marks and sense the level of the pheromone in their local neighborhood. In case of multiple robots these pheromone marks can be sensed by all robots and provide the only way of (indirect) communication between the robots. The robots are assumed to be memoryless, and to have no global information such as the domain map, their own position (either absolute or relative), total marked area percentage, maximal pheromone level, etc.. Despite the robots' simplicity, we show that they are able, by running a very simple rule of behavior, to ensure efficient covering of arbitrary connected domains, including non-planar and multidimensional ones. The novelty of our algorithm lies in the fact that, unlike previously…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRobotic Path Planning Algorithms · Optimization and Search Problems · Modular Robots and Swarm Intelligence
