A Simplified Method to Estimate Travel Cost based on Traffic-Adaptable Heuristics for Accelerating Path Search

  • Kim, Jin-Deog
  • Published : 2007.09.30

Abstract

In the telematics system, a reasonable path search time should be guaranteed from a great number of user's queries, even though the optimal path with minimized travel time might be continuously changed by the traffic flows. Thus, the path search method should consider traffic flows of the roads and the search time as well. However, the existing path search methods are not able to cope efficiently with the change of the traffic flows and to search rapidly paths simultaneously. This paper proposes a new path search method for fast computation. It also reflects the traffic flows efficiently. Especially, in order to simplify the computation of variable heuristic values, it employs a simplification method for estimating values of traffic-adaptable heuristics. The experiments are carried out with the $A^*$ algorithm and the proposed method in terms of the execution time, the number of node accesses and the accuracy. The results obtained from the experiments show that the method achieves very fast execution time and the reasonable accuracy as well.

Keywords

Telematics;Path Search;Heuristics;Traffic Flows

References

  1. http://en.wikipedia.org/wikiA%2A_search_algorithm
  2. William Stallings, 'Data & Computer Communi¬cations, sixth Edition', Prentice Hall, Inc, 2001
  3. Se-Il Lee, ''Units' Path Finding Method Proposal for A*Algorithm in the Tilemap, Journal of KCSI, Vol. 9, No. 3, pp. 71-77, 2004
  4. htp://drive.nate.com
  5. Stefano Pallottino, Maria Grazia Scutella, 'Shortest Path Algorithms in Transportation Models : Classical and Innovative Aspects', TR, Univ. of Pisa, 1998
  6. Woo Young Kwon, Sanghoon Lee, Il Hong Suh, 'A reinforcement learning approach involving a shortest path finding algorithm', Proc. of IROS2003, Vol. 1, pp. 436-441, 2003
  7. Sungwon Jung, Sakti Pramanik, 'An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps', TKDE, Vol. 14, No. 5, pp.1029-1046, 2002
  8. http://theory.stanford.edu/~amitp/Game. Programming
  9. Stephan Winter, 'Modeling Costs of Truns in Route Planning', Journal of GeoInformatica, Vol. 6, No. 4, pp. 345-360, 2002 https://doi.org/10.1023/A:1020853410145
  10. H. Kaindl, G. Kainz, 'Bidirectional Heuristic Search Reconsidered', Journal of Artificial Intelligence Research, Vol.7, pp.283-317, 1997 https://doi.org/10.1613/jair.460
  11. T. A. Yang, S. Shekhar, B. Hamidzadeh and P. A. Hancock, 'Path planning and evaluation in IVHS databases,' VNIS, pp.283-290, 1991
  12. J. D. Kim, D.H. Kim, D.S. Cho, C.H. Ban, K.H. Kim, K.W. Min, 'An Efficient Path Search Method based on Adjustable Heuristic to Traffic Flow', APIS, Vol. 6, pp. 510-513, 2007
  13. http://qnavi.bizemeka.com
  14. G. R. Jagadeesh, T. Srikanthan, K. H. Quek, 'Heuristic Techniques for Accelerating Hierarchical Routing on Road Networks', IEEE Trans. Intelligent Transportation Systems, Vol. 3, No. 4, pp. 301-309, 2002 https://doi.org/10.1109/TITS.2002.806806
  15. Hyun-Sub Lee, Jun-Hwan An, Jin-Deog Kim, 'Optimal Path Navigation Algorithm based on Traffic Information', Proc. of KMIC, Vol.8, No. 2, pp. 425-428, 2004
  16. H. Lu, B.C. Ooi, 'Spatial Indexing : Past and Future', IEEE Data Engineering Bulletin, Vol. 16, No. 3, pp 16-21, 1993