PATH COMPUTATION IN ADVANCED TRAVELER INFORMATION SYSTEMS

This project focuses on route planning algorithms for Advanced Driver Information Systems (ADIS), which are also known as Advanced Traveler Information Systems (ATIS). Route planning has been approached by graph-theoretic algorithms for all-pair (transitive closure) and single-source (partial transitive) path computations. These algorithms compute many more paths beyond the single-pair path that is of interest to ATIS, and hence may not be satisfactory for ATIS due to the dynamic nature of edge costs (travel-time). For single-pair path computation, we explore specialized algorithms such as A*, which are designed to reduce irrelevant computation and to quickly discover the shortest paths. Our cost models and performance studies show that single-pair algorithms can outperform traditional algorithms in many situations.

Language

  • English

Media Info

  • Features: Figures; References;
  • Pagination: p. 304-312

Subject/Index Terms

Filing Info

  • Accession Number: 00724745
  • Record Type: Publication
  • Files: TRIS
  • Created Date: Aug 14 1996 12:00AM