'Is there a way to use Dijkstra's algorithm on an 2D binary map?
For context, I have a project that uses the Coppelia Sim (v-rep) environment and algorithmically generates a black and white map of a maze and other obstacles within the scene. I have no problem converting the black and white image into a 2d array, but I can't figure out if Dijkstra's algorithm would be a viable solution or how I would go about implementing it in python.
Other possible solutions for the project include Dijkstra's, RRT*, PF, PRM path planning algorithms.
I'm just not sure where to start with the implementation or if it's even possible
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|