计算机科学
实时计算
区间(图论)
雷达跟踪器
跟踪(教育)
特征(语言学)
噪音(视频)
集合(抽象数据类型)
缩小
钥匙(锁)
作者
Yunrui Cao,Binyu Yan,Wenzheng Xu,Weifa Liang,Zichuan Xu,Tang Liu,Shengxin Dai,Dong Cao,Sajal Kumar Das,Xiaohua Jia
出处
期刊:
[Institute of Electrical and Electronics Engineers]
日期:2026-01-01
卷期号:34: 7895-7906
标识
DOI:10.1109/ton.2026.3746605
摘要
UAVs (Uncrewed Aerial Vehicles) are promising tools for disaster monitoring, by obtaining valuable information of important PoIs (Points of Interest) with onboard cameras. Since people trapped at some PoIs are more likely in danger than people in other PoIs, different PoIs have different monitoring priorities, so that the PoIs with high monitoring priorities should be visited more often than those with low priorities. Unlike existing studies that assumed a UAV is required to fly to the location of a PoI to monitor the PoI, we observe that a UAV can monitor a PoI as long as it hovers at any location around the PoI (e.g., 200 m away horizontally), thereby reducing the flying time of the UAV. In this paper, we first study a problem of finding a sequence of monitoring tours for an energy-constrained UAV to monitor PoIs in a disaster area for a monitoring period$T$(e.g., 72 hours) persistently, such that the maximum weighted monitoring interval of PoIs is minimized, where the weight associated with a PoI is its monitoring priority, and the monitoring interval of a PoI is the longest time between its two consecutive visits in period$T$. We then propose a novel approximation algorithm for the problem. We also extend the proposed algorithm to the scenario with multiple UAVs. We finally evaluate the algorithm performance based on both a real testbed and the simulation. The experimental results show that the maximum weighted monitoring intervals by the proposed algorithms are up to 35% shorter than those by existing algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI