A Topical Review of Quantum and Classical Machine Learning Approaches to Disaster Escape Routing Problems
The pathfinding problem in a graph has been solved using several classical algorithms, notably Dijkstra’s and A* algorithms. However, most classical algorithms are most effective on static graphs. They either cannot be adapted to dynamic graphs or become computationally expensive. The cha...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2025-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/10990174/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|