Cited by 1,616Robotic Path Planning AlgorithmsAI-based Problem Solving and PlanningReinforcement Learning in Robotics

The Open Motion Planning Library

Sucan, Ioan A., Moll, Mark, Kavraki, Lydia E.·2012·IEEE Robotics & Automation Magazine

Abstract

The open motion planning library (OMPL) is a new library for sampling-based motion planning, which contains implementations of many state-of-the-art planning algorithms. The library is designed in a way that it allows the user to easily solve a variety of complex motion planning problems with minimal input. OMPL facilitates the addition of new motion planning algorithms, and it can be conveniently interfaced with other software components. A simple graphical user interface (GUI) built on top of the library, a number of tutorials, demos, and programming assignments are designed to teach students about sampling-based motion planning. The library is also available for use through Robot Operating System (ROS).

Integrity signals

Registry

Crossref · 10.1109/mra.2012.2205651

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Sampling-based motion planning faces performance degradation with increasing occluders as the probability of valid sampling rapidly diminishes.

    “Moreover, sampling-based motion planning [19, 35], a kind of commonly used approach for planning and manipulation, also faces performance degradation with increasing occluders [38] as the probability of valid sampling rapidly diminishes.”
  • Point-level affordance may be more suitable than sampling-based planners for manipulating articulated objects within complex constraints, because it directly provides per-point actionable priors.

    “Comparisons between RTT-CA and affordance methods show that, while sampling-based planners may face difficulty in complicated scenes, point-level affordance may be more suitable by directly providing per-point actionable priors for manipulating articulated objects within complex constraints.”

Cites

Flagged first, then by citations

Cited by

Sorted by citations

Authors
Sucan, I. A., Moll, M., & Kavraki, L. E.
Affiliations
Rice University (US)
Venue
IEEE Robotics & Automation Magazine
Published
2012-12
Volume
19
Issue
4
Pages
72-82
ISSN
  • 1070-9932 (ISSN-L)
  • 1558-223X
OpenAlex
W2110762409
Cited by
1,616
References
2
Citations by year
2026: 92 · 2025: 144 · 2024: 115 · 2023: 148 · 2022: 148 · 2021: 150 · 2020: 161 · 2019: 144 · 2018: 135 · 2017: 93 · 2016: 77 · 2015: 85 · 2014: 63 · 2013: 46 · 2012: 10
FWCI
67.21
Type
journal article
Language
en
Open access
closed
Locations
IEEE Robotics & Automation Magazine (publishedVersion)
Funders
  • National Science Foundation
  • Rice University
Topics
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Robotic Path Planning Algorithms
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
Keywords
sampling-based motion planning, motion planning algorithms, robot path planning, Robot Operating System, graphical user interface, educational robotics

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