Multi-UAV Path Planning in Dynamic Environments using a Hybrid PSO-Whale Optimization Approach

Path planning for multiple unmanned aerial vehicles (UAVs) in dynamic environments remains challenging due to the simultaneous satisfaction of multiple critical constraints. Each UAV must keep at least 5 m of space between it and other UAVs while avoiding both static and moving obstacles. Also, the resulting paths should be short, smooth, and easy to calculate so that ground stations or high-performance onboard systems can frequently replan in near-real-time. In such scenarios, traditional metaheuristic algorithms frequently underperform. The problem’s high dimensionality, non-convexity, and time-varying nature often cause it to converge too soon to suboptimal solutions or require too much computing power, making it hard to use in practice. This study proposes a sequential hybrid optimisation framework to tackle these issues. The process starts with an Improved Particle Swarm Optimisation (IPSO) that uses adaptive inertia weight and linearly changing acceleration coefficients. This strikes a good balance between exploration and exploitation, quickly generating high-quality initial path candidates. Then comes the Whale Optimisation Algorithm (WOA) refinement stage, which uses its encircling, spiral bubble-net feeding, and random search operators to make the population more diverse and avoid getting stuck in local optima. A centralised fitness function reduces the total length of the path while adding penalties for things such as excessive curvature, proximity to obstacles, or high energy consumption. In 100 × 100 × 50 m³ environments involving 4–8 UAVs and 6–12 dynamic obstacles, Monte Carlo simulations (50 runs per scenario) demonstrate that the IPSO–WOA hybrid yields path lengths 42–52% shorter than those produced by Genetic Algorithm (GA), reduces average computation time by 14–18% (from 8.55 s to 7.12 s), achieves success rates up to 88%, and improves minimum inter-vehicle clearance (6.1 ± 0.7 m vs. 4.2 ± 1.1 m for GA). Wilcoxon signed-rank tests (p < 0.01) confirm statistical significance. These results highlight the effectiveness of complementary metaheuristic hybridisation for real-time multi-UAV coordination in applications such as search-and-rescue, precision agriculture, surveillance, and infrastructure inspection.

Authors

Institutions

Publication Details

Journal
International Journal of Computational Intelligence Systems
Published
2026-04-28
DOI
https://doi.org/10.1007/s44196-026-01329-5
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-UAV Path Planning in Dynamic Environments using a Hybrid PSO-Whale Optimization Approach

Ravi Sankar Puppala, Thulasi Bikku, Pamarthi Venkatasivarambabu, Arepalli Tirumala
International Journal of Computational Intelligence Systems
Robotic Path Planning Algorithms
article

Multi-UAV Path Planning in Dynamic Environments using a Hybrid PSO-Whale Optimization Approach

Ravi Sankar Puppala, Thulasi Bikku, Pamarthi Venkatasivarambabu, Arepalli Tirumala
article en

Abstract

Path planning for multiple unmanned aerial vehicles (UAVs) in dynamic environments remains challenging due to the simultaneous satisfaction of multiple critical constraints. Each UAV must keep at least 5 m of space between it and other UAVs while avoiding both static and moving obstacles. Also, the resulting paths should be short, smooth, and easy to calculate so that ground stations or high-performance onboard systems can frequently replan in near-real-time. In such scenarios, traditional metaheuristic algorithms frequently underperform. The problem’s high dimensionality, non-convexity, and time-varying nature often cause it to converge too soon to suboptimal solutions or require too much computing power, making it hard to use in practice. This study proposes a sequential hybrid optimisation framework to tackle these issues. The process starts with an Improved Particle Swarm Optimisation (IPSO) that uses adaptive inertia weight and linearly changing acceleration coefficients. This strikes a good balance between exploration and exploitation, quickly generating high-quality initial path candidates. Then comes the Whale Optimisation Algorithm (WOA) refinement stage, which uses its encircling, spiral bubble-net feeding, and random search operators to make the population more diverse and avoid getting stuck in local optima. A centralised fitness function reduces the total length of the path while adding penalties for things such as excessive curvature, proximity to obstacles, or high energy consumption. In 100 × 100 × 50 m³ environments involving 4–8 UAVs and 6–12 dynamic obstacles, Monte Carlo simulations (50 runs per scenario) demonstrate that the IPSO–WOA hybrid yields path lengths 42–52% shorter than those produced by Genetic Algorithm (GA), reduces average computation time by 14–18% (from 8.55 s to 7.12 s), achieves success rates up to 88%, and improves minimum inter-vehicle clearance (6.1 ± 0.7 m vs. 4.2 ± 1.1 m for GA). Wilcoxon signed-rank tests (p < 0.01) confirm statistical significance. These results highlight the effectiveness of complementary metaheuristic hybridisation for real-time multi-UAV coordination in applications such as search-and-rescue, precision agriculture, surveillance, and infrastructure inspection.

International Journal of Computational Intelligence Systems
SRM University, Andhra Pradesh (IN), Amrita Vishwa Vidyapeetham (IN), Koneru Lakshmaiah Education Foundation (IN)
Affordable and clean energy
Openalex Percentile: Top 4%
Robotic Path Planning Algorithms
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.