Efficient Dynamic Traffic Navigation with Hierarchical Aggregation Tree
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.
KeywordsGlobal Position System Road Network Optimal Path Road Segment Reference Area
Unable to display preview. Download preview PDF.
- 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
- 6.Tayeb, J., Ulusoy, O., Wolfson, O.: A Quadtree-based Dynamic Attribute Indexing Method. The Computer Journal, 185–200 (1998)Google Scholar
- 8.Brinkhoff, T.: Network-based Generator of Moving Objects, http://www.fh-oow.de/institute/iapg/personen/brinkhoff/generastor