Implementation and visualization of weighted A-Star algorithm and bidirectional weighted A-Star algorithm under large-scale road network
A* search algorithm
Suurballe's algorithm
Star (game theory)
Algorithm design
Floyd–Warshall algorithm
DOI:
10.1117/12.2674530
Publication Date:
2023-05-23T18:18:40Z
AUTHORS (6)
ABSTRACT
In the real world, traffic scenes are complex and contain intricate road networks, which makes shortest path computation on large-scale networks a challenging task. Existing research has concentrated small-scale urban or grid maps. practical scenarios, however, we often faced with seeking paths networks. For this reason, it is imperative to develop efficient searching algorithms, as offers significant savings in time resources. To tackle issue, paper proposes two improved A* namely Weighted algorithm Bidirectional algorithm. verify effectiveness of our proposed validated performance algorithms against conventional Dijkstra different sizes. Our results significantly demonstrate solution, both outperform Dijkstra's little loss accuracy.
SUPPLEMENTAL MATERIAL
Coming soon ....
REFERENCES (0)
CITATIONS (0)
EXTERNAL LINKS
PlumX Metrics
RECOMMENDATIONS
FAIR ASSESSMENT
Coming soon ....
JUPYTER LAB
Coming soon ....