Volume 23 Issue 7/8- Publication Date: 1 July-August 2004
On the Relationship Between Classical Grid Search and Probabilistic Roadmaps
S.M. LaValle Department of Computer Science, University of Illinois, Urbana, IL 61801 USA, M.S. Branicky Department of Electrical Engineering, and Computer Science, CaseWestern Reserve University, Cleveland, OH 44106 USA, and S.R. Lindemann Department of Computer Science, University of Illinois, Urbana, IL 61801 USA

We present, implement, and analyze a spectrum of closely-related planners, designed to gain insight into the relationship between classical grid search and probabilistic roadmaps (PRMs)</it>. <it>Building on the quasi-Monte Carlo sampling literature, we have developed deterministic variants of the PRM that use low-discrepancy and low-dispersion samples, including lattices. Classical grid search is extended using subsampling for collision detection and also the dispersion-optimal Sukharev grid, which can be considered as a kind of lattice-based roadmap to complete the spectrum. Our experimental results show that the deterministic variants of the PRM offer performance advantages in comparison to the original, multiple-query PRM and the single-query, lazy PRM. Surprisingly, even some forms of grid search yield performance that is comparable to the original PRM. Our theoretical analysis shows that all of our deterministic PRM variants are resolution complete and achieve the best possible asymptotic convergence rate, which is shown to be superior to that obtained by random sampling. Thus, in surprising contrast to recent trends, there is both experimental and theoretical evidence that the randomization used in the original PRM is not advantageous.

Return to Contents