cooperative search, UAV, unmanned aircraft
This paper focuses on the problem of cooperatively searching, using a team of unmanned air vehicles (UAVs), an area of interest that contains regions of opportunity and regions of potential hazard. The objective of the UAV team is to visit as many opportunities as possible, while avoiding as many hazards as possible. To enable cooperation, the UAVs are constrained to stay within communication range of one another. Collision avoidance is also required. Algorithms for team-optimal and individually-optimal/team-suboptimal solutions are developed and their computational complexity compared. Simulation results demonstrating the feasibility of the cooperative search algorithms are presented.
Original Publication Citation
Beard, R. and McLain, T. Multiple UAV Cooperative Search under Collision Avoidance and Limited Range Communication Constraints, Proceedings of the IEEE Conference on Decision and Control, pp. 25-30, December 2003, Maui, Hawaii
BYU ScholarsArchive Citation
Beard, Randal W. and McLain, Timothy W., "Multiple UAV Cooperative Search under Collision Avoidance and Limited Range Communication Constraints" (2003). All Faculty Publications. 1529.
Ira A. Fulton College of Engineering and Technology
Electrical and Computer Engineering
(c) 2003 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. The Published version of this article can be found at: http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1272530
Copyright Use Information