ICUAS'23 Paper Abstract

Close

Paper ThA4.1

Liu, Xinghan (Beihang University), Zhang, Yan (Beihang University), Duan, Haibin (Beihang University)

Unmanned Aerial Vehicle Cargo Delivery Assignment Via Time-Varying Constriction Pigeon-Inspired Optimization with Memory Retrospection

Scheduled for presentation during the Regular Session "Swarms" (ThA4), Thursday, June 8, 2023, 09:00−09:20, Room 465

2023 International Conference on Unmanned Aircraft Systems (ICUAS), June 6-9, 2023, Lazarski University, Warsaw, Poland

This information is tentative and subject to change. Compiled on April 18, 2024

Keywords Biologically Inspired UAS, Swarms, UAS Applications

Abstract

Unmanned aerial vehicles (UAVs) collaboration is a key technology to UAV cargo delivery in the near future. In this paper, distribution requirement parameters are identified to establish a multi-objective cargo delivery assignment model where a large number of tasks are allocated. To optimize high-dimensional multi-UAV task assignment problem, a time-varying constriction pigeon-inspired optimization with memory retrospection (TCMR-PIO) is proposed. A memory retrospection mechanism is developed to increase the multiplicity of pigeon flock and avoid premature convergence. Meanwhile, a time-varying constraint factor is utilized to provide the improved algorithm with higher accuracy and stability. While maintaining the advantage of high convergence speed, an optimized task assignment scheme can be obtained. Comparative simulation experiments with particle swarm optimization (PSO), pigeon-inspired optimization (PIO), quantum pigeon-inspired optimization (QPIO), adaptive weighted pigeon-inspired optimization (AWPIO) and nonlinear dynamic adaptive inertial weight particle swarm optimization (PSO-DAIW) are carried out, and the performance of the TCMR-PIO algorithm validates its effectiveness and superiority on cargo delivery assignment.

 

 

All Content © PaperCept, Inc.

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2024 PaperCept, Inc.
Page generated 2024-04-18  15:15:21 PST  Terms of use