View in EDS

UAV-based sweep coverage for time-sensitive targets with restricted visible areas.

Saved in:
Bibliographic Details
Title: UAV-based sweep coverage for time-sensitive targets with restricted visible areas.
Authors: Chen, Boxi1 (AUTHOR), Su, Jingfang1 (AUTHOR), Du, Hongwei1 (AUTHOR) hongwei.du@ieee.org
Source: Theoretical Computer Science. Aug2025, Vol. 1045, pN.PAG-N.PAG. 1p.
Subjects: Drone aircraft, Algorithms
Abstract: The utilization of Unmanned Aerial Vehicles (UAVs) for sweep coverage serves a diverse range of scenarios, including disaster surveillance, environment monitoring, and security patrolling. However, practical scenarios often pose challenges due to obstacles or overlapping targets, which restrict the visible area of targets. Furthermore, in specific contexts like disaster rescue, UAVs must swiftly cover targets due to the urgency of the information they provide. This paper proposes the problem of UAV-based Sweep Coverage for Time-Sensitive Targets with Restricted Visible Areas (SCTSRVA). To accommodate various obstacle-induced occlusion scenarios, the target's visible area is modeled as a sequence of sightline segments. To address this issue, we introduce the Sightline Sweep Coverage Path Planning (SSCPP) algorithm, which designs UAV flight paths based on the time and visibility limitations of the targets, ultimately minimizing the number of UAVs deployed. Experimental results reveal that the SSCPP algorithm reduces the number of UAV deployments by about 20.21% and outperforms the existing methods in different scenarios. • Consider the time sensitivity of target information and the visual constraints. • Design an efficient path planning algorithm for sweep coverage with UAV. • Experimental results prove that the algorithm outperforms existing algorithms. [ABSTRACT FROM AUTHOR]
Copyright of Theoretical Computer Science is the property of Elsevier B.V. and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:The utilization of Unmanned Aerial Vehicles (UAVs) for sweep coverage serves a diverse range of scenarios, including disaster surveillance, environment monitoring, and security patrolling. However, practical scenarios often pose challenges due to obstacles or overlapping targets, which restrict the visible area of targets. Furthermore, in specific contexts like disaster rescue, UAVs must swiftly cover targets due to the urgency of the information they provide. This paper proposes the problem of UAV-based Sweep Coverage for Time-Sensitive Targets with Restricted Visible Areas (SCTSRVA). To accommodate various obstacle-induced occlusion scenarios, the target's visible area is modeled as a sequence of sightline segments. To address this issue, we introduce the Sightline Sweep Coverage Path Planning (SSCPP) algorithm, which designs UAV flight paths based on the time and visibility limitations of the targets, ultimately minimizing the number of UAVs deployed. Experimental results reveal that the SSCPP algorithm reduces the number of UAV deployments by about 20.21% and outperforms the existing methods in different scenarios. • Consider the time sensitivity of target information and the visual constraints. • Design an efficient path planning algorithm for sweep coverage with UAV. • Experimental results prove that the algorithm outperforms existing algorithms. [ABSTRACT FROM AUTHOR]
ISSN:03043975
DOI:10.1016/j.tcs.2025.115276