Global Localisation Algorithm from a Multiple Hypotheses Set

In this paper, a new fast and computationally light weight methodology is proposed to pinpoint a robot in a structured scenario. The localisation algorithm performs a tracking routine to pinpoint the robot´s position as it moves in a known map. To perform such tracking routine, it is necessary to know the initial position of the vehicle. This paper briefly describes the tracking routine and presents a solution to pinpoint that initial position in an autonomous way. Experimental results on the performance of the proposed methodology are presented in this paper in two different scenarios: (1) in the Middle Size Soccer Robotic League (MSL), with artificial vision data from an omni directional robot, and (2) in an indoor environment with a Laser Range Finder data from a differential traction robot (called Robot Vigil).