Suboptimal Map Pathfinding Algorithms

This demo illustrates several different suboptimal path planning algorithms, which are described below.


  1. Choose an algorithm
  2. Choose suboptimality bounds (if appropriate)
  3. Drag to select a path on the map 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 as well as the boundary of the priority function used to determine which state to expand next.

Algorithm: Optimality Bound: Search Weight (when applicable):

Algorithm Descriptions