Research on Improved Ant Colony Algorithm for Mountain Hiking Emergency Rescue Path Planning

被引:0
|
作者
Wu Y. [1 ,2 ]
Li J. [1 ,2 ]
Bi S. [1 ,2 ]
Zhu X. [1 ,2 ]
Wang Q. [3 ]
机构
[1] College of Physics and Information Engineering, Fuzhou University, Fuzhou
[2] The Academy of Digital China (Fujian), Fuzhou University, Fuzhou
[3] College of Environment and Safety Engineering, Fuzhou University, Fuzhou
基金
中国国家自然科学基金;
关键词
3D mountain environment; Ant Colony Optimization(ACO); DEM; field emergency rescue; Genetic Algorithm(GA); grid method; hiking path planning; mountain hiking accessibility;
D O I
10.12082/dqxxkx.2023.220535
中图分类号
学科分类号
摘要
When a firefighting incident occurs in a wild complex mountain with no obvious roads or sparse roads, it is crucial to plan a safe and fast route through the complex mountain environment. Aiming at the problem that Ant Colony Optimization (ACO) is easy to fall into local optimum and the search time is long for complex mountain path planning, our study proposes an ACO algorithm for hiking emergency rescue path planning, which is suitable for fine-grained wild mountain environments. Firstly, our study analyzed the relationship between surface information and human movement speed based on existing literature and designed the objective function and heuristic function of the optimization algorithm considering two factors: surface shrub cover and terrain slope. Then, we used a combination of plane and field of view ant search combined with heuristic function and pheromone concentration to determine the next grid to be selected in the optimization process of the improved algorithm. Finally, the improved algorithm used a Laplace distribution to adjust the initial pheromone to improve the quality of the algorithm's initial solution. For the deadlock problem, the improved algorithm added isolated pheromones to prevent the next ant from falling into a deadlock dilemma. The improved algorithm used a genetic operator with grouping to update the global regular pheromone to avoid the ant colony from falling into a local optimum dilemma. In our study, we applied four ACO to the wild mountain environment of 400×400 grids, 1000 grids×1000 grids, 5000 grids×5000 grids, and 10 000 grids×10 000 grids for comparison, and set different starting and ending points for each environment. The experimental results show that each ACO using a combined planar and visual field search approach can obtain feasible paths in all four experiments, which verified the feasibility of the method. The quality of the paths using the improved algorithms was better than the other three algorithms, with improvements of 0.52%~4.95%, 4.71%~5.39%, 2.26%~13.11%, and 3.84%~9.16% in the four experiments, respectively, and the improved algorithm had shorter search time and convergence time. In addition, the combined planar and visual field search approach reduced the search space and improved the computational efficiency of the algorithm in the field 3D mountain environment. This search method was faster than the 8-connected method and reduced the average time consumption by more than 90%. Our algorithm is suitable for hiking path planning research in large 3D mountain scenes, with reduced planning time and improved path quality, providing technical support for the work of finding the best 3D mountain hiking paths without road networks. © 2023 Journal of Geo-Information Science. All rights reserved.
引用
收藏
页码:90 / 101
页数:11
相关论文
共 24 条
  • [1] Wang S H, Geng S T., Marketing strategy and brand strategy planning of region-based tourism, Prices Monthly, 3, pp. 57-60, (2018)
  • [2] Qin X L, Li X T, Liu S C, Et al., Forest fire early warning and monitoring techniques using satellite remote sensing in China[J], Journal of Remote Sensing, 24, 5, pp. 511-520, (2020)
  • [3] Li J W, Li X W, Chen C C, Et al., Three-dimensional dynamic simulation system for forest surface fire spreading prediction[J], International Journal of Pattern Recognition and Artificial Intelligence, 32, 8, (2018)
  • [4] Guo C, Li D M, Zhang G L, Et al., Real-time path planning in urban area via VANET-assisted traffic information sharing[J], IEEE Transactions on Vehicular Technology, 67, 7, pp. 5635-5649, (2018)
  • [5] Jeong D, Kim M, Song K, Et al., Planning a green infrastructure network to integrate potential evacuation routes and the urban green space in a coastal city: The case study of haeundae district, Busan, south Korea[J], The Science of the Total Environment, 761, (2021)
  • [6] Yang B W, Ding Z M, Yuan L, Et al., A novel urban emergency path planning method based on vector grid map[J], IEEE Access, 8, pp. 154338-154353
  • [7] Cai Z, Cui X R, Su X, Et al., A novel vector-based dynamic path planning method in urban road network[J], IEEE Access, 8, pp. 9046-9060
  • [8] Elhoseny M, Tharwat A, Hassanien A E., Bezier curve based path planning in a dynamic field using modified genetic algorithm[J], Journal of Computational Science, 25, pp. 339-350, (2018)
  • [9] Luo Q, Wang H B, Zheng Y, Et al., Research on path planning of mobile robot based on improved ant colony algorithm, Neural Computing and Applications, 32, 6, pp. 1555-1566, (2020)
  • [10] Zhang Z, He R, Yang K., A bioinspired path planning approach for mobile robots based on improved sparrow search algorithm[J], Advances in Manufacturing, 10, 1, pp. 114-130, (2022)