Topological mapping for limited sensing mobile robots using the Probabilistic Gap Navigation Tree

This thesis proposes a novel structure for robotic navigation with minimal sensing abilities called the Probabilistic Gap Navigation Tree (PGNT). In this navigation approach, we create a topological map of the environment based on a previously created Gap Navigation Tree (GNT) [40]. The "gap" in the gap navigation algorithm represents a discontinuity in the robotic field of vision. The robot is able to use the gaps to represent its world as a tree structure (GNT), in which each vertex corresponds to a gap. Ideally, the robot navigates in the world by following the tree branches to its desired goal. However, due to the sensor uncertainty, the robot may detect discontinuities when there are none present, and vice versa. The Probabilistic Gap Navigation Tree compensates for the measurement noise by sampling from a distribution of the gap navigation trees to obtain the most likely tree given the sensor measurements, similar to the particle filtering algorithm used in Monte Carlo localization. Therefore, the PGNT allows navigation in an unknown environment using a realistic range finder, as opposed to the ideal sensor model assumed previously. We demonstrate the ability to build a PGNT in a simulated environment.

Department dc:contributor.department

Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.

Grantor dc:publisher

Massachusetts Institute of Technology

Year dc:date.issued

2008

Author dc:creator

• Gordeski, Valerie

Advisor dc:contributor.advisor

• Nicholas Roy.

• Electrical Engineering and Computer Science.

Statement dc:rights

• M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.

Licence dc:rights.uri

• http://dspace.mit.edu/handle/1721.1/7582

Language dc:language.iso

eng

Handle dc:identifier.uri

http://hdl.handle.net/1721.1/46108

OAI identifier oai:identifier

oai:dspace.mit.edu:1721.1/46108