I need to generate the shortest possible path for aerial photography using a fixed wing unmanned air vehicle (UAV).
The image below shows the area I'm going to search. The white cells are the cells I want to photograph (must be traversed), and the black tiles are not of interest (doesn't have to be traversed). The middle of each cell is a waypoint/node.
Because the camera view banks when the UAV changes direction, the cost of turning inside the white area is more costly than turning inside the black area.
I have looked at different graph search algorithm like A*, Dijkstras, etc, but I'm unsure how they can be applied.
I'd appreciate any pointers that could help me solve this problem.