On determining the weight of edges in map-representing graphs-applications of heuristic methods in planning escape routes
In the paper we discuss and compare two commonly used methods of finding the shortest paths in networks, namely Dijkstra's and A∗ algorithms. We compare their effectiveness in terms of traversing road network in circumstances that require swift decision making in the event of dynamically changi...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
KeAi Communications Co., Ltd.
2022-12-01
|
| Series: | Journal of Traffic and Transportation Engineering (English ed. Online) |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2095756422001039 |