On the Relationship between Classical Grid Search and Probabilistic Roadmaps
The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.
Abstract
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). 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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Latombe, J.-C. (1991) · Springer eBooks · doi:10.1007/978-1-4615-4022-9 · Cited by 6,396
Probabilistic roadmaps for path planning in high-dimensional configuration spaces
Kavraki, L. E., Svestka, P., Latombe, J.-C., & Overmars, M. H. (1996) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.508439 · Cited by 6,343 · cited 5×
“The PRM at least has asymptotic analysis that establishes probabilistic completeness and convergence (Bar-raquand et al. 1996; Kavraki et al. 1996).”
InfluentialRandom Number Generation and Quasi-Monte Carlo Methods
Niederreiter, H. (1992) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970081 · Cited by 2,770
Sphere Packings, Lattices and Groups
Conway, J. H., & Sloane, N. J. A. (1999) · Grundlehren der mathematischen Wissenschaften · doi:10.1007/978-1-4757-6568-7 · Cited by 2,223
Spatial Planning: A Configuration Space Approach
Lozano-Perez (1983) · IEEE Transactions on Computers · doi:10.1109/tc.1983.1676196 · Cited by 2,113
Halton, J. H. (1960) · Numerische Mathematik · doi:10.1007/bf01386213 · Cited by 1,985
�ber die Gleichverteilung von Zahlen mod. Eins
Weyl, H. (1916) · Mathematische Annalen · doi:10.1007/bf01475864 · Cited by 1,263
Rapidly-Exploring Random Trees: Progress and Prospects
(2001) · Algorithmic and Computational Robotics · doi:10.1201/9781439864135-43 · Cited by 1,146
Bohlin, R., & Kavraki, L. E. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844107 · Cited by 856
A potential field approach to path planning
Hwang, Y. K., & Ahuja, N. (1992) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.127236 · Cited by 684
Research works printed but not linked: 13
- Amato, N. M., Bayazit, O.B., Dale, L.K., Jones, C., and Vallejo, D. 1998. OBPRM: an obstacle-based PRM for 3D workspaces . Proceedings of the 3rd International Workshop on the Algorithmic Foundations of Robotics (WAFR), Houston, TX, March 5–7, pp. 155–168 .
- Canny, J. F. 1988. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA .
- Canny, J. 1995. Computing roadmaps of general semialgebraic sets . Computer Journal 36(5): 504–514 . · doi:10.1093/comjnl/36.5.504
- Erdmann, M. A. 1989. On Probabilistic Strategies for Robot Tasks . PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
- Glavina, B. 1990. Solving findpath by combination of goaldirected and randomized search . Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Cincinnati, OH, pp. 1718–1723 . · doi:10.1109/robot.1990.126257
- Lamiraux, F., and Laumond, J.P. 1996. On the expected complexity of random path planning . Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), Minneapolis, MN, pp. 3306–3311 .
- 10.1145/97880.97915 · doi:10.1145/97880.97915
- Leven, P., and Hutchinson, S. 2000. Real-timemotion planning in changing environments . Proceedings of the International Symposium on Robotics Research, San Francisco, CA.
- Matousek, J. 1999. Geometric Discrepancy Springer-Verlag, Berlin . · doi:10.1007/978-3-642-03942-3
- Mazer, E., Talbi, G., Ahuactzin, J. M., and Bessière, P. 1992. The Ariadne’s clew algorithm . Proceedings of the International Conference of Society of Adaptive Behavior, Honolulu, Hawaii.
- Sloan, I. H., and Joe, S. 1990. Lattice Methods for Multiple tegration. Oxford Science Publications, Englewood Cliffs, NJ .
- Tezuka, S. 2002. Quasi-Monte Carlo: the discrepancy between theory and practice. Monte Carlo and Quasi-Monte Carlo Methods 2000. Fang, F. J. Hickernell, and H. Niederreiter, editors. Springer-Verlag, Berlin , pp. 124–140. · doi:10.1007/978-3-642-56046-0_8
- Wang, X., and Hickernell, F. J. 2002. An historical overview of lattice point sets. Monte Carlo and Quasi-Monte Carlo Methods 2000. Fang, F. J. Hickernell, and H. Niederreiter, editors. Springer-Verlag, Berlin , pp. 158–167. · doi:10.1007/978-3-642-56046-0_10
Cited by
Sampling-based algorithms for optimal motion planning
Karaman, S., & Frazzoli, E. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406761 · Cited by 5,275
A Survey of Motion Planning and Control Techniques for Self-Driving Urban Vehicles
Paden, B., Cap, M., Yong, S. Z., Yershov, D., & Frazzoli, E. (2016) · IEEE Transactions on Intelligent Vehicles · doi:10.1109/tiv.2016.2578706 · Cited by 2,585
A GA-based feature selection and parameters optimizationfor support vector machines
Huang, C.-L., & Wang, C.-J. (2006) · Expert Systems with Applications · doi:10.1016/j.eswa.2005.09.024 · Cited by 1,363
CHOMP: Covariant Hamiltonian optimization for motion planning
Zucker, M., Ratliff, N., Dragan, A. D., Pivtoraiko, M., Klingensmith, M., Dellin, C. M., Bagnell, J. A., & Srinivasa, S. S. (2013) · The International Journal of Robotics Research · doi:10.1177/0278364913488805 · Cited by 758
Path Planning for Autonomous Underwater Vehicles
Petres, C., Pailhas, Y., Patron, P., Petillot, Y., Evans, J., & Lane, D. (2007) · IEEE Transactions on Robotics · doi:10.1109/tro.2007.895057 · Cited by 433
Differentially constrained mobile robot motion planning in state lattices
Pivtoraiko, M., Knepper, R. A., & Kelly, A. (2009) · Journal of Field Robotics · doi:10.1002/rob.20285 · Cited by 393
Ghimire, S., Yaseen, Z. M., Farooque, A. A., Deo, R. C., Zhang, J., & Tao, X. (2021) · Scientific Reports · doi:10.1038/s41598-021-96751-4 · Cited by 288
On the Probabilistic Foundations of Probabilistic Roadmap Planning
Hsu, D., Latombe, J.-C., & Kurniawati, H. (2006) · The International Journal of Robotics Research · doi:10.1177/0278364906067174 · Cited by 260
Discrete abstractions for robot motion planning and control in polygonal environments
Belta, C., Isler, V., & Pappas, G. J. (2005) · IEEE Transactions on Robotics · doi:10.1109/tro.2005.851359 · Cited by 241
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
Alterovitz, R., Simeon, T., & Goldberg, K. (2007) · Robotics: Science and Systems III · doi:10.15607/rss.2007.iii.030 · Cited by 232
“first samples the configuration space, where the sampling can be random [21], pseudo-random [25], or utility-guided [12].”
Huang, J., Hu, X., & Yang, F. (2011) · Measurement · doi:10.1016/j.measurement.2011.02.017 · Cited by 158
Forecasting Energy Consumption of a Public Building Using Transformer and Support Vector Regression
Huang, J., & Kaewunruen, S. (2023) · Energies · doi:10.3390/en16020966 · Cited by 38
Motions in Microseconds via Vectorized Sampling-Based Planning
Thomason, W., Kingston, Z., & Kavraki, L. E. (2024) · 2024 IEEE International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra57147.2024.10611190 · Cited by 28
Aguirre, U., & Urrechaga, E. (2023) · Clinical Chemistry and Laboratory Medicine (CCLM) · doi:10.1515/cclm-2022-0713 · Cited by 17
Hybrid multitask learning reveals sequence features driving specificity in the CRISPR/Cas9 system
Vora, D. S., Yadav, S., & Sundar, D. (2023) · Biomolecules · doi:10.3390/biom13040641 · Cited by 17
Marte, M. J., Carpenter, E., Scimeca, M., Russell-Meill, M., Peñaloza, C., Grasemann, U., Miikkulainen, R., & Kiran, S. (2025) · Stroke · doi:10.1161/strokeaha.124.047867 · Cited by 9
Metadata
- Authors
- LaValle, S. M., Branicky, M. S., & Lindemann, S. R.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2004-08
- Volume
- 23
- Issue
- 7-8
- Pages
- 673-692
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W4246226690
- Cited by
- 436
- References
- 41
- FWCI
- 13.93
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- journals.sagepub.com/page/policies/text-and-data-mining-license (tdm)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.