Open Alivething opened 1 year ago
Implementation of the A* planning algorithm. For any 2D sampled plane divided into finite squares with known obstacles, find the shortest distance between any two points. Assume equal weights. Similar to Grassfire with a metric.
Implement the A algorithm to use the graph in /test directory. For info about A: https://www.geeksforgeeks.org/a-search-algorithm/
Use case
Implementation of the A* planning algorithm. For any 2D sampled plane divided into finite squares with known obstacles, find the shortest distance between any two points. Assume equal weights. Similar to Grassfire with a metric.
Proposal
Implement the A algorithm to use the graph in /test directory. For info about A: https://www.geeksforgeeks.org/a-search-algorithm/