Power diagrams: properties, algorithms and applications
SIAM Journal on Computing
Quantitative evaluation of the exploration strategies of a mobile robot
International Journal of Robotics Research
Coordination for Multi-Robot Exploration and Mapping
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A frontier-based approach for autonomous exploration
CIRA '97 Proceedings of the 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation
Planning Algorithms
Multi-objective exploration and search for autonomous rescue robots: Research Articles
Journal of Field Robotics
Equitable partitioning policies for robotic networks
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Hi-index | 0.00 |
In this note, we compare four different exploration strategies and analyze the performance in terms of exploration time and amount of exploration per time step. In order to provide a suitable reference for comparison, we derive an upper bound for the theoretically achievable increase of explored area per time step. The comparison itself is done using a comprehensive empirical evaluation resulting in statistically significant performance differences.