Time sensitive sweep coverage with minimum UAVs

DOI10.1016/J.TCS.2022.06.025MaRDI QIDQ2079882zbMATH OpenOpenAlexWikidataFDO

Authors Yanyan Li

Publication date 7 October 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.06.025

zbMATH Keywords

sweep coveragetime sensitivityUAVs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint
• Network-based multiple UAVs search planning for disaster relief
• Data sensing with limited mobile sensors in sweep coverage
• Group sweep coverage with guaranteed approximation ratio
• Covering users by a connected swarm efficiently

Cites work

• An approximation algorithm for general energy restricted sweep coverage problem
• Design and analysis of approximation algorithms
• Group sweep coverage with guaranteed approximation ratio

Cited in

(4)

• Minimum Time Multi-UGV Surveillance
• Algorithm for partial sweep coverage on a line
• UAV-based sweep coverage for time-sensitive targets with restricted visible areas
• A multi-armed bandit approach to UAV sensor fusion for target tracking

This page was built for publication: Time sensitive sweep coverage with minimum UAVs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2079882)