检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:彭艺[1] 唐剑 杨青青[1] PENG Yi;TANG Jian;YANG Qingqing(Faculty of Information Engineering and Automation,Kunming University of Science and Technology,Kunming 650500,China;College of Artificial Intelligence,Shaoyang Industry Polytechnic College,Shaoyang 422000,Hunan Province,China)
机构地区:[1]昆明理工大学信息工程与自动化学院,昆明650500 [2]邵阳工业职业技术学院人工智能学院,湖南邵阳422000
出 处:《吉林大学学报(理学版)》2025年第2期585-594,共10页Journal of Jilin University:Science Edition
基 金:国家自然科学基金(批准号:61761025;62461030);云南省基础研究面上项目(批准号:202401AT070415);云南省基础研究重点项目(批准号:202401AS070105)。
摘 要:针对复杂山区环境下应急通信无人机的飞行路径规划问题,通过综合考虑障碍物、无人机载重量、无人机电池容量等约束条件,为降低无人机的飞行时间并延长飞行距离,基于Harris鹰算法框架设计一种改进Harris鹰算法的无人机三维路径规划方法.首先,对Harris鹰的种群初始位置、位置更新方程和猎物的逃逸能量进行改进;其次,采用三次样条曲线插值法对路径进行平滑,以确保无人机飞行过程中安全可靠且平滑;最后,将应急无人机在具有不同障碍物的山区进行测试,并将所得结果与标准Harris鹰、蚁群算法和人工蜂群算法进行对比分析.分析结果表明,该算法所规划的三维路径规划方法生成的路径更短,并能更快地寻找到最优路径.Aiming at the flight path planning problem of emergency communication unmanned aerial vehicle(UAV)in complex mountainous environ ment,by comprehensively considering the constraints such as obstacles,UAV load and UAV battery capacity,in order to reduce the flight time and exten d the flight distance of UAV,based on the framework of Harris hawk algorithm,we designed a three-dimensional path planning method of UAV based on improved Harris hawk algorithm.Firstly,we improved the initial position of Harris hawk population,position update equation and escape energy of prey.Secondly,the path was smoothed by using cub ic spline curve interpolation method to ensure safe,reliable and smooth operation of the UAV during flight.Finally,the emergency UAV was tested in mountain ous areas with different obstacles,and the results were compared with the standard Harris hawk,ant colony algorithm and artificial bee colony algorithm.The analysis results show that the path generated by the three-dimensional path planning method planned by this algorithm is shorter and can find the optimal path faster.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49