There are several shortest-path search algorithms such as A-star, D-star and Dijkstra. These
algorithms are widely used in automotive vehicles and mobile navigation systems. As the …

The traditional A∗ algorithm is time‐consuming due to a large number of iteration operations
to calculate the evaluation function and sort the OPEN list. To achieve real‐time path …

This study introduces an optimization approach for calculating the shortest path in mobile
robot route planning. The proposed solution targets real-time processing requirements by …

Shortest-path search over large scale graphs is widely used in various applications.
However, shortest path algorithms such as Dijkstra's algorithm include complex processing …

Efficient emergency response systems are crucial for smart cities. But their implementation is
highly challenging, particularly in regions like Chad where infrastructural constraints are …

In this paper, a new FPGA-based parallel processor for shortest path searching for OSPF
networks is designed and implemented. The processor design is based on parallel …

Shortest-path search over graphs plays an important role in various applications. However,
shortest path algorithms such as the Dijkstra's algorithm include complex processings. It is …

Graph theory-based analyses of brain network topology can be used to model the
spatiotemporal correlations in neural activity detected through fMRI, and such approaches …

In order to propose a novel discrete differential evolution algorithm for stochastic vehicle
routing problems (SVRP), the two bit wise operators of the computer language are …

In this paper, a pipelined-parallel hardware architecture to compute the shortest paths of
OSPF networks is proposed based on parallel shortest path searching algorithm. OSPF …