Network-Based Multiple UAVs Search Planning for Disaster Relief

This paper studies the use of multiple unmanned aerial vehicles (UAVs) for searching a victim of disaster. We propose a network-based optimization model for planning the search path of multiple UAVs in a disaster-stricken area and estimating the number of UAVs necessary for search. A heuristic algorithm is devised to solve the optimization model and applied to the problem instances taken from potential hazard areas in Japan. Our computational result shows relatively small number of UAVs is enough to cover the area in most of cases. We also give an investigation on the relation between search area and the number of UAVs necessary for search via regression methods.