Improved Particle Swarm Path Planning Algorithm with Multi-Factor Coupling in Forest Fire Spread Scenarios

9Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

Abstract

In this paper, a solution based on an improved particle swarm algorithm is proposed for the path planning problem without a road network in forest fire rescue scenarios. The algorithm adopts an adaptive inertia weight and a dynamically updated learning factor strategy to enhance the global and local search capabilities of the algorithm. In terms of cost function design, the article considers three factors: path length, terrain slope, and obstacle avoidance ability to ensure the safety and effectiveness of the path. The experimental results show that: (1) the path planning algorithm based on improved particle swarm optimization can effectively avoid spreading wildfire and reach the designated target point with a good “detour” effect; (2) the path planned by the improved PSO algorithm performs better than the original PSO algorithm in terms of fitness evaluation and average slope; and (3) changes in the particle population, dimensions, and learning factors in the particle swarm optimization algorithm can affect the convergence of the final path. Increasing the particle dimensions can bring more reasonable and specific paths; decreasing the learning factor increases the convergence iterations, but also obtains a better path planning solution and higher fitness.

Cite

CITATION STYLE

APA

Lin, K., Zhang, L., Huang, L., Feng, Z., & Chen, T. (2023). Improved Particle Swarm Path Planning Algorithm with Multi-Factor Coupling in Forest Fire Spread Scenarios. Fire, 6(5). https://doi.org/10.3390/fire6050202

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free