Multi-AAVs Flocking for Navigation and Obstacle Avoidance in Network-Constrained Environments

The flocking movement is a fundamental and crucial operation in multi-AAVs systems, encompassing navigation and obstacle avoidance. However, traditional flocking algorithms typically rely on rigid rules and exhibit limited adaptability to diverse environments. Reinforcement learning (RL) effectively addresses this issue as a flexible and model-free framework. In this article, RL techniques are utilized to achieve navigation and obstacle avoidance for a swarm of AAVs. To enhance training efficiency, we propose an improved algorithm called heuristic guides TD3 (HGTD3) by integrating heuristic guides with the twin delayed deep deterministic policy gradient (TD3), aiming to address the protracted learning periods commonly observed in traditional RL methods. Considering the network-constrained environment, we propose the negative interference flocking algorithm (NIFA): the network interference flocking algorithm and an AAV flocking algorithm designed based on the sparrow search algorithm. NIFA can guide the losing AAV to follow the swarm and at the same time maintain the overall navigation and avoidance efficiency. Finally, we demonstrate the scalability and adaptability of HGTD3-NIFA in a simulation experiment in terms of multi-AAVs flocking and navigation.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2024-11-29
DOI
https://doi.org/10.1109/jiot.2024.3507782
Citations
1
Primary Topic
Robotic Path Planning Algorithms
Type
article
Field-Weighted Citation Impact
0.25

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Multi-AAVs Flocking for Navigation and Obstacle Avoidance in Network-Constrained Environments

Na Lin, Jiehong Wu, Junling Shi, Guchuan Zhu et al.
1 citations
IEEE Internet of Things Journal
Robotic Path Planning Algorithms
0.25
article

Multi-AAVs Flocking for Navigation and Obstacle Avoidance in Network-Constrained Environments

Na Lin, Jiehong Wu, Junling Shi, Guchuan Zhu, Liang Zhao, Ammar Hawbani, Hanyu Li
article en
1 citations

Abstract

The flocking movement is a fundamental and crucial operation in multi-AAVs systems, encompassing navigation and obstacle avoidance. However, traditional flocking algorithms typically rely on rigid rules and exhibit limited adaptability to diverse environments. Reinforcement learning (RL) effectively addresses this issue as a flexible and model-free framework. In this article, RL techniques are utilized to achieve navigation and obstacle avoidance for a swarm of AAVs. To enhance training efficiency, we propose an improved algorithm called heuristic guides TD3 (HGTD3) by integrating heuristic guides with the twin delayed deep deterministic policy gradient (TD3), aiming to address the protracted learning periods commonly observed in traditional RL methods. Considering the network-constrained environment, we propose the negative interference flocking algorithm (NIFA): the network interference flocking algorithm and an AAV flocking algorithm designed based on the sparrow search algorithm. NIFA can guide the losing AAV to follow the swarm and at the same time maintain the overall navigation and avoidance efficiency. Finally, we demonstrate the scalability and adaptability of HGTD3-NIFA in a simulation experiment in terms of multi-AAVs flocking and navigation.

IEEE Internet of Things JournalVol. 12(7)
Shenyang Aerospace University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 44%
Robotic Path Planning Algorithms
0.25
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.