检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:王维[1] 张开放 WANG Wei;ZHANG Kaifang(College of Computer,National University of Defense Technology,Changsha 410073,China;Unit 61035 of PLA,Beijing 102205,China)
机构地区:[1]国防科技大学计算机学院,湖南长沙410073 [2]61035部队,北京102205
出 处:《陆军工程大学学报》2024年第5期49-56,共8页Journal of Army Engineering University of PLA
摘 要:不同于传统多旅行商问题,小型飞机测绘任务规划问题的每个测绘目标需要测绘多个测绘载荷,同时多次测绘间要有时间间隔,称之为路径交叉的多旅行商路径规划问题。针对点目标测绘任务场景,将最少飞机数量的求解目标转化为求解最短航行路径。在采用遗传算法求解最短路径的基础上,结合探测载荷约束、探测任务时长约束等条件,进一步规划出最优的调度方案。针对点目标和区域目标测绘任务规划问题,考虑各机场测绘任务工作量的均衡,定义测绘工作量指标为每个机场完成的测绘目标点和目标道路的数目,求解调度策略和飞机数量。在此基础上求解均衡性,使3个机场探测的目标点和目标道路数量相当。结果表明,所提方案兼顾了测绘代价与任务分配的均衡性。Unlike the traditional multiple Traveling Salesmen Problem(mTSP),the task planning for small aircraft surveying and mapping involves each surveying target requiring multiple surveying payloads,and there is also a time interval between multiple surveying,which is called path-crossing multiple traveling salesman path planning problem.For point target surveying task scenarios,the goal of solving the minimum number of aircraft is transformed into solving the shortest navigation path.On the basis of solving the shortest path by genetic algorithm,combined with detection load constraints,detection task duration constraints,and other conditions,the optimal scheduling scheme is further planned.For the planning of point target and regional target mapping tasks,taking the balance of the workload of each airport's mapping tasks into consideration,the mapping workload index is defined as the number of mapping target points and target roads completed by each airport.The demodulation strategy and the number of aircraft are first calculated,and then the equilibrium is solved to ensure that the number of target points and target roads detected by the three airports is equivalent.The results indicate that the proposed scheme balances both the surveying and mapping costs and the equity of task allocation.
关 键 词:多旅行商问题 遗传算法 组合优化 多目标规划 测绘任务规划 均衡度
分 类 号:TP39[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.17.9.170