Module greedy_best_first_search 

Greedy Best-First Search path planning algorithm

Grid-based path planning using Greedy Best-First Search. Unlike A*, the priority is based solely on the heuristic h(n), ignoring the accumulated cost g(n). This makes it faster in many cases but does NOT guarantee the shortest path.

See https://en.wikipedia.org/wiki/Best-first_search

Structs

GreedyBestFirstConfig

Configuration for Greedy Best-First Search planner

GreedyBestFirstPlanner

Greedy Best-First Search path planner