Sampling-based Motion Planning
Sampling-Based Motion Planning is a motion planning method that belongs to the class of algorithms using randomized or deterministic sampling of the configuration space, distinguished by its reliance on generating feasible configurations and connecting them to form a path while avoiding obstacles, without explicitly constructing the entire space.
470
Publications
26.7K
Citations
834
Authors
274
Institutions
Publications per year
2017–2026
205
Variants
Sampling-based Motion Planning Algorithms
470
The Open Motion Planning Library
Ioan A. Şucan, Mark Moll, Lydia E. Kavraki · IEEE Robotics & Automation Magazine · 2012 · 1.6K citations
Incremental Sampling-based Algorithms for Optimal Motion Planning
Sertaç Karaman, Emilio Frazzoli · 2010 · 667 citations · Full text
1–5 of 470
834
18
h-index
15
h-index
15
h-index
14
h-index
13
h-index
1–5 of 834
274
Massachusetts Institute of Technology
Cambridge, United States
23 h-index
83 publications
7.4K citations
Carnegie Mellon University
Pittsburgh, United States
21 h-index
53 publications
4.5K citations

Rice University
Houston, United States
19 h-index
65 publications
9.8K citations
Stanford University
Stanford, United States
16 h-index
57 publications
6.5K citations
University of Illinois Urbana-Champaign
Urbana, United States
16 h-index
35 publications
1.9K citations
University of North Carolina at Chapel Hill
Chapel Hill, United States
16 h-index
42 publications
1.9K citations

Laboratoire d'Analyse et d'Architecture des Systèmes
Toulouse, France
14 h-index
40 publications
3.8K citations
Texas A&M University
College Station, United States
14 h-index
65 publications
3.2K citations
1–8 of 274
IJRR · 36 publications · 4K citations
27
h-index
19 publications · 1.9K citations
18
h-index
20 publications · 731 citations
16
h-index
Repository · 19 publications · 509 citations
15
h-index
Conference · 15 publications · 517 citations
12
h-index
1–5