.png){kind=icon}
.png){kind=icon}
Return
C-FOREST: Parallel Shortest Path Planning With Superlinear Speedup
.png){kind=icon}
OA
AI
DOI：10.1109/TRO.2013.2240176.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
C-FOREST is a parallelization framework for single-query sampling-based shortest path-planning algorithms. Multiple search trees are grown in parallel (e. g., 1 per CPU). Each time a better path is found, it is exchanged between trees so that all trees can benefit from its data. Specifically, the path's nodes increase the other trees' configuration space visibility, while the length of the path is used to prune irrelevant nodes and to avoid sampling from irrelevant portions of the configuration space. Experiments with a robotic team, a manipulator arm, and the alpha benchmark demonstrate that C-FOREST achieves significant superlinear speedup in practice for shortest path-planning problems (team and arm), but not for feasible path panning (alpha).
Keywords:
Distributed computing
efficiency
parallelization
path planning
robots
superlinear speedup
Journal
IF:
10.5
Papers:
3.3K
Citations:
2.8W
