Data association for mobile robot navigation: a graph theoretic approach

Data association is the process of relating features observed in the environment to features viewed previously or to features in a map. This paper presents a graph theoretic method that is applicable to data association problems where the features are observed via a batch process. Batch observations detect a set of features simultaneously or with sufficiently small temporal difference that, with motion compensation, the features can be represented with precise relative coordinates. This data association method is described in the context of two possible navigation applications: metric map building with simultaneous localisation, and topological map based localisation. Experimental results are presented using an indoor mobile robot with a 2D scanning laser sensor. Given two scans from different unknown locations, the features common to both scans are mapped to each other and the relative change in pose (position and orientation) of the vehicle between the two scans is obtained.

[1]  Jean-François Mari,et al.  Place learning and recognition using hidden Markov models , 1997, Proceedings of the 1997 IEEE/RSJ International Conference on Intelligent Robot and Systems. Innovative Robotics for Real-World Applications. IROS '97.

[2]  A. Shoukry,et al.  Neural network approach for solving the maximal common subgraph problem , 1996, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Hugh F. Durrant-Whyte,et al.  An Autonomous Guided Vehicle for Cargo Handling Applications , 1995, Int. J. Robotics Res..

[4]  J. J. McGregor,et al.  Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..

[5]  C. Bron,et al.  Algorithm 457: finding all cliques of an undirected graph , 1973 .

[6]  Roberto Battiti,et al.  Reactive Local Search for the Maximum Clique Problem1 , 2001, Algorithmica.

[7]  K. S. Arun,et al.  Least-Squares Fitting of Two 3-D Point Sets , 1987, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  D. Yun,et al.  Unifying Graph Matching Problems with a Practical Solution , 1998 .

[9]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[10]  Harry G. Barrow,et al.  Subgraph Isomorphism, Matching Relational Structures and Maximal Cliques , 1976, Inf. Process. Lett..

[11]  Hugh F. Durrant-Whyte,et al.  An Experimental and Theoretical Investigation into Simultaneous Localisation and Map Building , 1999, ISER.

[12]  Edward M. Riseman,et al.  A Fast Line Finder for Vision-Guided Robot Navigation , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[13]  Samuel S. Blackman,et al.  Multiple-Target Tracking with Radar Applications , 1986 .

[14]  Hugh F. Durrant-Whyte,et al.  An Autonomous Guided Vehicle for Cargo Handling Applications , 1995, ISER.

[15]  David Kortenkamp,et al.  Topological Mapping for Mobile Robots Using a Combination of Sonar and Vision Sensing , 1994, AAAI.

[16]  Roberto Battiti,et al.  Reactive Local Search for Maximum Clique , 1997 .