Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
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. © 1998 Academic Press.
Michael Ray, Yves C. Martin
Proceedings of SPIE - The International Society for Optical Engineering
Juliann Opitz, Robert D. Allen, et al.
Microlithography 1998
Zhihua Xiong, Yixin Xu, et al.
International Journal of Modelling, Identification and Control
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989