Go from a given start to different goals given binary image

[Cram3r95]

This github has really interesting codes.

My question is: I do not want to use the whole road map graph around my vehicle, but an efficient way to go from A to the different goals (B1, etc.) using a binary image (driveable area in white, centerlines in red or whatever colour). Would it be possible to go from my start to the different goals using the Fast Marching Method in order to get the shortest path for each case?

Is this more efficient than an A* algorithm?

[espdev]

Is this more efficient than an A* algorithm?

I think no. Fast Marching method works fine on speed maps, on terrain maps with differently passable areas. If you have a binary image, you can use any algorithm for solving maze routing problems (on uniform-cost grids), wave propagation algorithm, or Lee algorithm for example, or Jump Point Search (JPS) (it is optimized A* for uniform-cost graphs). It will be more effective.