Skip to content

Latest commit

 

History

History
25 lines (16 loc) · 626 Bytes

README.md

File metadata and controls

25 lines (16 loc) · 626 Bytes

Lanboost's Pathfinding

A "simple" pathfinding library I created one weekend for a project I was doing. The library includes A-star (A*) and SubGoal Optimized path finding.

Algorithms

  • Generic A-star
  • 2D based SubGoal graph optimal pathfinder [1]

Example

https://lanboost.github.io/LanboostPathfindingSharp/

Dependencies

  • OptimizedPriorityQueue
  • Moq [Test]

References

[1]

URAS, Tansel; KOENIG, Sven; HERNÁNDEZ, Carlos.

Subgoal graphs for optimal pathfinding in eight-neighbor grids.

In: Proceedings of the International Conference on Automated Planning and Scheduling. 2013.