A Path Planning Method for Sweep Coverage With Multiple UAVs

Abstract

Wireless sensor networks (WSNs) are usually deployed in the target area to carry out detecting or monitoring tasks. Sweep coverage is an important concern of WSNs that more targets in the area can be monitored with fewer mobile sensor nodes. With the rapid development of unmanned aerial vehicle (UAV) technology, UAV has been increasingly used in military and civil fields. UAVs can be regarded as sensor nodes to perform specific tasks. Due to the limited battery lifetime of UAV in flight mission, it is difficult to achieve full coverage of all targets in a large-scale monitoring scenario. In this article, we study how to plan the paths of multiple UAVs for sweep coverage. Based on the background of forest fire early warning and monitoring, we consider a min-time max-coverage (MTMC) issue in sweep coverage, where a set of UAVs is dispatched to efficiently patrol the targets in the given area to achieve maximum coverage in minimum time. We establish a mathematical model considering the different coverage quality requirements of the targets in the given area. Then, we analyze the characteristics of the model and propose a heuristic algorithm weighted targets sweep coverage (WTSC) to find the optimal path, which considers the weights of the targets and the performance constraints of UAVs. Finally, we provide various numerical experiments and comparisons with several previous works to validate the superiority of the proposed algorithm.