Terrain coverage with ant robots: a simulation study
Proceedings of the fifth international conference on Autonomous agents
Coverage for robotics – A survey of recent results
Annals of Mathematics and Artificial Intelligence
An Experimental Study of a Cooperative Positioning System
Autonomous Robots
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Pervasive pheromone-based interaction with RFID tags
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks
IEEE Transactions on Computers
Multi-robot exploration of an unknown environment, efficiently reducing the odometry error
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
Exploring unknown environments with mobile robots using coverage maps
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Coordinated multi-robot exploration
IEEE Transactions on Robotics
IEEE Transactions on Robotics
Physical Path Planning Using a Pervasive Embedded Network
IEEE Transactions on Robotics
Coverage control in unknown environments using neural networks
Artificial Intelligence Review
Hi-index | 0.00 |
Dispersing a team of robots into an unknown and dangerous environment, such as a collapsed building, can provide information about structural damage and locations of survivors and help rescuers plan their actions. We propose a rolling dispersion algorithm, which makes use of a small number of robots and achieves full exploration. The robots disperse as much as possible while maintaining communication, and then advance as a group, leaving behind beacons to mark explored areas and provide a path back to the entrance. The novelty of this algorithm comes from the manner in which the robots continue their exploration as a group after reaching the maximum dispersion possible while staying in contact with each other. We use simulation to show that the algorithm works in multiple environments and for varying numbers of robots.