Minimal‐cost route planning via Fibonacci‐heap‐typed data structure
Abstract Efficient route planning in transportation networks, particularly under stochastic conditions like severe weather (i.e. snow or hail), poses a significant computational challenge. This article addresses this challenge by modeling the route planning problem as a Markov decision process (MDP)...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2024-11-01
|
| Series: | IET Control Theory & Applications |
| Subjects: | |
| Online Access: | https://doi.org/10.1049/cth2.12735 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!