In road networks with time-dependent paths, computation of point-to-point shortest paths is of great practical importance. However, there are few papers that describe efficient algorithms. We ...

Extensive studies have been conducted on the Dijkstra algorithm owing to its bright prospect. However, few of them have studied the surface path planning of mobile robots. Currently, some application ...