REAL-TIME VEHICLE PATH PLANNING USING NETWORK DECOMPOSITION

Urban traffic problems have been very serious these days. Therefore providing shortest paths with drivers is very important and for utilizing roads efficiently. In practice, road networks are usually huge-scale and complicated networks. Therefore, general shortest path algorithms are not appropriate since they require much computation time. This paper proposes a new algorithm based on stored data in order to reduce computational burden, and presents a new road network model using hierarchical and spatial network decomposition. The proposed algorithm is suitable for centralized vehicle path planning since the paths are obtained by look-up table method and minimum computation using Dijkstra's algorithm. The simulation results show that the proposed algorithm computes the sub-optimal paths much faster and requires less memory. For the covering abstract see IRRD E102946.

Language

  • English

Subject/Index Terms

Filing Info

  • Accession Number: 00780900
  • Record Type: Publication
  • Source Agency: Transport Research Laboratory
  • ISBN: 89-950073-2-X
  • Files: ITRD
  • Created Date: Jan 7 2000 12:00AM