The problem of minimum risk path planning for flying robots in dangerous environments

We consider the problem of navigating an aircraft in a threat environment to its destination while minimizing the maximum threat level and the length of the aircraft path. The proposed method to construct optimal low-risk aircraft paths involves a simple geometric procedure and is very computationally efficient. The effectiveness of the developed algorithm is confirmed by a number of examples.