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

  1. lazyprmstar consistently has the lowest average and standard deviation path cost
    1. Benefits from a greater number of runs (nr) more than a longer runtime (rs)
    2. Benefits from a longer total runtime
    3. Try even shorter runtimes?
    4. Try more multi-query planners? https://ompl.kavrakilab.org/planners.html
  2. rrtconnect, lbtrrt, and lazylbtrrt had significantly higher path costs than the other planners, so filtered them out of the following plots
    1. Single-query planners are much worse than multi-query ones

Total Runtime: 1 s


192 selected runs
192 selected runs


Total Runtime: 2 s


192 selected runs
192 selected runs
192 selected runs


Total Runtime: 4 s


192 selected runs
192 selected runs
192 selected runs
192 selected runs