Suboptimal Map Pathfinding Algorithms

This demo illustrates several different suboptimal path planning algorithms. These are modified slightly from the literature to prevent node re-expansions.


  1. Choose an algorithm
  2. Choose suboptimality bounds (if appropriate)
  3. Drag to select a path on the left
  4. The plot on the right visualizes the h (x-axis) and g (y-axis) of each state on the open list.

Algorithm: Optimality Bound: Search Weight: