By Topic

Time-minimum routes in time-dependent networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Fujimura, K. ; Dept. of Comput. & Inf. Sci., Ohio State Univ., Columbus, OH, USA

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

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:11 ,  Issue: 3 )