The DOI matches its Crossref record.
OBPRM: An Obstacle-Based PRM for 3D Workspaces
Abstract
Recently, a new class of randomized path planning methods, known as Probabilistic Roadmap Methods (prms) have shown great potential for solving compli cated high-dimensional problems, pr m s use randomiza tion (usually during preprocessing) to construct a graph of representative paths in C-space (a roadmap) whose vertices correspond to collision-free configurations of the robot and in which two vertices are connected by an edge if a path between the two corresponding config urations can be found by a local planning method.
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
Cited by
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
The bridge test for sampling narrow passages with probabilistic roadmap planners
Hsu, D., Jiang, T., Reif, J., & Sun, Z. (2004) · 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422) · doi:10.1109/robot.2003.1242285 · Cited by 355
Elastic Strips: A Framework for Motion Generation in Human Environments
Brock, O., & Khatib, O. (2002) · The International Journal of Robotics Research · doi:10.1177/027836402128964189 · Cited by 352
MAPRM: a probabilistic roadmap planner with sampling on the medial axis of the free space
Wilmarth, S. A., Amato, N. M., & Stiller, P. F. (2003) · Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C) · doi:10.1109/robot.1999.772448 · Cited by 338
Metadata
- Venue
- Robotics: The Algorithmic Perspective
- Publisher
- A K Peters/CRC Press
- Published
- 1998-12-15
- Pages
- 165-178
- OpenAlex
- W3115270213
- Cited by
- 246
- References
- 0
- FWCI
- 3.58
- Type
- book chapter
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: OBPRM: An Obstacle-Based PRM for 3D Workspaces. https://app.cochat.ai/papers/10.1201/9781439863886-19
- The paper
- OBPRM: An Obstacle-Based PRM for 3D Workspaces. (1998). Robotics: The Algorithmic Perspective. https://doi.org/10.1201/9781439863886-19
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.