Joint Routing and Scheduling for Vehicle-Assisted Multidrone Surveillance

无人机 计算机科学 调度(生产过程) 车辆路径问题 布线(电子设计自动化) 实时计算 计算机网络 分布式计算 数学优化 数学 遗传学 生物
作者
Menglan Hu,Weidong Liu,Kai Peng,Xiaoqiang Ma,Wenqing Cheng,Jiangchuan Liu,Bo Li
出处
期刊:IEEE Internet of Things Journal [Institute of Electrical and Electronics Engineers]
卷期号:6 (2): 1781-1790 被引量:86
标识
DOI:10.1109/jiot.2018.2878602
摘要

In recent decades, unmanned aerial vehicles (UAVs, also known as drones) equipped with multiple sensors have been widely utilized in various applications. Nevertheless, constrained by limited battery capacities, the hovering time of UAVs is quite limited, prohibiting them from serving a wide area. To cater with remote sensing applications, people often employ vehicles to transport, launch, and recycle them. The so-called vehicledrone cooperation (VDC) benefits from both the far driving distance of vehicles and the high mobility of UAVs. Efficient routing and scheduling can greatly reduce time consumption and financial expenses incurred in VDC. However, previous works in vehicle-drone cooperative sensing considered only one drone, thus unable to simultaneously cover multiple targets distributed in an area. Using multiple drones to sense different targets in parallel can significantly promote efficiency and expand service areas. Therefore, we propose a novel problem, referred to as vehicle-assisted multidrone routing and scheduling problem. To tackle the problem, we contribute an efficient algorithm, referred to as vehicle-assisted multi-UAV routing and scheduling algorithm (VURA). In VURA, we maintain and iteratively update a memory containing candidate UAV routes. VURA works by iteratively deriving solutions based on UAV routes picked from the memory. In every iteration, VURA jointly optimizes anchor point selection, path planning, and tour assignment via nested optimization operations. To the best of our knowledge, we are the first to tackle this novel yet challenging problem. Finally, performance evaluation is presented to demonstrate the effectiveness and efficiency of our algorithm when compared with existing solutions.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
彭于晏应助赵敏采纳,获得10
1秒前
Una发布了新的文献求助10
1秒前
燕子发布了新的文献求助20
2秒前
百川完成签到,获得积分10
2秒前
AFF完成签到,获得积分10
2秒前
3秒前
Wei完成签到 ,获得积分10
3秒前
4秒前
4秒前
4秒前
可爱的函函应助甜甜圈采纳,获得10
5秒前
酷波er应助hazel采纳,获得10
5秒前
5秒前
向连虎完成签到,获得积分10
5秒前
乐观的素阴完成签到 ,获得积分10
6秒前
AireenBeryl531应助元谷雪采纳,获得10
7秒前
上帝的宠儿完成签到,获得积分10
7秒前
所所应助Linica采纳,获得10
8秒前
意志力发布了新的文献求助10
9秒前
didiwang发布了新的文献求助10
9秒前
sf完成签到 ,获得积分10
9秒前
10秒前
勤劳的道罡完成签到,获得积分10
10秒前
文昌发布了新的文献求助10
11秒前
11秒前
123发布了新的文献求助10
11秒前
gong完成签到,获得积分10
11秒前
12秒前
郷禦发布了新的文献求助10
12秒前
桐桐应助Ha La La La采纳,获得10
13秒前
13秒前
13秒前
NexusExplorer应助科研通管家采纳,获得50
13秒前
13秒前
Kao应助科研通管家采纳,获得10
13秒前
在水一方应助科研通管家采纳,获得10
13秒前
14秒前
充电宝应助科研通管家采纳,获得10
14秒前
Kao应助科研通管家采纳,获得10
14秒前
Kao应助科研通管家采纳,获得10
14秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
内視鏡的に摘除しえた十二指腸乳頭部腫瘍の2例 660
Cognitive Psychology in a Changing World 600
On nonlinear stability of contact discontinuities. In: Hyperbolic problems: theory, numerics, applications (Stony Brook, NY, 1994) 510
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
微电子器件实验教程 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7683165
求助须知:如何正确求助?哪些是违规求助? 9247258
关于积分的说明 19945191
捐赠科研通 7255963
什么是DOI,文献DOI怎么找? 3288438
关于科研通互助平台的介绍 2445823
邀请新用户注册赠送积分活动 2292356