Multiple UAVs Cooperative Search Based on Potential Game Theory

Multiple Unmanned Aerial Vehicles (UAVs) cooperative search is a very important and difficult issue in the field of robotic search. In this study, the cooperative search problem is modeled as a potential game, and a modified binary log linear learning algorithm is proposed to solve the mission covering problem of multiple UAVs. In addition, to avoid the UAV wandering problem around the zero utility area, a communication framework is proposed to exchange the information with neighbors. Some experiments are conducted and the results show the proposed method is more efficient. This paper is organized as follow: the multiple UAVs coverage model is given in Section II, Section III contains the experimental design and results analysis. And in Section IV, the conclusion is drawn out.