Shortest Path Algorithms
Shortest Path Algorithms is a class of path-planning algorithms that, given a weighted graph or otherwise discretized representation of an environment, systematically compute a feasible path between specified start and goal states that minimizes a prescribed cost function such as distance, time, or energy.
8.2K
Publications
505.1K
Citations
15.8K
Authors
3.2K
Institutions
Publications per year
2017–2026
1.9K
8.2K
Modeling by shortest data description
J. Rissanen · Automatica · 1978 · 6K citations
Robert W. Floyd · Communications of the ACM · 1962 · 4K citations · Full text
Richard Bellman · Quarterly of Applied Mathematics · 1958 · 2.7K citations · Full text
1–5 of 8.2K
15.8K
30
h-index
27
h-index
23
h-index
21
h-index
21
h-index
1–5 of 15.8K
3.2K
Massachusetts Institute of Technology
Cambridge, United States
58 h-index
222 publications
20.1K citations
HEC Montréal
Montreal, Canada
48 h-index
93 publications
16.4K citations
University of California, Berkeley
Berkeley, United States
47 h-index
141 publications
16.7K citations
Stanford University
Stanford, United States
44 h-index
132 publications
15.5K citations
AT&T (United States)
Bedminster, United States
44 h-index
83 publications
11.6K citations

Centre National de la Recherche Scientifique
Paris, France
42 h-index
235 publications
15.5K citations

Tel Aviv University
Tel Aviv, Israel
42 h-index
174 publications
10.8K citations
Carnegie Mellon University
Pittsburgh, United States
39 h-index
177 publications
11.6K citations
1–8 of 3.2K
269 publications · 27K citations
83
h-index
184 publications · 14.1K citations
67
h-index
145 publications · 13.3K citations
55
h-index
101 publications · 11.6K citations
52
h-index
63 publications · 7.1K citations
41
h-index
1–5