Shortest Path Planning is a computational method within the field of robot motion planning that identifies the minimal-length trajectory connecting two configurations in a workspace, typically by leveraging a visibility graph to encode feasible straight-line paths among obstacles.
1.2K
Publications
60.2K
Citations
3.3K
Authors
1.1K
Institutions
Publications per year
2017–2026
459
Publications
1.2K
Fast planning through planning graph analysis
Avrim Blum, Merrick L. Furst · Artificial Intelligence · 1997 · 1.6K citations
An Appraisal of Some Shortest-Path Algorithms
Stuart E. Dreyfus · Operations Research · 1969 · 997 citations
Robert Bohlin, Lydia E. Kavraki · 2000 · 858 citations
1–5 of 1.2K
Authors
3.3K
- SK
14
h-index
- OS
10
h-index
- JS
8
h-index
- PT
8
h-index
- DH
6
h-index
1–5 of 3.3K
Institutions
1.1K
Georgia Institute of Technology
Atlanta, United States
17 h-index
45 publications
1.8K citations
University of Southern California
Los Angeles, United States
16 h-index
34 publications
2.8K citations
University of California, Berkeley
Berkeley, United States
15 h-index
34 publications
3.4K citations
Nanyang Technological University
Singapore, Singapore
14 h-index
28 publications
1.3K citations
Carnegie Mellon University
Pittsburgh, United States
13 h-index
36 publications
4.8K citations
Massachusetts Institute of Technology
Cambridge, United States
12 h-index
29 publications
2.7K citations
Tsinghua University
Beijing, China
12 h-index
32 publications
2.3K citations
University of Illinois Urbana-Champaign
Urbana, United States
11 h-index
19 publications
944 citations
1–8 of 1.1K
Venues
- IEEE Access
22 publications · 827 citations
17
h-index
- Sensors
13 publications · 766 citations
13
h-index
- Robotics and Autonomous Systems
13 publications · 1.3K citations
13
h-index
- IEEE Transactions on Robotics and Automation
12 publications · 1.7K citations
12
h-index
- Ocean Engineering
11 publications · 844 citations
11
h-index
1–5