Abstract

This paper studies the problem of generating cooperative feasible paths for formation rendezvous of unmanned aerial vehicles (UAVs). Cooperative path-planning for multi-UAV formation rendezvous is mostly a complicated multi-objective optimization problem with many coupled constraints. In order to satisfy the kinematic constraints, i.e., the maximum curvature constraint and the requirement of continuous curvature of the UAV path, the Pythagorean hodograph (PH) curve is adopted as the parameterized path because of its curvature continuity and rational intrinsic properties. Inspired by the co-evolutionary theory, a distributed cooperative particle swarm optimization (DCPSO) algorithm with an elite keeping strategy is proposed to generate a flyable and safe path for each UAV. This proposed algorithm can meet the kinematic constraints of UAVs and the cooperation requirements among UAVs. Meanwhile, the optimal or sub-optimal paths can be obtained. Finally, numerical simulations in 2-D and 3-D environments are conducted to demonstrate the feasibility and stability of the proposed algorithm. Simulation results show that the paths generated by the proposed DCPSO can not only meet the kinematic constraints of UAVs and safety requirements, but also achieve the simultaneous arrival and collision avoidance between UAVs for formation rendezvous. Compared with the cooperative co-evolutionary genetic algorithm (CCGA), the proposed DCPSO has better stability and a higher searching success rate.

Highlights

  • Unmanned aerial vehicles (UAVs) are widely used in both civilian and military fields, including search and rescue [1], environmental monitoring [2], surveillance and attacks [3], and so on

  • A distributed cooperative particle swarm optimization (DCPSO) algorithm was proposed to generate a set of spatial paths for multi-UAVs that execute formation rendezvous missions

  • The quantic Pythagorean hodograph (PH) curve was used as the path because of its curvature continuity

Read more

Summary

Introduction

Unmanned aerial vehicles (UAVs) are widely used in both civilian and military fields, including search and rescue [1], environmental monitoring [2], surveillance and attacks [3], and so on. The method consists of (i) generating flyable paths using Dubins path with clothoid arcs, (ii) satisfying the collision avoidance constraint, and (iii) generating paths of equal length. This method requires a large amount of computation because of the iteration strategy. The focus is on generating a group of cooperative paths for UAVs arriving at the rendezvous point simultaneously and forming a desired formation configuration. Using a distributed cooperation mechanism, the particles in each sub-swarm are modified so that the kinematic constraints of UAVs, the collision avoidance, and the simultaneous arrival of the UAV formation are achieved.

Formation Rendezvous of Multi-UAVs
Pythagorean Hodograph Path
DCPSO with Cooperation
Distributed Cooperative Particle Swarm Optimization with Cooperation
Algorithm Initialization
Update of Velocities and Positions
Fitness Function
Cooperative Fitness Modification
Cooperative path-planning with DCPSO
The particles’
For each sub-swarm
Time Complexity Analysis and Remarks
Path Planning for 2-D Formation Rendezvous
Curvature
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call