Artificial Intelligence
Terrain coverage with ant robots: a simulation study
Proceedings of the fifth international conference on Autonomous agents
A model for terrain coverage inspired by ant's alarm pheromones
Proceedings of the 2007 ACM symposium on Applied computing
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Wall-following exploration with two cooperating mobile robots
ISPRA'10 Proceedings of the 9th WSEAS international conference on Signal processing, robotics and automation
Weight parameters tuning for frontier-based cooperating robots exploration
ISPRA'10 Proceedings of the 9th WSEAS international conference on Signal processing, robotics and automation
Exploration with two cooperating mobile robots
WSEAS Transactions on Systems and Control
| Hi-index | 0.00 |
The ability to cover a terrain has numerous applications to our everyday lives: from spell checking to Web crawling, from surveillance to automated vacuuming. Indeed, these applications require different approaches to solving the coverage problem because they are based on different ways of evaluating the goodness of the coverage; a good terrain coverage to vacuuming may not be desirable in Web crawling. To better understand the issues, this paper divides the terrain coverage problem into two classes (temporal and spatial) and discusses the performance of standard and self-organized algorithms as means of solving both classes of coverage problem. In order to perform the comparison the paper introduces suitable metrics to evaluate the goodness of a coverage (temporal or spatial).