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 ...

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 - ...

Planning a safe and efficient global path in a complex three-dimensional environment is a complex and challenging optimization task. Existing planning algorithms are faced with problems such as ...