Traffic-Aware Navigation in Road Networks
Sarah Nassar

TL;DR
This paper evaluates three graph search algorithms for traffic-aware navigation in Kingston, comparing their speed, optimality, and traffic-awareness to guide deployment choices.
Contribution
It provides a comparative analysis of Floyd-Warshall-Ingerman, Dijkstra's, A*, and Yen's algorithms for traffic-aware routing, highlighting their trade-offs.
Findings
Dijkstra's and A* offer traffic-aware optimal solutions with minimal preprocessing.
Floyd-Warshall-Ingerman is fastest in real-time but less traffic-aware.
Yen's algorithm balances preprocessing time and solution quality.
Abstract
This project compares three graph search approaches for the task of traffic-aware navigation in Kingston's road network. These approaches include a single-run multi-query preprocessing algorithm (Floyd-Warshall-Ingerman), continuous single-query real-time search (Dijkstra's and A*), and an algorithm combining both approaches to balance between their trade-offs by first finding the top K shortest paths then iterating over them in real time (Yen's). Dijkstra's and A* resulted in the most traffic-aware optimal solutions with minimal preprocessing required. Floyd-Warshall-Ingerman was the fastest in real time but provided distance based paths with no traffic awareness. Yen's algorithm required significant preprocessing but balanced between the other two approaches in terms of runtime speed and optimality. Each approach presents advantages and disadvantages that need to be weighed depending…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsData Management and Algorithms · Autonomous Vehicle Technology and Safety · Computational Geometry and Mesh Generation
