The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Creating High-quality Paths for Motion Planning
Open accessAbstract
Many algorithms have been proposed that create a path for a robot in an environment with obstacles. Most methods are aimed at finding a solution. However, for many applications, the path must be of a good quality as well. That is, a path should be short and should keep some amount of minimum clearance to the obstacles. Traveling along such a path reduces the chances of collisions due to the difficulty of measuring and controlling the precise position of the robot. This paper reports a new technique, called Partial shortcut, which decreases the path length. While current methods have difficulties in removing all redundant motions, the technique efficiently removes these motions by interpolating one degree of freedom at a time. Two algorithms are also studied that increase the clearance along paths. The first one is fast but can only deal with rigid, translating bodies. The second algorithm is slower but can handle a broader range of robots, including three-dimensional free-flying and articulated robots, which may reside in arbitrary high-dimensional configuration spaces. A big advantage of these algorithms is that clearance along paths can now be increased efficiently without using complex data structures and algorithms. Finally, we combine the two criteria and show that high-quality paths can be obtained for a broad range of robots.
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
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 3×
“com Method (Kavraki et al. 1996) and the Rapidly-exploring Random Tree (Kuffner and LaValle 2000), have been devised to tackle this problem.”
InfluentialSelf-citation
Cited by
Sampling-Based Robot Motion Planning: A Review
Elbanhawi, M., & Simic, M. (2014) · IEEE Access · doi:10.1109/access.2014.2302442 · Cited by 786
Kinodynamic RRT*: Asymptotically optimal motion planning for robots with linear dynamics
Webb, D. J., & van den Berg, J. (2013) · 2013 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2013.6631299 · Cited by 409
LQG-MP: Optimized path planning for robots with motion uncertainty and imperfect state information
van den Berg, J., Abbeel, P., & Goldberg, K. (2011) · The International Journal of Robotics Research · doi:10.1177/0278364911406562 · Cited by 395
Sampling-Based Path Planning on Configuration-Space Costmaps
Jaillet, L., Cortés, J., & Siméon, T. (2010) · IEEE Transactions on Robotics · doi:10.1109/tro.2010.2049527 · Cited by 367
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
Metadata
- Authors
- Geraerts, R., & Overmars, M. H.
- Venue
- The International Journal of Robotics Research
- Publisher
- SAGE Publications
- Published
- 2007-08
- Volume
- 26
- Issue
- 8
- Pages
- 845-863
- ISSN
- 0278-3649 (ISSN-L)
- 1741-3176
- OpenAlex
- W2167348159
- Cited by
- 220
- References
- 1
- FWCI
- 6.11
- Type
- journal article
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Creating High-quality Paths for Motion Planning. https://app.cochat.ai/papers/10.1177/0278364907079280
- The paper
- Geraerts, R., & Overmars, M. H. (2007). Creating High-quality Paths for Motion Planning. The International Journal of Robotics Research. https://doi.org/10.1177/0278364907079280
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.