• Home
  • Search
  • Mining the Shortest Path within a Travel Time Constraint in Road Network Environments
  • Cite Icon9
  • https://doi.org/10.1109/itsc.2008.4732601Copy DOI Icon

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

  • Oct 1, 2008
  • Eric Hsueh-Chan Lu +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

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, we 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 our best knowledge, this is the first work on discovering the shortest navigation path within a travel time constraint. Furthermore, we 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.

Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.