Simultaneous localization and mapping using the Geometric Projection Filter and correspondence graph matching

A common way of localization in robotics is using triangulation on a system composed of a sensor and some landmarks (which can be artificial or natural). First, when no identifying marks are set on the landmarks, their identification by a robust algorithm is a complex problem which may be solved using correspondence graphs. Secondly, when the localization system has no a priori information about its environment, it has to build its own map in parallel with estimating its position, a problem known as simultaneous localization and mapping (SLAM). Recent works have proposed to solve this problem based on building a map made of invariant features. This paper describes the algorithms and data structure needed to deal with landmark matching, robot localization and map building in a single efficient process, unifying the previous approaches. Experimental results are presented using an outdoor robot car equipped with a two-dimensional scanning laser sensor.