Skip to content
#

greedy-path-planning

Star

Here is 1 public repository matching this topic...

IbrahimSquared / visibility-based-marching

Star 11

VBM is an efficient exact wave propagation technique that has an O(n) compute and space complexity. Inherently produces globally optimal paths to all grid points. Solves several shortcomings of state-of-the-art FMM.

astar visibility shortest-paths distance-fields wave-propagation vstar eikonal-solver any-angle wavefront-propagation fast-marching-method esdf one-to-all-path-optimization optimal-distance-functions optimal-propagation surface-contour-approximation greedy-path-planning upwind-scheme
  • Updated Apr 4, 2025
  • C++

Improve this page

Add a description, image, and links to the greedy-path-planning topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the greedy-path-planning topic, visit your repo's landing page and select "manage topics."

Learn more