Abstract

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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.