A time-dependent graph is, informally speaking, a graph structure dynamically changes with
time. In such graphs, the weights associated with edges dynamically change over time, that …

A shortest-path algorithm finds a path containing the minimal cost between two vertices in a
graph. A plethora of shortest-path algorithms is studied in the literature that span across …

Algorithms for route planning in transportation networks have recently undergone a rapid
development, leading to methods that are up to three million times faster than Dijkstra's …

Robot navigation in the environment with obstacles is still a challenging problem. In this
paper, the navigation problems with wheeled mobile robots (WMRs) are reviewed, the …

A public transportation network can often be modeled as a timetable graph where (i) each
node represents a station; and (ii) each directed edge (u, v) is associated with a timetable …

We investigate the complexity of shortest paths in time-dependent graphs, in which the costs
of edges vary as a function of time, and as a result the shortest path between two nodes s …

This paper considers using drones to conduct the last-mile parcel delivery. To enable the
beyond-battery-lifetime flight, drone stations are considered to replace or recharge the …

In recent years, many speed-up techniques for Dijkstra's algorithm have been developed
that make the computation of shortest paths in static road networks a matter of …

In this paper, we present an overview over existing speed-up techniques for time-dependent
route planning. Apart from only explaining each technique one by one, we follow a more …

Path planning for mobile robots in complex circumstances is still a challenging issue. This
work introduces an improved deep reinforcement learning strategy for robot navigation that …