Path finding models attempt to provide efficient approaches for finding shortest paths in
networks. A well-known shortest path algorithm is the Dijkstra algorithm. This paper …

Although there exist efficient methods to determine an optimal path in a graph, such as
Dijkstra and A* algorithms, large instances of the path planning problem need more …

In the Unmanned Aerial Vehicle (UAV) system, finding a flight planning path with low cost
and fast search speed is an important problem. However, in the complex three-dimensional …

A microgrid is a typical cyber-physical system. The coordinated control of each unit in a
microgrid mainly relies on the cyber system. Once performance degradation of the cyber …

VLSI design is probably the most fascinating application area of combinatorial optimization.
Virtually all classical combinatorial optimization problems, and many new ones, occur …

We consider the single-source shortest path (SSSP) problem: given an undirected graph
with integer edge weights and a source vertex, find the shortest paths from to all other …

Traditionally, vehicle route planning problem focuses on route optimization based on traffic
data and surrounding environment. This paper proposes a novel extended vehicle route …

Path planning is a fundamental optimization problem that is crucial for the navigation of a
mobile robot. Among the vast array of optimization approaches, we focus in this paper on …

This paper proposes an effective global path planning technique for cellular-connected
UAVs to enhance the reliability of unmanned aerial vehicles'(UAVs) flights operating beyond …

All pairs shortest path (APSP) is a classical problem with diverse applications. Traditional
algorithms are not suitable for real time applications, so it is necessary to investigate parallel …