By Topic

Pure Topological Mapping in Mobile Robotics

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Marinakis, Dimitri ; Centre for Intell. Machines, McGill Univ., Montreal, QC, Canada ; Dudek, G.

In this paper, we investigate a pure form of the topological mapping problem in mobile robotics. We consider the mapping ability of a robot navigating a graph-like world in which it is able to assign a relative ordering to the edges, leaving a vertex with reference to the edge by which it arrived but is unable to associate a unique label with any vertex or edge. Our work extends and builds upon earlier approaches in this problem domain, which are based on construction of exploration tree of plausible world models. The main contributions of the paper are improved exploration strategies that reduce model ambiguity, a new method of search through consistent models in the exploration tree that maintains a bounded set of likely hypotheses based on the principle of Occam's Razor, the incorporation of arbitrary feature vectors into the problem formulation, and an investigation of various aspects of this problem through numerical simulations.

Published in:

Robotics, IEEE Transactions on  (Volume:26 ,  Issue: 6 )