期刊
PHYSICAL COMMUNICATION
卷 35, 期 -, 页码 -出版社
ELSEVIER
DOI: 10.1016/j.phycom.2019.100717
关键词
Collaborative mission planning; Trajectory planning; Survival state; Markov model; Meta-heuristic search algorithms
资金
- National Natural Science Foundation of China [61771089]
- Open Research Fund of Key Laboratory of Wireless Power Transfer, Ministry of Education
- Open Research Fund of Key Laboratory of Data Security, Xinjiang Normal University [XJNUSYS102018B01]
As the environment of the battlefield is increasingly complex, single UAV (Unmanned Aerial Vehicle) has trouble in carrying out missions, which requires the cooperation of multiple UAVs. However, search space is very large and search targets are distributed sparsely, and making mission planning and route planning simultaneously is also an NP (Non-Deterministic Polynomial Problems) problem, which makes it extremely difficult in mission planning. Recently, meta-heuristic search algorithms widely used in multi-UAVs collaborative mission planning are difficult to find reliable initial solutions and limit the convergence speed. Aiming at this problem, to take plenty of constraints and performance planning targets in multi-UAV cooperative mission planning problems into full consideration. This paper proposes a two-layer mission planning model based on the simulated annealing algorithm and tabu search algorithm, which solves multi-objectives, Multi-aircraft mission planning problems. This paper combined the five-state Markov chain model with the mission planning model to determine the optimal mission planning scheme by judging the survival state probability of the flight platform. Finally, the simulation results show that this method can greatly improve the survivability of the drone while ensuring optimal mission planning. (C) 2019 Elsevier B.V. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据