Open Alivething opened 1 year ago
Implementing the grassfire algorithm on graph-based problems. For any 2D sampled plane divided into finite squares with known obstacles, find the shortest distance between any two points. Assume equal weights.
Use the graph_test.cpp under test to implement grassfire algorithm About grassfire: https://aerial-robotics-iitk.gitbook.io/wiki/concepts/path-planning/untitled Indicate minimum steps required to move from the initial cell to the target cell
I can work on this feature.
vdshah25
commented
1 year ago
Use case
Implementing the grassfire algorithm on graph-based problems. For any 2D sampled plane divided into finite squares with known obstacles, find the shortest distance between any two points. Assume equal weights.
Proposal
Use the graph_test.cpp under test to implement grassfire algorithm About grassfire: https://aerial-robotics-iitk.gitbook.io/wiki/concepts/path-planning/untitled Indicate minimum steps required to move from the initial cell to the target cell