Building maps of large environments using splines and geometric analysis

Recently, a novel solution to the Simultaneous Localization and Map building (SLAM) problem for complex indoor environments was presented, using a set of splines for describing the geometries detected by a laser range finder mounted on a mobile platform. In this paper, a method for exploiting the geometric information underlying in these maps in the data association process is described. The proposed approach uses graphs of relations between simple features extracted from the environment, and a bit encoded implementation for obtaining a maximum clique that relates observations with previously visited areas. This information is used to update the relative positions of a collage of submaps of limited size.

[1]  Hugh F. Durrant-Whyte,et al.  Data association for mobile robot navigation: a graph theoretic approach , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[2]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[3]  Les A. Piegl,et al.  The NURBS book (2nd ed.) , 1997 .

[4]  Michael Veeck,et al.  Learning polyline maps from range scan data acquired with mobile robots , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[5]  Randall Smith,et al.  Estimating Uncertain Spatial Relationships in Robotics , 1987, Autonomous Robot Vehicles.

[6]  Jaime Valls Miró,et al.  BS-SLAM: Shaping the World , 2007, Robotics: Science and Systems.

[7]  Hugh F. Durrant-Whyte,et al.  A computationally efficient solution to the simultaneous localisation and map building (SLAM) problem , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[8]  José A. Castellanos,et al.  Linear time vehicle relocation in SLAM , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[9]  Ramón Galán,et al.  Building geometric feature based maps for indoor service robots , 2006, Robotics Auton. Syst..

[10]  J. M. M. Montiel,et al.  The SPmap: a probabilistic framework for simultaneous localization and map building , 1999, IEEE Trans. Robotics Autom..

[11]  Diego Rodriguez-Losada,et al.  EFFICIENT GLOBAL LOCALIZATION BY SEARCHING A BIT-ENCODED GRAPH , 2007 .

[12]  Wolfram Burgard,et al.  A Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent , 2007, Robotics: Science and Systems.

[13]  Randall Smith,et al.  Estimating uncertain spatial relationships in robotics , 1986, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

[14]  Michael Bosse,et al.  An Atlas framework for scalable mapping , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[15]  Hugh F. Durrant-Whyte,et al.  A solution to the simultaneous localization and map building (SLAM) problem , 2001, IEEE Trans. Robotics Autom..

[16]  John J. Leonard,et al.  A Computationally Efficient Method for Large-Scale Concurrent Mapping and Localization , 2000 .

[17]  Juan D. Tardós,et al.  Hierarchical SLAM: real-time accurate mapping of large environments , 2005, IEEE Transactions on Robotics.

[18]  Pablo San Segundo,et al.  Efficient Search Using Bitboard Models , 2006, 2006 18th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'06).

[19]  Carl de Boor,et al.  A Practical Guide to Splines , 1978, Applied Mathematical Sciences.

[20]  Lina María Paz,et al.  Data Association in O(n) for Divide and Conquer SLAM , 2007, Robotics: Science and Systems.

[21]  Edwin Olson,et al.  Fast iterative alignment of pose graphs with poor initial estimates , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[22]  J. A. Castellanos,et al.  Limits to the consistency of EKF-based SLAM , 2004 .