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

Authors

116

  1. KG
    Kamal Gupta

    Simon Fraser University, Canada

    7 publications · 157 citations

    7

    h-index

  2. NM
    Nancy M. Amato

    Texas A&M University, United States

    7 publications · 716 citations

    7

    h-index

  3. YY
    Yong Yu

    Kagoshima University, Japan

    3 publications · 70 citations

    3

    h-index

  4. DV
    Daniel Vallejo

    Texas A&M University, United States

    3 publications · 286 citations

    3

    h-index

  5. MM
    Marco Morales

    Texas A&M University, United States

    3 publications · 58 citations

    3

    h-index

1–5 of 116

Venues

  1. The International Journal of Robotics Research

    IJRR · 5 publications · 133 citations

    5

    h-index

  2. IEEE Transactions on Robotics

    2 publications · 56 citations

    2

    h-index

  3. Journal of Robotic Systems

    2 publications · 43 citations

    2

    h-index

  4. IEEE Transactions on Robotics and Automation

    2 publications · 269 citations

    2

    h-index

  5. 1

    h-index

1–5