Construction of Minimized Topological Graphs on Occupancy Grid Maps Based on GVD and Sensor Coverage Information

One of the tasks to be carried out during the robot exploration of an unknown environment, is the construction of a complete map of the environment at bounded time interval. In order for the exploration to be efficient, a smart planning method must be implemented so that the robot can cover the space as fast as possible. One of the most important information that an intelligent agent can have, is a representation of the environment, not necessarily in the form of a map, but of a topological graph of the plane, which can be used to perform efficient planning. This work proposes a method to produce a topological graph of an Occupancy Grid Map (OGM) by using a Manhattan distance function to create the Approximate Generalized Voronoi Diagram (AGVD). Several improvements in the AGVD are made, in order to produce a crisp representation of the spaces skeleton, but in the same time to avoid the complex results of other methods. To smooth the final AGVD, morphological operations are performed. A topological graph is constructed from the AGVD, which is minimized by using sensor coverage information, aiming at planning complexity reduction.

[1]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

[2]  Wan Kyun Chung,et al.  The robust construction of a generalized Voronoi graph (GVG) using partial range data for guide robots , 2008, Ind. Robot.

[3]  Howie Choset,et al.  Incremental construction of the saturated-GVG for multi-hypothesis topological SLAM , 2011, 2011 IEEE International Conference on Robotics and Automation.

[4]  Jae-Bok Song,et al.  Real-time building of a thinning-based topological map with metric features , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[5]  Nidhi Kalra,et al.  Incremental reconstruction of generalized Voronoi diagrams on grids , 2009, Robotics Auton. Syst..

[6]  Shahin Mohammadi,et al.  A Voronoi-Based Reactive Approach for Mobile Robot Navigation , 2008, CSICC.

[7]  Ching Y. Suen,et al.  A fast parallel algorithm for thinning digital patterns , 1984, CACM.

[8]  Cristina Urdiales,et al.  Efficient integration of metric and topological maps for directed exploration of unknown environments , 2002, Robotics Auton. Syst..

[9]  Lei Shi,et al.  Towards generalization of semi-supervised place classification over generalized Voronoi graph , 2013, Robotics Auton. Syst..

[10]  Martin Rumpf,et al.  A Continuous Skeletonization Method Based on Level Sets , 2002, VisSym.

[11]  Steven M. LaValle,et al.  Planning under topological constraints using beam-graphs , 2013, 2013 IEEE International Conference on Robotics and Automation.

[12]  Alexandru Telea,et al.  An Augmented Fast Marching Method for Computing Skeletons and Centerlines , 2002, VisSym.

[13]  Benjamin Kuipers,et al.  Towards Autonomous Topological Place Detection Using the Extended Voronoi Graph , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[14]  Keiji Nagatani,et al.  Sensor-based planning: using a honing strategy and local map method to implement the generalized Voronoi graph , 1998, Other Conferences.

[15]  Emmanouil Tsardoulias,et al.  An FPGA implementation of the SMG-SLAM algorithm , 2012, Microprocess. Microsystems.

[16]  Dolores Blanco,et al.  Exploration of 2D and 3D Environments using Voronoi Transform and Fast Marching Method , 2009, J. Intell. Robotic Syst..

[17]  Rafael C. González,et al.  Local Determination of a Moving Contrast Edge , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[18]  Magnus Egerstedt,et al.  A provably complete exploration strategy by constructing Voronoi diagrams , 2010, Auton. Robots.

[19]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[20]  Sung-Kee Park,et al.  Topological map building and exploration based on concave nodes , 2008, 2008 International Conference on Control, Automation and Systems.

[21]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[22]  Lihong Ma,et al.  A skeletonization algorithm based on euclidean distance maps and morphological operators , 2001 .

[23]  Wolfram Burgard,et al.  Improved updating of Euclidean distance maps and Voronoi diagrams , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  Wolfram Burgard,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .