To model the environment, targets, and obstacles are modeled as geometrical shapes and stored in a data structure, e.g., a graph, whose nodes and edges are represented by points and lines 10. UAVs ...

The path planning algorithms search for the collision-free path between the start and end points while satisfying the evaluation metrics 1. These algorithms are classified as the classical approaches, ...

One of the most classic algorithmic problems deals with calculating the shortest path between two points. A more complicated variant of the problem is when the route traverses a changing network - ...