Skip to main content
Planner Comparison
Comparing the geometric planners' effect on path cost over different pathfinding runtimes
Last updated: July 12, 2021
Key Takeaways
- lazyprmstar consistently has the lowest average and standard deviation path cost
- Benefits from a greater number of runs (nr) more than a longer runtime (rs)
- Benefits from a longer total runtime
- rrtconnect, lbtrrt, and lazylbtrrt had significantly higher path costs than the other planners, so filtered them out of the following plots
- Single-query planners are much worse than multi-query ones
Total Runtime: 1 s
Total Runtime: 2 s
Total Runtime: 4 s
Add a comment