无人机
计算机科学
调度(生产过程)
车辆路径问题
布线(电子设计自动化)
实时计算
计算机网络
分布式计算
数学优化
数学
遗传学
生物
作者
Menglan Hu,Weidong Liu,Kai Peng,Xiaoqiang Ma,Wenqing Cheng,Jiangchuan Liu,Bo Li
标识
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.
科研通智能强力驱动
Strongly Powered by AbleSci AI