Abstract
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.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
