A UAV Path-Planning Approach for Urban Environmental Event Monitoring

Efficient flight path design for unmanned aerial vehicles (UAVs) in urban environmental event monitoring remains a critical challenge, particularly in prioritizing high-risk zones within complex urban landscapes. Current UAV path planning methodologies often inadequately account for environmental risk factors and exhibit limitations in balancing global and local optimization efficiency. To address these gaps, this study proposes a hybrid path planning framework integrating an improved Ant Colony Optimization (ACO) algorithm with an Orthogonal Jump Point Search (OJPS) algorithm. Firstly, a two-dimensional grid model is constructed to simulate urban environments, with key monitoring nodes selected based on grid-specific environmental risk values. Subsequently, the improved ACO algorithm is used for global path planning, and the OJPS algorithm is integrated to optimize the local path. The improved ACO algorithm introduces the risk value of environmental events, which is used to direct the UAV to the area with higher risk. In the OJPS algorithm, the path search direction is restricted to the orthogonal direction, which improves the computational efficiency of local path optimization. In order to evaluate the performance of the model, this paper utilizes the metrics of the average risk value of the path, the flight time, and the number of turns. The experimental results demonstrate that the proposed improved ACO algorithm performs well in the average risk value of the paths traveled within the first 5 min, within the first 8 min, and within the first 10 min, with improvements of 48.33%, 26.10%, and 6.746%, respectively, over the Particle Swarm Optimization (PSO) algorithm and 70.33%, 19.08%, and 10.246%, respectively, over the Artificial Rabbits Optimization (ARO) algorithm. The OJPS algorithm demonstrates superior performance in terms of flight time and number of turns, exhibiting a reduction of 40%, 40% and 57.1% in flight time compared to the other three algorithms, and a reduction of 11.1%, 11.1% and 33.8% in the number of turns compared to the other three algorithms. These results highlight the effectiveness of the proposed method in improving the UAV’s ability to respond efficiently to urban environmental events, offering significant implications for the future of UAV path planning in complex urban settings.

Authors

Publication Details

Journal
Computers, materials & continua/Computers, materials & continua (Print)
Published
2025-01-01
DOI
https://doi.org/10.32604/cmc.2025.061954
Citations
2
Primary Topic
Robotics and Sensor-Based Localization
Type
article
Field-Weighted Citation Impact
9.99
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A UAV Path-Planning Approach for Urban Environmental Event Monitoring

Shaoxin Li, Xiaomin Li, Huiru Cao, Yongxin Liu
2 citations
Computers, materials & continua/Computers, materials & continua (Print)
Robotics and Sensor-Based Localization
9.99
article

A UAV Path-Planning Approach for Urban Environmental Event Monitoring

Shaoxin Li, Xiaomin Li, Huiru Cao, Yongxin Liu
article en
2 citations

Abstract

Efficient flight path design for unmanned aerial vehicles (UAVs) in urban environmental event monitoring remains a critical challenge, particularly in prioritizing high-risk zones within complex urban landscapes. Current UAV path planning methodologies often inadequately account for environmental risk factors and exhibit limitations in balancing global and local optimization efficiency. To address these gaps, this study proposes a hybrid path planning framework integrating an improved Ant Colony Optimization (ACO) algorithm with an Orthogonal Jump Point Search (OJPS) algorithm. Firstly, a two-dimensional grid model is constructed to simulate urban environments, with key monitoring nodes selected based on grid-specific environmental risk values. Subsequently, the improved ACO algorithm is used for global path planning, and the OJPS algorithm is integrated to optimize the local path. The improved ACO algorithm introduces the risk value of environmental events, which is used to direct the UAV to the area with higher risk. In the OJPS algorithm, the path search direction is restricted to the orthogonal direction, which improves the computational efficiency of local path optimization. In order to evaluate the performance of the model, this paper utilizes the metrics of the average risk value of the path, the flight time, and the number of turns. The experimental results demonstrate that the proposed improved ACO algorithm performs well in the average risk value of the paths traveled within the first 5 min, within the first 8 min, and within the first 10 min, with improvements of 48.33%, 26.10%, and 6.746%, respectively, over the Particle Swarm Optimization (PSO) algorithm and 70.33%, 19.08%, and 10.246%, respectively, over the Artificial Rabbits Optimization (ARO) algorithm. The OJPS algorithm demonstrates superior performance in terms of flight time and number of turns, exhibiting a reduction of 40%, 40% and 57.1% in flight time compared to the other three algorithms, and a reduction of 11.1%, 11.1% and 33.8% in the number of turns compared to the other three algorithms. These results highlight the effectiveness of the proposed method in improving the UAV’s ability to respond efficiently to urban environmental events, offering significant implications for the future of UAV path planning in complex urban settings.

Computers, materials & continua/Computers, materials & continua (Print)Vol. 83(3)
Sustainable cities and communities, Climate action
Openalex Percentile: Top 3%
Robotics and Sensor-Based Localization
9.99
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.