|
ABSTRACT
We present a fast multi-robotic exploration methodology for 2D and 3D terrains. An asynchronous exploration strategy is introduced which shows significant improvements over the existing synchronous ones. A per-time visibility metric is being utilized by the algorithm. The metric allots the same weight for points for next view whose visibility over time ratios are equal. The outcome of this is that while the number of points visited to explore a terrain is nearly the same as other popular metrics found in literature, the time length of the paths are smaller in this case resulting in reduced time exploration. The results have been verified through extensive simulations in 2D and 3D. In 2D multiple robots explore unknown terrains that are office like, cluttered, corridor like and various combinations of these. In 3D we consider the case of multiple UAVs exploring a terrain represented as height fields. We introduce a way for calculating expected visibilities and a way of incorporating explored features in the per-time metric. The maximum height of the UAV at each location is governed by the so called exposure surface, beneath which the UAVs are constrained to fly. We also show performance gain of the present metric over others in experiments on a Pioneer 3DX robot.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
W. Burgard, M. Moors, C. Stachniss, and F. Schneider, "Coordinated Multi Robot Exploration", IEEE Transactions on Robotics, 21(3), 2005.
|
| |
2
|
Reid G. Simmons , David Apfelbaum , Wolfram Burgard , Dieter Fox , Mark Moors , Sebastian Thrun , Håkan L. S. Younes, 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, p.852-858, July 30-August 03, 2000
|
| |
3
|
|
| |
4
|
I. M. Rekeleitis, G Dudek and E Millios, "Multi-robot Collaboration for Robust Exploration", IEEE ICRA, 2000
|
| |
5
|
D. Fox, J. Ko, K. Konolige, B. Limketkai, D. Schulz, and B. Stewart, "Distributed Multi-robot Exploration and Mapping", Proc of IEEE, 2006
|
| |
6
|
M. Batalin and G. S. Sukhatme, (2007), "The Design and Analysis of an Efficient Local Algorithm for Coverage and Exploration Based on Sensor Network Deployment", In IEEE Transactions on Robotics, 23(4):661--675, Aug 2007
|
| |
7
|
S. Poduri and G. S. Sukhatme "Constrained Coverage for MobileSensor Network". IEEE ICRA (2004), 165--171
|
| |
8
|
S. K. Ghosh, J. W. Burdick, A. Bhattacharya and S. Sarkar, Online Algorithms with Discrete Visibility: Exploring Unknown Polygonal Environments, Special issue on Computational Geometry approaches in Path Planning, IEEE Robotics&Automation Magazine, vol. 15, no. 2, pp. 67--76, 2008.
|
| |
9
|
|
| |
10
|
Dominik Joho, Cyrill Stachniss, Patrick Pfaff, and Wolfram Burgard, "Autonomous Exploration for 3D Map Learning", Autonome Mobile Systeme (AMS). Kaiserslautern, Germany, 2007.
|
| |
11
|
Surmann H, Nüchter A, Hertzberg J, "An autonomous mobile robot with a 3D laser range finder for 3D exploration and digitalization of indoor environments", Robotics and Autonomous Systems, 45(3--4):181--198, 2003.
|
| |
12
|
|
| |
13
|
M. Mohan, R. Sawhney, K. M. Krishna, K. Srinathan, M. B. Srikanth, "Covering hostile terrains with partial and complete visibilities: On minimum distance paths". IROS: 2572--2577, 2008
|
| |
14
|
|
|