The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Path planning in expansive configuration spaces
Abstract
We introduce the notion of expansiveness to characterize a family of robot configuration spaces whose connectivity can be effectively captured by a roadmap of randomly-sampled milestones. The analysis of expansive configuration spaces has inspired us to develop a new randomized planning algorithm. This algorithm tries to sample only the portion of the configuration space that is relevant to the current query, avoiding the cost of precomputing a roadmap for the entire configuration space. Thus, it is well-suited for problems where a single query is submitted for a given environment. The algorithm has been implemented and successfully applied to complex assembly maintainability problems from the automotive industry.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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 · cited 3×
“Another planner, described in [12], uses random sampling to construct a probabilistic roadmap in the con guration space.”
BackgroundMethodSelf-citationMotwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Self-citationOBBTree: a hierarchical structure for rapid interference detection
Gottschalk, S., Lin, M. C., & Manocha, D. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237244 · Cited by 2,081
Animating rotation with quaternion curves
Shoemake, K. (1985) · ACM SIGGRAPH Computer Graphics · doi:10.1145/325165.325242 · Cited by 1,719
A fast procedure for computing the distance between complex objects in three-dimensional space
Gilbert, E. G., Johnson, D. W., & Keerthi, S. S. (1988) · IEEE Journal on Robotics and Automation · doi:10.1109/56.2083 · Cited by 1,513
Robot 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-citationComplexity of the mover's problem and generalizations
Reif, J. H. (1979) · 20th Annual Symposium on Foundations of Computer Science (sfcs 1979) · doi:10.1109/sfcs.1979.10 · Cited by 765
Animating rotation with quaternion curves
Shoemake, K. (1985) · Proceedings of the 12th annual conference on Computer graphics and interactive techniques - SIGGRAPH '85 · doi:10.1145/325334.325242 · Cited by 684
Randomized preprocessing of configuration for fast path planning
Kavraki, L., & Latombe, J.-C. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.350966 · Cited by 412
Self-citationAnalysis of probabilistic roadmaps for path planning
Kavraki, L. E., Kolountzakis, M. N., & Latombe, J.-C. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.509171 · Cited by 409
Self-citationEfficient distance computation between non-convex objects
Quinlan, S. (2002) · Proceedings of the 1994 IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1994.351059 · Cited by 391
A randomized roadmap method for path and manipulation planning
Amato, N. M., & Wu, Y. (2002) · Proceedings of IEEE International Conference on Robotics and Automation · doi:10.1109/robot.1996.503582 · Cited by 369
A Random Sampling Scheme for Path Planning
Barraquand, J., Kavraki, L., Latombe, J.-C., Motwani, R., Li, T.-Y., & Raghavan, P. (1997) · The International Journal of Robotics Research · doi:10.1177/027836499701600604 · Cited by 277
Self-citationAssembly maintainability study with motion planning
Chang, H. T., & Li, T. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1995.525415 · Cited by 130
Dillmann, R., Rogalla, O., Ehrenmann, M., Zöliner, R., & Bordegoni, M. (2000) · Springer eBooks · doi:10.1007/978-1-4471-0765-1_28 · Cited by 119
Randomized query processing in robot path planning
Kavraki, L. E., Latombe, J., Motwani, R., & Raghavan, P. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225159 · Cited by 104
Self-citationRandomized Query Processing in Robot Path Planning
Kavraki, L. E., Latombe, J., Motwani, R., & Raghavan, P. (1998) · Journal of Computer and System Sciences · doi:10.1006/jcss.1998.1578 · Cited by 75
Self-citationMotion planning with many degrees of freedom-random reflections at C-space obstacles
Horsch, T., Schwarz, F., & Tolle, H. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1994.351060 · Cited by 66
Parallel 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
On the expected complexity of random path planning
Lamiraux, F., & Laumond, J. (2002) · Proceedings - IEEE International Conference on Robotics and Automation/Proceedings · doi:10.1109/robot.1996.509170 · Cited by 48
Cited by
RRT-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
Randomized Kinodynamic Planning
LaValle, S. M., & Kuffner, J. J. (2001) · The International Journal of Robotics Research · doi:10.1177/02783640122067453 · Cited by 3,254
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
The Open Motion Planning Library
Sucan, I. A., Moll, M., & Kavraki, L. E. (2012) · IEEE Robotics & Automation Magazine · doi:10.1109/mra.2012.2205651 · Cited by 1,616
Real-Time Motion Planning With Applications to Autonomous Urban Driving
Kuwata, Y., Karaman, S., Teo, J., Frazzoli, E., How, J. P., & Fiore, G. (2009) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2008.2012116 · Cited by 889
Metadata
- Authors
- Hsu, D., Latombe, J.-C., & Motwani, R.
- Venue
- Proceedings of International Conference on Robotics and Automation
- Publisher
- IEEE
- Published
- 2002-11-22
- Volume
- 3
- Pages
- 2719-2726
- ISSN
- 1050-4729 (ISSN-L)
- OpenAlex
- W2171266831
- Cited by
- 552
- References
- 22
- FWCI
- 17.29
- 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.