Randomized query processing in robot path planning
- 1 January 1995
- conference paper
- Published by Association for Computing Machinery (ACM)
- Vol. 57 (1) , 353-362
- https://doi.org/10.1145/225058.225159
Abstract
The subject of this paper is the analysis of a randomized preprocessing scheme that has beenused for query processing in robot path planning. The attractiveness of the scheme stems fromits general applicability to virtually any path-planning problem, and its empirically observedsuccess. In this paper we initiate a theoretical basis for explaining this empirical success. Undera simple assumption about the configuration space, we show that it is possible to performpreprocessing following...Keywords
This publication has 0 references indexed in Scilit: