Mining the Shortest Path within a Travel Time Constraint in Road Network Environments

In recent years, a number of studies have been done on GPS (Global Positioning System) due to the wide applications. One important research issue is on the GPS navigation. In this paper, the authors propose a novel data mining algorithm named PATE (prediction-based algorithm for travel time evaluation) that can efficiently predict the travel time of a navigation path and precisely recommends the navigation path to the users under a user-specified travel time constraint in road network environments. To their best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, the authors propose a novel search structure named NPST (navigation path search tree) for efficiently finding the shortest navigation path that meets the user-specified travel time constraint. Through a series of experiments, the proposed method was shown to have excellent performance under different system conditions.


  • English

Media Info

  • Media Type: Web
  • Pagination: pp 593-598
  • Monograph Title: 11th International IEEE Conference on Intelligent Transportation Systems (ITSC 2008)

Subject/Index Terms

Filing Info

  • Accession Number: 01576809
  • Record Type: Publication
  • ISBN: 9781424421114
  • Files: TRIS
  • Created Date: Aug 14 2015 6:18PM