Improved Hybridization of Harris Hawks with Pigeon-Inspired Optimization Algorithm for Multi-Rotor Agent Trajectory Planning

Read full text
Authors: Junkai Yin, Zhangsong Shi, Huihui Xu, Fan Gui, Hao Ran Wu
Cited by: 0
References: 9

Abstract

Addressing the multi-constraint, nonlinear optimization challenge of trajectory planning for multi-rotor agents in urban high-rise environments, this paper proposes an improved hybridization of Harris hawks optimization (HHO) with a pigeon-inspired optimization (PIO) algorithm, termed improved hybridization of Harris hawks with pigeon-inspired optimization (IHHHPIO). Conventional intelligent optimization algorithms often suffer from slow convergence rates or susceptibility to local optima in such complex scenarios. This research establishes a hierarchical collaborative search framework, where the HHO algorithm acts as a top-level coordinator for global exploration and region allocation, while the PIO algorithm functions as a bottom-level searcher for fine-grained optimization within designated areas. The two algorithms collaborate through a bidirectional information exchange mechanism: HHO guides the local search direction of each PIO group with global best-position information, and each PIO group feeds back its locally optimal solutions to HHO for updating the global optimum. Simulation results demonstrate that the proposed IHHHPIO algorithm significantly outperforms both standard PIO and HHO algorithms in terms of convergence speed, solution accuracy, and stability, effectively planning safe, efficient, and collision-free flight trajectories. This work provides a reliable solution for agent logistics applications in complex urban environments. A certain limitation of this work lies in its validation solely through simulation, without physical experimental verification.

Fields of Study & Subjects

Metaheuristic Optimization Algorithms Research Robotic Path Planning Algorithms Distributed Control Multi-Agent Systems

Publication details

Journal / source
Applied Sciences
Volume
16
Issue
5
Pages
2256–2256
Publication date
26 February 2026
Language
EN