Task Assignment Algorithms for Teams of UAVs in Dynamic Environments

For many vehicles, obstacles, and targets, coordination of a fleet of Unmanned Aerial Vehicles (UAVs) is a very complicated optimization problem, and the computation time typically increases very rapidly with the problem size. Previous research proposed an approach to decompose this large problem into task assignment and trajectory problems, while capturing key features of the coupling between them. This enabled the control architecture to solve an assignment problem first to determine a sequence of waypoints for each vehicle to visit, and then concentrate on designing paths to visit these pre-assigned waypoints. Although this approach greatly simplifies the problem, the task assignment optimization was still too slow for real-time UAV operations. This thesis presents a new approach to the task assignment problem that is much better suited for replanning in a dynamic battlefield. The approach, called the Receding Horizon Task Assignment (RHTA) algorithm, is shown to achieve nearoptimal performance with computational times that are feasible for real-time implementation. Further, this thesis extends the RHTA algorithm to account for the risk, noise, and uncertainty typically associated with the UAV environment. This work also provides new insights on the distinction between UAV coordination and cooperation. The benefits of these improvements to the UAV task assignment algorithms are demonstrated in several simulations and on two hardware platforms. Thesis Supervisor: Jonathan P. How Title: Associate Professor Thesis Supervisor: Eric Feron Title: Associate Professor