Randomized Query Processing in Robot Path Planning (Extended Abstract) (1995)
Cached
Download Links
| Venue: | Journal of Computer and System Sciences |
| Citations: | 49 - 12 self |
BibTeX
@INPROCEEDINGS{Kavraki95randomizedquery,
author = {Lydia E. Kavraki and Jean-claude Latombe and Rajeev Motwani and Prabhakar Raghavan},
title = {Randomized Query Processing in Robot Path Planning (Extended Abstract)},
booktitle = {Journal of Computer and System Sciences},
year = {1995},
pages = {353--362}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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.
