arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.15841eess.SYcs.NIcs.SYmath.OC
收藏

近似通用多无人 aerial 车监控任务路由问题

Close-enough general routing problem for multiple unmanned aerial vehicles in monitoring missions

Nanjing University of Information Science and Technology(南京信息工程大学);Polytechnique Montreal(蒙特利尔高等商学院);Central South University(中南大学)

Huan Liu, Michel Gendreau, Binjie Xu, Guohua Wu, Yi Gu

AI总结:

本文提出了一种近似通用多无人机路由算法,通过两阶段迭代方法结合VND和SOCP,优化无人机监控任务的路线和圆盘邻域,提升效率和性能。

摘要:

在本文中,我们介绍了一个近似多无人机通用路由问题(CEMUAVGRP),其中一组同质无人机执行包含节点的任务,每个节点都有其圆盘邻域,以及边,旨在最小化总距离。提出了一种两阶段迭代方法,将CEMUAVGRP分为通用路由阶段,该阶段获得每个无人机所需的包含所需节点和边的满意路线,而不考虑所需节点的圆盘邻域;以及近似路由阶段,其中在确定的路线中为每个所需节点优化代表点。具体来说,为通用路由阶段提出了一种变量邻域下降(VND)启发式方法,而在近似路由阶段应用了二次锥编程(SOCP)过程。这两个阶段在自适应迭代局部搜索(AILS)算法的框架下以迭代方式进行,直到满足预定义的终止标准。进行了广泛的实验和比较研究,证明了所提出的AILS-VND-SOCP算法的效率以及圆盘邻域的优越性。

英文摘要:

In this paper, we introduce a close-enough multi-UAV general routing problem (CEMUAVGRP) where a fleet of homogeneous UAVs conduct monitoring tasks containing nodes, each of which has its disk neighborhood, and edges, aiming to minimize the total distance. A two-phase iterative method is proposed, partitioning the CEMUAVGRP into a general routing phase where a satisfactory route including required nodes and edges for each UAV is obtained without considering the disk neighborhoods of required nodes, and a close-enough routing phase where representative points are optimized for each required node in the determined route. To be specific, a variable neighborhood descent (VND) heuristic is proposed for the general routing phase, while a second-order cone programming (SOCP) procedure is applied in the close-enough routing phase. These two phases are performed in an iterative fashion under the framework of an adaptive iterated local search (AILS) algorithm until the predefined termination criteria are satisfied. Extensive experiments and comparative studies are conducted, demonstrating the efficiency of the proposed AILS-VND-SOCP algorithm and the superiority of disk neighborhoods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑