Change search
ReferencesLink to record
Permanent link

Direct link
View-Invariant Regions and Mobile Robot Self-Localization
Number of Authors: 3
1996 (English)Report (Refereed)
Abstract [en]

This paper addresses the problem of mobile robot self-localization given a polygonal map and a set of observed edge segments. The standard approach to this problem uses interpretation tree search with pruning heuristics to match observed edges to map edges. Our approach introduces a preprocessing step in which the map is decomposed into 'view-invariant regions' (VIRs). The VIR decomposition captures information about map edge visibility, and can be used for a variety of robot navigation tasks. Basing self-localization search on VIRs greatly reduces the branching factor of the search tree and thereby simplifies the search task. In this paper we define the VIR decomposition and give algorithms for its computation and for self-localization search. We present results of simulations comparing standard and VIR-based search, and discuss the application of the VIR decomposition to other problems in robot navigation.

Place, publisher, year, edition, pages
Kista, Sweden: Swedish Institute of Computer Science , 1996, 1. , 27 p.
SICS Technical Report, ISSN 1100-3154 ; T96:01
Keyword [en]
Robot, Self-localization, range data, computational geometry
National Category
Computer and Information Science
URN: urn:nbn:se:ri:diva-14144OAI: diva2:1035431
Available from: 2016-10-13 Created: 2016-10-13

Open Access in DiVA

fulltext(241 kB)0 downloads
File information
File name FULLTEXT01.pdfFile size 241 kBChecksum SHA-512
Type fulltextMimetype application/pdf

Computer and Information Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

ReferencesLink to record
Permanent link

Direct link