Keywords

cooperative search, UAV, unmanned aircraft

Abstract

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

Document Type

Peer-Reviewed Article

Publication Date

2003-12

Permanent URL

http://hdl.lib.byu.edu/1877/3408

Publisher

IEEE

Language

English

College

Ira A. Fulton College of Engineering and Technology

Department

Electrical and Computer Engineering

Share

COinS