Graph Search Planning
Graph Search Planning is a motion planning method that belongs to the class of discrete search-based approaches, wherein feasible paths in a configuration space are computed by exploring a graph representation of the environment through systematic node expansion and edge traversal to find an optimal or feasible solution from start to goal.
62
Publications
2.2K
Citations
161
Authors
70
Institutions
Publications per year
2017–2026
14
Variants
Search-based Motion Planning
62
Planning a minimum-time trajectories for robot arms
Gideon Sahar, JM Hollerbach · 2005 · 115 citations · Full text
Control of a bow leg hopping robot
Garth Zeglin, Bryan L. Brown · 2002 · 84 citations
Engineering, Mechatronics Engineering, Robotics Engineering +17
1–5 of 62
161
4
h-index
4
h-index
3
h-index
3
h-index
2
h-index
1–5 of 161
70
Carnegie Mellon University
Pittsburgh, United States
9 h-index
22 publications
932 citations
ETH Zurich
Zurich, Switzerland
6 h-index
12 publications
256 citations
Arizona State University
Tempe, United States
4 h-index
8 publications
156 citations
Mississippi State University
Starkville, United States
2 h-index
2 publications
70 citations
University of Pennsylvania
Philadelphia, United States
2 h-index
3 publications
302 citations
Centre Inria de l'Université Grenoble Alpes
Montbonnot-Saint-Martin, France
2 h-index
2 publications
104 citations
Intel (United States)
Santa Clara, United States
2 h-index
2 publications
52 citations

Durham University
Durham, United Kingdom
2 h-index
4 publications
142 citations
1–8 of 70
JAIR · 3 publications · 136 citations
3
h-index
Repository · 3 publications · 178 citations
3
h-index
Conference · 2 publications · 38 citations
2
h-index
Repository · 2 publications · 41 citations
2
h-index
2 publications · 96 citations
2
h-index
1–5