This repository implements some common path planning algorithms used in robotics. It will be continuously updated.
complicated path, useless.
In this scene, the cost of the edge is same. So the method of Dijkstra is equal to the BFS.
- A*: A Formal Basis for the heuristic Determination of Minimum Cost Paths
- Eigen
- matplotlib in c++
matplotlib in c++ can plot but can not save the gif figure.