Advertisement

Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree

  • Yun Bai
  • Yanyan Guo
  • Xiaofeng Meng
  • Tao Wan
  • Karine Zeitouni
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3841)

Abstract

Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a challenge due to the highly variable traffic state and the requirement of fast, on-line computations. This motivates us to design an intelligent city traffic control system, which is based on an extension of the Quad-tree access method that adapts better to the road networks while it maintains aggregated information on traffic density according to hierarchy levels. Based on this index, a view-based hierarchy search method is proposed to accelerate the optimal path computation. At the end, the experiment will show this index structure to be effective and efficient.

Keywords

Global Position System Road Network Optimal Path Road Segment Reference Area 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barbara, D.: Mobile Computing and Databases - A Survey. IEEE Transactions on Knowledge and Data Engineering 11(1), 108–117 (1999)CrossRefGoogle Scholar
  2. 2.
    Chon, H., Agrawal, D., Abbadi, A.E.: FATES: Finding A Time dEpendent Shortest path. In: Proc. of Int. Conf. on Mobile Data Management, pp. 165–180 (2003)Google Scholar
  3. 3.
    Deo, N., Pang, C.Y.: Shortest path algorithms: taxonomy and annotation. Networks 14, 275–323 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research, Part B: Methodological 32(7), 499–516 (1996)CrossRefGoogle Scholar
  5. 5.
    Dijkstra, E.W.: A note on two problems in Connection with graphs. Numerische Mathematik 1, 269–271 (1959)zbMATHCrossRefMathSciNetGoogle Scholar
  6. 6.
    Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-based Dynamic Attribute Indexing Method. The Computer Journal, 185–200 (1998)Google Scholar
  7. 7.
    Nievergelt, J., Hinterberger, H.: The Grid File: An Adaptable, Symmetric Multikey File Structure. Proc. of ACM Trans. On Database Systems 9(1), 38–71 (1984)CrossRefGoogle Scholar
  8. 8.
    Brinkhoff, T.: Network-based Generator of Moving Objects, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generastor

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Yun Bai
    • 1
  • Yanyan Guo
    • 1
  • Xiaofeng Meng
    • 1
  • Tao Wan
    • 2
  • Karine Zeitouni
    • 2
  1. 1.Information SchoolRenmin University of ChinaBeijingChina
  2. 2.PRISM LaboratoryVersailles UniversityVersaillesFrance

Personalised recommendations