The use of multiple fixed-wing unmanned aerial vehicles in search and rescue missions after natural disasters has become of great interest as they can search large areas and find survivors as quickly as possible. This paper discusses a minimum time cooperative search scheme that utilizes ant colony optimization and new heuristic functions to tackle various constraints in a dynamic environment. The study makes novel use of Dubins curves in the heuristic functions to consider the kinematic limitations of fixed-wing UAVs when planning tangent continuity paths. Furthermore, a novel probabilistic approach is introduced to model the uncertainties induced by dynamic obstacles and determine optimal search paths that are safe and practical in a grid search environment. The performance of the proposed search algorithm is tested through two-dimensional and three-dimensional simulations, statistical analysis, and comparison with other well-known optimization algorithms. To randomize the simulated cooperative search, different search scenarios with static and dynamic obstacles are run several times.
Read full abstract