Path finding around obstacles
Oct 14, 2024
The A* algorithm is a way to find paths around obstacles.
Scaling up the grid size from an example problem of 4x4 to a real world scenario increases compute cost.
Uniform discretization of the grid is ineffecient.
Large obstacle-free areas can be discretized with lower resolution.
Areas near boundaries have to be discretized more finely.
