The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Randomized preprocessing of configuration for fast path planning
Abstract
This paper presents a new approach to path planning for robots with many degrees of freedom (DOF) operating in known static environments. The approach consists of a preprocessing and a planning stage. Preprocessing, which is done only once for a given environment, generates a network of randomly, but properly selected, collision-free configurations (nodes). Planning then connects any given initial and final configurations of the robot to two nodes of the network and computes a path through the network between these two nodes. Experiments show that after paying the preprocessing cost (on the order of hundreds of seconds), planning is extremely fast (on the order of a fraction of a second for many difficult examples involving a 10-DOF robot). The approach is particularly attractive for many-DOF robots which have to perform many successive point-to-point motions in the same environment.>
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
Self-citationProbabilistic 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
Self-citationRobot Motion Planning: A Distributed Representation Approach
Barraquand, J., & Latombe, J.-C. (1991) · The International Journal of Robotics Research · doi:10.1177/027836499101000604 · Cited by 995
Self-citationNumerical potential field techniques for robot path planning
Barraquand, J., Langlois, B., & Latombe, J.-C. (1992) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/21.148426 · Cited by 889
Self-citationA 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
Real-time robot motion planning using rasterizing computer graphics hardware
Lengyel, J., Reichert, M., Donald, B. R., & Greenberg, D. P. (1990) · Proceedings of the 17th annual conference on Computer graphics and interactive techniques · doi:10.1145/97879.97915 · Cited by 215
A probabilistic learning approach to motion planning
Overmars, M. H., & Švestka, P. (1995) · Cited by 170
Kondo, K. (1991) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.88136 · Cited by 157
Mazer, E., Ahuactzin, J.-M., & Bessìère, P. (1998) · Journal of Artificial Intelligence Research · doi:10.1613/jair.468 · Cited by 127
Computation of configuration-space obstacles using the fast Fourier transform
Kavraki, L. E. (1995) · IEEE Transactions on Robotics and Automation · doi:10.1109/70.388783 · Cited by 116
Self-citationParallel search algorithms for robot motion planning
Challou, D., Gini, M. L., & Kumar, V. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1993.292122 · Cited by 66
Parallel robot motion planning
Lozano‐Pérez, T., & O'Donnell, P. A. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1991.131722 · Cited by 64
Randomized preprocessing of configuration space for path planning: articulated robots
Kavraki, L. E., & Latombe, J.-C. (2002) · IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) · doi:10.1109/iros.1994.407619 · Cited by 51
Self-citationPath planning through variational dynamic programming
Barraquand, J., & Ferbach, P. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351193 · Cited by 37
A practical approach to motion-planning for manipulators with many degrees of freedom
Faverjon, B., & Tournassoud, P. (1991) · OpenGrey (Institut de l'Information Scientifique et Technique) · Cited by 36
A probabilistic approach to motion planning for car-like robots
Švestka, P. (1993) · Cited by 26
Integration of a Path Generation Algorithm into Off-line Programming of AIRBUS Panels
Graux, L., Millies, P., Kociemba, P. L., & Langlois, B. (1992) · SAE technical papers on CD-ROM/SAE technical paper series · doi:10.4271/922404 · Cited by 12
Motion planning for many degrees of freedom: sequential search with backtracking
Gupta, K. K., & Guo, Z. (2003) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1992.220115 · Cited by 12
Cited by
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
Self-citationRRT-connect: An efficient approach to single-query path planning
Kuffner, J. J., & LaValle, S. M. (2000) · Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065) · doi:10.1109/robot.2000.844730 · Cited by 3,555
Learning metric-topological maps for indoor mobile robot navigation
Thrun, S. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(97)00078-7 · Cited by 1,042
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
Self-citationIncremental Sampling-based Algorithms for Optimal Motion Planning
Karaman, S., & Frazzoli, E. (2010) · Robotics: Science and Systems VI · doi:10.15607/rss.2010.vi.034 · Cited by 680
Metadata
- Authors
- Kavraki, L., & Latombe, J.-C.
- Venue
- Proceedings of the 1994 IEEE International Conference on Robotics and Automation
- Publisher
- IEEE Comput. Soc. Press
- Published
- 2002-12-17
- Pages
- 2138-2145
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2146467128
- Cited by
- 412
- References
- 18
- FWCI
- 27.35
- Type
- conference paper
- Language
- en
- Open access
- closed
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.