Shortest Path Optimization
Shortest Path Optimization is a computational geometry method that determines the minimal-length trajectory connecting two points within a constrained environment while avoiding obstacles and adhering to specified geometric constraints.
1K
Publications
49.6K
Citations
2.7K
Authors
984
Institutions
Publications per year
2017–2026
347
Parents
1K
Richard Bellman · Quarterly of Applied Mathematics · 1958 · 2.7K citations · Full text
An Appraisal of Some Shortest-Path Algorithms
Stuart E. Dreyfus · Operations Research · 1969 · 997 citations
Efficient routing on complex networks
Gang Yan, Tao Zhou, Bo Hu et al. · Physical Review E · 2006 · 631 citations · Full text
1–5 of 1K
2.7K
9
h-index
University of Electronic Science and Technology of China, China
8 publications · 622 citations
8
h-index
8
h-index
6
h-index
6
h-index
1–5 of 2.7K
984
The University of Texas at Austin
Austin, United States
12 h-index
19 publications
1.1K citations
Tsinghua University
Beijing, China
12 h-index
31 publications
1K citations
University of California, Berkeley
Berkeley, United States
12 h-index
23 publications
1.9K citations
Massachusetts Institute of Technology
Cambridge, United States
11 h-index
17 publications
2.6K citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
11 h-index
13 publications
1.5K citations

Chinese Academy of Sciences
Beijing, China
10 h-index
17 publications
991 citations

Tel Aviv University
Tel Aviv, Israel
10 h-index
15 publications
1.4K citations
Eindhoven University of Technology
Eindhoven, The Netherlands
10 h-index
14 publications
575 citations
1–8 of 984
23 publications · 1.1K citations
20
h-index
23 publications · 1.6K citations
17
h-index
16 publications · 2.6K citations
16
h-index
17 publications · 605 citations
14
h-index
17 publications · 1.5K citations
14
h-index
1–5