Date: 10 Oct 2002

A Dynamic Window-Based Approximate Shortest Path Re-computation Method for Digital Road Map Databases in Mobile Environments

* Final gross prices may vary according to local VAT.

Get Access


In this paper, we have studied the shortest path re-computation problem that arises in the dynamic route guidance system (DRGS) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods are trivial in that they do not intelligently utilize the previously computed shortest path information. We have developed an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method recomputes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs.