Distributed Path Planning

Distributed Path Planning is a coordination method in which multiple autonomous agents collaboratively compute intersecting or interdependent routes to reach their respective goals while avoiding conflicts, under the constraint that each agent operates with limited global information and relies on local computations and peer-to-peer communication.

156

Publications

6.5K

Citations

422

Authors

184

Institutions

Publications per year

2017–2026

70

Authors

422

  1. SK
    Sven Koenig

    University of Southern California, United States

    5 publications · 369 citations

    5

    h-index

  2. AF
    Ariel Felner

    Ben-Gurion University of the Negev, Israel

    4 publications · 141 citations

    4

    h-index

  3. DR
    Daniela Rus

    Massachusetts Institute of Technology, United States

    4 publications · 130 citations

    4

    h-index

  4. TK
    T. K. Satish Kumar

    University of Southern California, United States

    4 publications · 279 citations

    4

    h-index

  5. JL
    Jiaoyang Li

    University of Southern California, United States

    3 publications · 139 citations

    3

    h-index

1–5 of 422

Venues

  1. 6

    h-index

  2. IEEE Transactions on Robotics

    6 publications · 272 citations

    6

    h-index

  3. IFAC-PapersOnLine

    4 publications · 97 citations

    4

    h-index

  4. Journal of Intelligent & Robotic Systems

    4 publications · 158 citations

    4

    h-index

  5. Robotics and Autonomous Systems

    3 publications · 73 citations

    3

    h-index

1–5