Air-ground cooperative autonomous task allocation method for dynamic target search and strike

被引：0
|
作者：
Fei B. [1 ]
Bao W. [1 ]
Liu D. [1 ]
Zhu X. [1 ]
机构：
[1] College of Systems Engineering, National University of Defense Technology, Changsha
来源：
Xi Tong Gong Cheng Yu Dian Zi Ji Shu/Systems Engineering and Electronics | 2024年 / 46卷 / 07期
关键词：
air-ground cooperation; digital pheromone; path planning; target search; task allocation;
D O I：
10.12305/j.issn.1001-506X.2024.07.17
中图分类号：
TK [能源与动力工程];
学科分类号：
0807 ;
摘要：
For the task of moving target search and strike in a complicated urban environment, the single-domain unmanned platform is limited by its field of vision and movement capability, which is easy to cause problems of the target omission and the low task completion rate. To solve these problems, an air-ground cooperative autonomous task allocation method for dynamic target search and strike is proposed. It aims to improve the efficiency of task execution and regional coverage of air-ground unmanned systems by combining the characteristics of the wide field of vision of unmanned aerial vehicles and the strong mobility of unmanned ground vehicles. For unknown moving targets, a target search model based on digital pheromones is proposed, which takes platform cooperation income and regional coverage as optimization metrics to ensure that all targets in the region can be found in the shortest possible time period. In addition, for the dynamic arrival strike task, a task allocation model based on feasible path planning is proposed, which takes the platform energy consumption and task completion time as the objective function to ensure the task completion rate and improve the resource utilization of the air-ground cooperative system. Compared with the existing methods, the proposed method can find all targets in the shortest time. The regional coverage rate can reach more than 55%. And the resource utilization rate is 84. 4%. Experimental results show that the proposed method has excellent capabilities for target search and task execution. © 2024 Chinese Institute of Electronics. All rights reserved.
引用
收藏
页码：2346 / 2358
页数：12
相关论文
共 30 条
  • [1] SANTOSO F, GARRATT M, ANAVATTI S., State-of-the-art integrated guidance and control systems in unmanned vehicles: a review, IEEE Systems Journal, 15, 3, pp. 3312-3323, (2021)
  • [2] ZHANG T T, LAN Y S, SONG A G., An overview of autonomous collaboration technologies for unmanned swarm systems, Journal of Command and Control, 7, 2, pp. 127-136, (2021)
  • [3] LIU D Q, BAO W D, ZHU X M, Et al., Cooperative path optimization for multiple UAVs surveillance in uncertain environment, IEEE Internet of Things Journal, 9, 13, pp. 10676-10692, (2022)
  • [4] ZHU L H, WANG Y, WU Z Q., An adaptive priority allocation for formation UAVs in complex context, IEEE Trans. on Aerospace and Electronic Systems, 57, 2, pp. 1002-1015, (2021)
  • [5] YU J, YONG E M, CHEN H Y, Et al., Bi-level mission planning framework for multi-cooperative UAV air-to-ground attack, Systems Engineering and Electronics, 44, 9, pp. 2849-2857, (2022)
  • [6] YAO W R, QI N M, WAN N, Et al., An iterative strategy for task assignment and path planning of distributed multiple unmanned aerial vehicles, Aerospace Science and Technology, 86, pp. 455-464, (2019)
  • [7] YE F, CHEN J, TIAN Y, Et al., Cooperative multiple task assignment of heterogeneous UAVs using a modified genetic algorithm with multi-type-gene chromosome encoding strategy, Journal of Intelligent & Robotic Systems, 100, 2, pp. 615-627, (2020)
  • [8] CHEN X, LIU Y T, YIN L Y, Et al., Cooperative task assignment and track planning for multi-UAV attack mobile targets, Journal of Intelligent & Robotic Systems, 100, 3, pp. 1383-1400, (2020)
  • [9] WEI C Y, JI Z, CAI B L., Particle swarm optimization for cooperative multi-robot task allocation: a multi-objective approach, IEEE Robotics and Automation Letters, 5, 2, pp. 2530-2537, (2020)
  • [10] CHEN C, BAO W D, MEN T, Et al., NECTAR-an agent-based dynamic task allocation algorithm in the UAV swarm, Complexity, (2020)
123