计算机科学
初始化
运动规划
路径(计算)
趋同(经济学)
钥匙(锁)
数学优化
约束(计算机辅助设计)
人口
实时计算
分布式计算
运筹学
人工智能
机器人
计算机安全
机械工程
工程类
社会学
人口学
经济
程序设计语言
经济增长
数学
作者
Cheng Xu,Ming Xu,Chanjuan Yin
标识
DOI:10.1016/j.comcom.2020.04.050
摘要
As an emerging technology, multi-UAV collaboration is widely used in military and civil applications, including regional surveillance, remote sensing, target strike, etc. As a key step in the implementation of multi-UAV cooperative missions, path planning aims to generate near-optimal paths that satisfy certain constraints, ensure that each UAV can reach the mission area quickly and reduce the probability of being captured and destroyed by the antagonism side. In this paper, we design an optimized multi-UAV cooperative path planning method under the complex confrontation environment. Firstly, the threat model is designed based on the actual situation. Combining the threat and fuel consumption criteria, under the constraints of time and space, a multi-constraint objective optimization model is established. Following this, an improved grey wolf optimizer algorithm is used to solve the optimization model. Based on the characteristics of the multi-UAV cooperative path planning, the algorithm is improved in three aspects: population initialization, decay factor updating, and individual position updating. The simulation results demonstrate that the proposed algorithm is effective in generating paths for multi-UAV cooperative path planning and has the advantages of a lower path cost and faster convergence speed as compared to the other algorithms tested in this work.
科研通智能强力驱动
Strongly Powered by AbleSci AI