Art gallery theorems and algorithms
Art gallery theorems and algorithms
Coverage for robotics – A survey of recent results
Annals of Mathematics and Artificial Intelligence
Near-optimal sensor placements: maximizing information while minimizing communication cost
Proceedings of the 5th international conference on Information processing in sensor networks
The giving tree: constructing trees for efficient offline and online multi-robot coverage
Annals of Mathematics and Artificial Intelligence
Computing multiple watchman routes
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
Multi-robot area coverage with limited visibility
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
| Hi-index | 0.00 |
Area coverage is one of the emerging problems in multi-robot coordination. In this task a team of robots is cooperatively trying to observe or sweep an entire area, possibly containing obstacles, with their sensors or actuators. The goal is to build an efficient path for each robot which jointly ensure that every single point in the environment can be seen or swept by at least one of the robots while performing the task.