Tent–PSO-Based Unmanned Aerial Vehicle Path Planning for Cooperative Relay Networks in Dynamic User Environments

Shuyue Liu, Wanlei Zhou, Mingwei Qin, Xin PengSensors 2025 · DOI

TL;DR

This paper introduces Tent-PSO, a novel path planning algorithm for multiple Unmanned Aerial Vehicles (UAVs) acting as mobile communication relays. By integrating Tent chaotic mapping with Particle Swarm Optimization (PSO), Tent-PSO effectively addresses the challenges of dynamic user environments, leading to significantly improved coverage and communication throughput.

What Problem Does This Paper Address?

In modern communication systems, Unmanned Aerial Vehicles (UAVs) are increasingly being utilized as flexible, temporary mobile communication stations. They can provide crucial coverage in dynamic scenarios, such as disaster areas or large public gatherings, where traditional infrastructure might be insufficient or unavailable. However, effectively planning the paths for these UAVs is a complex challenge. The core problem lies in ensuring that UAVs can maintain optimal coverage for users who are constantly moving, while simultaneously ensuring high-quality communication links. Traditional path planning algorithms, like standard Particle Swarm Optimization (PSO), often struggle with uneven search coverage due to random initial particle placement and can prematurely converge to suboptimal solutions. This paper aims to overcome these limitations by developing a more robust and adaptive path planning strategy for multi-UAV relay networks in dynamic user environments.

Methods

The paper proposes a novel approach called Tent-PSO, which combines Tent chaotic mapping with Particle Swarm Optimization (PSO). Here's a breakdown of the key methods:

  • Tent Chaotic Mapping for Initialization: Instead of random initialization, Tent chaotic mapping is used to generate initial positions for the UAVs. This method ensures a more even distribution of particles (representing UAVs) across the search space, which is crucial for avoiding premature convergence and improving global search capabilities.
  • Adaptive Inertia Weight and Learning Factor Adjustment: The algorithm dynamically adjusts the inertia weight and learning factors of the PSO algorithm. This adaptive mechanism helps balance the exploration (searching new areas) and exploitation (refining existing solutions) phases of the optimization process. In the early stages, larger factors encourage broad exploration, while in later stages, they facilitate fine-tuning towards the optimal solution.
  • Joint Optimization Objective: The path planning problem is formulated as a multi-objective optimization task, aiming to simultaneously maximize user coverage and communication throughput. This is achieved by defining a comprehensive fitness function that incorporates coverage, throughput, and constraints related to UAV dynamics (flight distance, turning angle) and environmental threats (obstacles).
  • Catmull-Rom Spline for Path Smoothing: To address the issue of sharp turns in planned paths, which can lead to increased energy consumption and reduced flight efficiency, the Catmull-Rom spline is employed to smooth the generated UAV trajectories.

Datasets

The paper does not explicitly mention using pre-existing datasets for training or evaluation. Instead, it relies on a simulated environment to test the proposed algorithm. This simulated environment includes:

  • Dynamic User Mobility: Users' movements are simulated using the Gaussian-Markov mobility model, which allows for realistic and physically consistent user movement patterns.
  • Environmental Threats: Obstacles such as buildings (represented as rectangular prisms) and mountainous terrain (modeled using a 2D Gaussian peak function) are incorporated into the simulation to mimic real-world scenarios.

Key Insights and Ideas

  • Chaos for Better Initialization: The use of Tent chaotic mapping for initializing particle positions is a key innovation. It effectively addresses the "uneven search coverage" problem of traditional PSO by ensuring a more uniform distribution of potential solutions from the outset.
  • Dynamic Adaptation is Crucial: The adaptive adjustment of inertia weights and learning factors is vital for navigating complex, dynamic environments. This allows the algorithm to be more flexible and responsive to changing conditions, preventing it from getting stuck in local optima.
  • Holistic Optimization: Combining coverage and throughput into a single fitness function, along with incorporating dynamic constraints and environmental threats, leads to more practical and robust path planning solutions.
  • Smoothing for Efficiency: Path smoothing is not just about aesthetics; it directly translates to improved flight efficiency, safety, and extended operational duration for the UAVs.

Key Results

The simulation results demonstrate the effectiveness of the proposed Tent-PSO algorithm:

  • Improved Coverage: Tent-PSO achieved a coverage rate of 89.76% in dynamic user scenarios, significantly outperforming traditional PSO (58.23%) and PSO-GWO (66.63%).
  • Enhanced Throughput: The algorithm delivered the highest throughput, reaching 62.69 bps, which is approximately 41.92% higher than PSO-GWO and 19.4% higher than traditional PSO.
  • Better Global Optimization: Tent-PSO showed a fitness value of 31.79, substantially exceeding the fitness values of PSO-GWO (18.54) and traditional PSO (16.41), indicating its superior ability to find global optima.
  • Smoother Paths: The Catmull-Rom spline effectively smoothed the UAV paths, reducing sharp turns and improving flight stability and efficiency.

Limitations and Future Work

  • 3D Path Planning: While the paper discusses 3D environments, the path planning results presented are primarily in a 2D plane for clarity. The authors acknowledge that planning a 3D flight path that balances coverage area and communication quality is an important area for future research.
  • Computational Cost: Although not explicitly detailed as a limitation, the combination of multiple algorithms and adaptive parameters might lead to increased computational complexity.
  • Parameter Tuning: While Tent-PSO aims to reduce parameter sensitivity compared to some other methods, the optimal settings for chaotic coefficients and decay factors might still require careful tuning for specific applications.

The authors suggest that future work could focus on further exploring the deployment of UAVs in a 3D environment to optimize both coverage and communication quality.

Summary updated

Abstract

Unmanned aerial vehicles (UAVs) equipped with communication devices are easy to deploy and can serve as temporary mobile communication stations, covering dynamic ground users and establishing communication links. The proper planning of UAV paths can improve user coverage while maintaining communication quality. The traditional particle swarm optimization (PSO) algorithm exhibits strong global search capabilities; however, it suffers from challenges such as uneven search coverage owing to the random distribution of the initial particle positions. Additionally, improper parameter selection often leads to premature convergence to local optima. This study proposes a method for multi-UAV coverage of dynamic users by combining Tent chaotic mapping with PSO (Tent-PSO). By using Tent chaotic mapping to adjust a UAV's speed and position, the method ensures that particles are evenly distributed in the search space. Simulation results demonstrate that Tent-PSO improves the coverage of the global optimal solution by 10% and increases throughput by at least 37%, confirming its effectiveness in covering dynamic user scenarios.
BibTeX
@inproceedings{liu2025tentpso,
  author = {Shuyue Liu and Wanlei Zhou and Mingwei Qin and Xin Peng},
  title = {{Tent–PSO-Based Unmanned Aerial Vehicle Path Planning for Cooperative Relay Networks in Dynamic User Environments}},
  booktitle = {Sensors},
  year = {2025},
  doi = {10.3390/s25072005},
}
Figure