Randomized Query Processing in Robot Path Planning

The subject of this paper is the analysis of a randomized preprocessing scheme that has been used for query processing in robot path planning. The attractiveness of the scheme stems from its general applicability to virtually any path-planning problem, and its empirically observed success. In this p...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer and system sciences Vol. 57; no. 1; pp. 50 - 60
Main Authors Kavraki, Lydia E., Latombe, Jean-Claude, Motwani, Rajeev, Raghavan, Prabhakar
Format Journal Article
LanguageEnglish
Published Elsevier Inc 01.08.1998
Online AccessGet full text
ISSN0022-0000
1090-2724
DOI10.1006/jcss.1998.1578

Cover

More Information
Summary:The subject of this paper is the analysis of a randomized preprocessing scheme that has been used for query processing in robot path planning. The attractiveness of the scheme stems from its general applicability to virtually any path-planning problem, and its empirically observed success. In this paper we initiate a theoretical basis for explaining this empirical success. Under a simple assumption about the configuration space, we show that it is possible to perform preprocessing following which queries can be answered quickly. En route, we consider related problems on graph connectivity in the evasiveness model and art-gallery theorems.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0022-0000
1090-2724
DOI:10.1006/jcss.1998.1578