Dynamic route planning for emergency escape in coal mines using a Dijkstra-ACO hybrid algorithm
Emergency escape route planning in coal mines must adapt promptly to the changing underground environment. Traditional methods, relying on static networks with fixed weights, lack the flexibility needed for real-time adjustments in response to dynamic underground conditions. To address this limitati...
Saved in:
| Main Authors: | LU Guoju, SHI Wenfang |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Industry and Mine Automation
2024-10-01
|
| Series: | Gong-kuang zidonghua |
| Subjects: | |
| Online Access: | http://www.gkzdh.cn/article/doi/10.13272/j.issn.1671-251x.2024020050 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
The Concept of Determining a Ship’s Route Based on the Capability Plot and Dijkstra’s Algorithm—Finding the Ship’s Route Between Anchorages
by: Jakub Wnorowski, et al.
Published: (2024-12-01) -
Optimize 2-D Path Planning of Mobile Robot by using ACO with Guidance Factor
by: Li Wang
Published: (2020-06-01) -
Path planning of coal mine rescue robot based on blocked grid map
by: Xiaoqiang SHAO, et al.
Published: (2025-07-01) -
Potential of Using the Ant Colony Optimization Algorithm for Optimal Network Path Selection
by: Oleksandra Yaroshevska, et al.
Published: (2025-04-01) -
An intelligence technique for route distance minimization to store and marketize the crop using computational optimization algorithms
by: Saikat Banerjee, et al.
Published: (2025-08-01)