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
156
1–5 of 156
422
5
h-index
4
h-index
4
h-index
4
h-index
3
h-index
1–5 of 422
184
University of Southern California
Los Angeles, United States
7 h-index
20 publications
1.2K citations
Carnegie Mellon University
Pittsburgh, United States
6 h-index
14 publications
521 citations
Massachusetts Institute of Technology
Cambridge, United States
5 h-index
9 publications
395 citations
Ben-Gurion University of the Negev
Beersheba, Israel
4 h-index
12 publications
412 citations
University of Pennsylvania
Philadelphia, United States
4 h-index
9 publications
190 citations
Norwegian University of Science and Technology
Trondheim, Norway
3 h-index
7 publications
255 citations
University of California, Santa Barbara
Santa Barbara, United States
3 h-index
8 publications
638 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
3 h-index
5 publications
355 citations
1–8 of 184
6 publications · 391 citations
6
h-index
6 publications · 272 citations
6
h-index
4 publications · 97 citations
4
h-index
4 publications · 158 citations
4
h-index
3 publications · 73 citations
3
h-index
1–5