This repository utilizes path planning algorithms for navigation.

Pathfinding is to use algorithms to find the minimum path from the start node to end node. The algorithms may include but not limit to A*, D*, BFS, DFS, Dijkstra. This repo will mainly focus on the high-performance version of Pathfinding.