Time-minimum routes in time-dependent networks

Route planning for mobile robots in time-dependent networks is investigated. The mobile robot is constrained to move in a prespecified network of roads. The environment contains a set of moving obstacles which are not necessarily constrained to move along arcs of the network and whose motions are assumed to be known. Due to dynamic objects in the environment, connectivity in the network changes over time, i.e., the network is time-dependent. Given such an environment, a method is presented to find a collision-free route in the network that takes the mobile robot from a given start node to a destination node in minimum time. Our method generates a time-minimum path for all time intervals during which the destination node is reachable. The problem is solved by a two-level graph search: (1) path search using a space-time spanning tree, and (2) path search in a time-dependent network. Algorithms for the two subproblems are presented and execution time of the algorithms is analyzed