检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:于晓琳 郎炎澍 张崇 YU Xiaolin;LANG Yansu;ZHANG Chong(Department of Information and Communication, Police Officers College of PAP, Chengdu 610213, China;First Detachment, Second Mobile Brigade of Armed Police, Wuxi 214026, China)
机构地区:[1]武警警官学院信息通信系,成都610213 [2]武警第二机动总队第一支队,江苏无锡214026
出 处:《兵器装备工程学报》2022年第S01期139-142,共4页Journal of Ordnance Equipment Engineering
摘 要:为了使无人机蜂群作战的航迹规划更贴近侦察任务实际需求,对蚁群算法求解哈密顿路径的方法做了适当改进,引入影子蚂蚁,使蚂蚁本体和影子蚂蚁共同完成对所有目标点的访问,侦察任务中派遣的无人机总数即为影子蚂蚁和本体蚂蚁的数量。通过实验和结果分析,保证了蚁群算法在蜂群无人机航迹规划中路径总和最短、各条路径长度相近的结果,确保了改进后的算法在蜂群无人机航迹规划问题中的可行性和有效性。In order to make the planning of UAV swarm operations more reasonable and close to the actual needs of reconnaissance missions,the ant colony algorithm to solve Hamiltonian path method was improved.Introduced shadow ant,body ant and shadow ant were used to access all target points together.The total number of UAV dispatched in the reconnaissance mission is the number of shadow ants and body ants.Experiment contrast and the analysis of the results to ensure the ant colony algorithm in UAV swarm can ensure the shortest path planning,range of similar total path,make the planning of the track more reasonable,reconnaissance missions of press close to the actual demand,which proves that the improved algorithm in UAV swarm has the feasibility and validity in the path planning problem.
关 键 词:影子蚂蚁 蚁群算法 哈密顿回路 蜂群无人机 航迹规划
分 类 号:V27[航空宇航科学与技术—飞行器设计]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49