C-space Search
C-Space Search is a computational method in robotics and motion planning that systematically explores the configuration space to identify feasible or optimal paths by distinguishing itself from general search algorithms through its specialized adaptation to the topological and geometric constraints of the robot’s joint and workspace limitations.
60
Publications
2.5K
Citations
116
Authors
60
Institutions
Publications per year
2017–2026
7
Parents
60
A randomized roadmap method for path and manipulation planning
Nancy M. Amato, You Wu · 2002 · 372 citations
1–5 of 60
116
7
h-index
7
h-index
3
h-index
3
h-index
3
h-index
1–5 of 116
60
Simon Fraser University
Burnaby, Canada
8 h-index
15 publications
303 citations
Texas A&M University
College Station, United States
8 h-index
23 publications
2.1K citations
Institut de Robòtica i Informàtica Industrial
Barcelona, Spain
4 h-index
10 publications
308 citations
Universitat Politècnica de Catalunya
Barcelona, Spain
4 h-index
10 publications
308 citations
The University of Tokyo
Tokyo, Japan
3 h-index
8 publications
850 citations
Carnegie Mellon University
Pittsburgh, United States
3 h-index
6 publications
172 citations
University of Sarajevo
Sarajevo, Bosnia and Herzegovina
3 h-index
7 publications
118 citations
Intel (United States)
Santa Clara, United States
3 h-index
4 publications
83 citations
1–8 of 60
IJRR · 5 publications · 133 citations
5
h-index
2 publications · 56 citations
2
h-index
2 publications · 43 citations
2
h-index
2 publications · 269 citations
2
h-index
1 publications · 12 citations
1
h-index
1–5