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

Authors

834

  1. LE
    Lydia E. Kavraki

    Rice University, United States

    25 publications · 3.3K citations

    18

    h-index

  2. EF
    Emilio Frazzoli

    Massachusetts Institute of Technology, United States

    17 publications · 2K citations

    15

    h-index

  3. EP
    Erion Plaku

    Catholic University of America, United States

    19 publications · 937 citations

    15

    h-index

  4. NM
    Nancy M. Amato

    Texas A&M University, United States

    21 publications · 1K citations

    14

    h-index

  5. SK
    Sertaç Karaman

    Massachusetts Institute of Technology, United States

    14 publications · 1.9K citations

    13

    h-index

1–5 of 834

Venues

  1. The International Journal of Robotics Research

    IJRR · 36 publications · 4K citations

    27

    h-index

  2. IEEE Transactions on Robotics

    19 publications · 1.9K citations

    18

    h-index

  3. IEEE Robotics and Automation Letters

    20 publications · 731 citations

    16

    h-index

  4. arXiv (Cornell University)

    Repository · 19 publications · 509 citations

    15

    h-index

  5. 12

    h-index

1–5