Dijkstra's algorithmWe generalize the Dijkstra algorithm to the Biobjective Shortest Path (BSP) problem. The proposed method keeps only one candidate label per node in a priority queue of size n. In this way, we introduce a novel algorithm to solve the one-to-all BSP problem determining all...
In the path planning problem of mobile robot in static complex obstacle environment, the original slime mold algorithm (SMA) has some shortcomings, such as initial solution error and easy to fall into local optimum, which leads to low accuracy of robot path planning. A novel Baldwin learning ef...
Then, Dijkstra shortest path (SP) algorithm [9] is used to find the route minimizing the cost function. The time to traverse the route is commonly used as cost. This is what navigator tools like Tomtom, Google Maps, or Waze do. Distance is also a common parameter that can be easily ...
which can solve the shortest path planning task of escape from multi-source point to multi-sink point and has fast and efficient characteristics of the original Dijkstra algorithm, thus improving the escape efficiency of personnel. In the end, this paper simulates the improved algorithm using the...
Dijkstra's algorithmWe generalize the Dijkstra algorithm to the Biobjective Shortest Path (BSP) problem. The proposed method keeps only one candidate label per node in a priority queue of size n. In this way, we introduce a novel algorithm to solve the one-to-all BSP problem determining all...