Cooperative solution of multi-UAV rendezvous problem with network restrictions

10Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

By considering the complex networks, the cooperative game based optimal consensus (CGOC) algorithm is proposed to solve the multi-UAV rendezvous problem in the mission area. Firstly, the mathematical description of the rendezvous problem is established, and the solving framework is provided based on the coordination variables and coordination function. It can decrease the transmission of the redundant information and reduce the influence of the limited network on the task. Secondly, the CGOC algorithm is presented for the UAVs in distributed cooperative manner, which can minimize the overall cost of the multi-UAV system. The CGOC control problem and the corresponding solving protocol are given by using the cooperative game theory and sensitivity parameter method. Then, the CGOC method of multi-UAV rendezvous problem is proposed, which focuses on the trajectory control of the platform rather than the path planning. Simulation results are given to demonstrate the effectiveness of the proposed CGOC method under complex network conditions and the benefit on the overall optimality and dynamic response.

Cite

CITATION STYLE

APA

Zhang, Q., Tao, J., Yu, F., Li, Y., Sun, H., & Xu, W. (2015). Cooperative solution of multi-UAV rendezvous problem with network restrictions. Mathematical Problems in Engineering, 2015. https://doi.org/10.1155/2015/878536

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free