A Repeated Coverage Path Planning Method for Fixed-Wing UAV Conducting Persistent Reconnaissance Missions
摘要
In this paper, the repeated coverage path planning problem of a fixed-wing unmanned aerial vehicle (UAV) conducting persistent reconnaissance missions is investigated. The definition of regional situation refresh time is given. A novel repeated coverage path planning method considering the shortest closed-loop return path is proposed. Finally, the numerical simulations demonstrate the effectiveness of the interlacing back-and-forth (BF) repeated coverage path planning method and show that it has better performance than the traditional one in terms of the closed-loop return path and regional situation refresh time.