Learning Combinatorial Map Information from Permutations of Landmarks
Abstract
This paper considers a robot that moves in the plane and is only able to sense the cyclic order of landmarks with respect to its current position. No metric information is available regarding the robot or landmark positions; moreover, the robot does not have a compass or odometers (i.e., knowledge of coordinates). We carefully study the information space of the robot, and establish its capabilities in terms of mapping the environment and accomplishing tasks, such as navigation and patrolling. When the robot moves exclusively inside the convex hull of the set of landmarks, the information space can be succinctly characterized as an order type, which provides information powerful enough to determine which points lie inside the convex hulls of subsets of landmarks. Additionally, if the robot is allowed to move outside the convex hull of the set of landmarks, the information space is described with a swap cell decomposition, which is an aspect graph in which each aspect is a cyclic permutation of landmarks. We show how to construct such decomposition through its dual, using two kinds of feedback motion commands based on the landmarks sensed.
Document Details
- Document Type
- Technical Report
- Publication Date
- Oct 04, 2010
- Accession Number
- ADA536930
Entities
People
- Benjamin Tovar
- Luigi Freda
- Steven M. Lavalle
Organizations
- Northwestern University