Exploration Strategies for a Robot with a Continously Rotating 3D Scanner

To benchmark the efficiency of exploration strategies one has to use robot simulators. In an exploration task, the robot faces an unknown environment. Of course one could test the algorithm in different real-world scenarios, but a competitive strategy must have good performance in any environment that can be systematically constructed inside a simulator. This paper presents an evaluation of exploration strategies we developed for a specific sensor. A continously rotating 3D laser scanner that scans only into one direction at a time moves through the environment sampling the surrounding. Our evaluation framework features an efficient scanning and robot simulator for kinematic feasible trajectories. We will show that shorter trajectories do not necessarily imply quicker exploration. A simple simulator framework is sufficient for evaluating these properties of path planning algorithms.

[1]  Jack Bresenham,et al.  Algorithm for computer control of a digital plotter , 1965, IBM Syst. J..

[2]  Kazuya Yoshida,et al.  Scan-Point Planning and 3-D Map Building for a 3-D Laser Range Scanner in an Outdoor Environment , 2009, FSR.

[3]  Joachim Hertzberg,et al.  Planning Robot Motion for 3D Digitalization of Indoor Environments , 2002 .

[4]  Susanne Albers,et al.  Algorithms – ESA 2004 , 2004, Lecture Notes in Computer Science.

[5]  Sven Koenig,et al.  Greedy mapping of terrain , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  Brian Yamauchi,et al.  A frontier-based approach for autonomous exploration , 1997, Proceedings 1997 IEEE International Symposium on Computational Intelligence in Robotics and Automation CIRA'97. 'Towards New Computational Principles for Robotics and Automation'.

[7]  Antonio M. Pascoal,et al.  Adaptive, non-singular path-following control of dynamic wheeled robots , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[8]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[9]  D. T. Lee,et al.  Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.

[10]  Bernardo Wagner,et al.  Using 3D laser range data for SLAM in outdoor environments , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[11]  Maria Letizia Corradini,et al.  Switching linear path following for bounded curvature car-like vehicles , 2004 .

[12]  Sándor P. Fekete,et al.  Online Searching with an Autonomous Robot , 2004, WAFR.

[13]  Sándor P. Fekete,et al.  Polygon exploration with time-discrete vision , 2008, Comput. Geom..

[14]  Libor Preucil,et al.  European Robotics Symposium 2008 , 2008 .

[15]  Rudolf Fleischer,et al.  Competitive Online Approximation of the Optimal Search Ratio , 2008, SIAM J. Comput..

[16]  Benjamin Kuipers,et al.  Learning to Explore and Build Maps , 1994, AAAI.

[17]  Rolf Klein,et al.  The Polygon Exploration Problem , 2001, SIAM J. Comput..

[18]  Andreas Nüchter,et al.  High Speed Differential Drive Mobile Robot Path Following Control With Bounded Wheel Speed Commands , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[19]  Sven Behnke,et al.  Evaluating the Efficiency of Frontier-based Exploration Strategies , 2010, ISR/ROBOTIK.