Artificial Intelligence
Constrained shortest path computation
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Clustering user trajectories to find patterns for social interaction applications
W2GIS'12 Proceedings of the 11th international conference on Web and Wireless Geographical Information Systems
| Hi-index | 0.00 |
Finding the fastest route in dynamic transportation networks aids navigation service considerably. Existing approaches are either too complex or incapable of handling complex circumstances wherein both the location of a mobile user and the traffic conditions change incessantly over time. In this paper, we propose an incremental search approach based on a variation of A*- Lifelong Planning A* (LPA*) to derive a dynamic fastest path, which continually adapts to the real-time traffic condition while making use of the previous search result. Our experimental results reveal that the proposed approach is a significant improvement over a conventional approach also using the A* algorithm.