Search using multiple UAVs with flight time constraints

We consider a large scale system consisting of multiple unmanned aerial vehicles (UAVs) performing a search and surveillance task, based on the uncertainty map of an unknown region. The search algorithm is based on the k-shortest path algorithm that maximizes the effectiveness of the search in term of searching through the maximum uncertainty region, given a constraint on the endurance time of the UAV and on the location of the base station from which the UAVs operate. These constraints set apart this class of problems from the usual search and surveillance problems. We compare the performance of this algorithm with a random search and a greedy strategy search, We also implement the algorithm for the case of multiple UAVs searching an unknown region. The cases of delayed and partial information are also considered. Simulation results that demonstrate the efficacy of the technique are also presented.