Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Cited by 436

The DOI matches its Crossref record; 41 of the 41 references it cites were found in a registry or an index.

On the Relationship between Classical Grid Search and Probabilistic Roadmaps

LaValle, Steven M., Branicky, Michael S., Lindemann, Stephen R. · 2004 · The International Journal of Robotics Research

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1177/0278364904045481

Cites

41 of 41 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 13

  1. 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 .
  2. Canny, J. F. 1988. The Complexity of Robot Motion Planning. MIT Press, Cambridge, MA .
  3. Canny, J. 1995. Computing roadmaps of general semialgebraic sets . Computer Journal 36(5): 504–514 . · doi:10.1093/comjnl/36.5.504
  4. Erdmann, M. A. 1989. On Probabilistic Strategies for Robot Tasks . PhD thesis, Massachusetts Institute of Technology, Cambridge, MA.
  5. 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
  6. 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 .
  7. 10.1145/97880.97915 · doi:10.1145/97880.97915
  8. Leven, P., and Hutchinson, S. 2000. Real-timemotion planning in changing environments . Proceedings of the International Symposium on Robotics Research, San Francisco, CA.
  9. Matousek, J. 1999. Geometric Discrepancy Springer-Verlag, Berlin . · doi:10.1007/978-3-642-03942-3
  10. 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.
  11. Sloan, I. H., and Joe, S. 1990. Lattice Methods for Multiple tegration. Oxford Science Publications, Englewood Cliffs, NJ .
  12. 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
  13. 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

See all 436

Metadata

Authors
LaValle, S. M., Branicky, M. S., & Lindemann, S. R.
Venue
The International Journal of Robotics Research
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.