检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:白宇鑫 陈振亚[1,2] 石瑞涛 苏蔚涛 马卓强 杨尚进 Bai Yuxin;Chen Zhenya;hi Ruio;Su Weitao;Ma Zhuogiang;Yang Shangjin(School of Mechanical Engineering,North University of China,Taiyuan 030051,China;Shanxi Provincial Key Laboratory of Intelligent Equipment Technology in Harsh Environment,Taiyuan 030051,China)
机构地区:[1]中北大学机械工程学院,山西太原030051 [2]恶劣环境下智能装备技术山西省重点实验室,山西太原030051
出 处:《系统仿真学报》2025年第3期742-752,共11页Journal of System Simulation
基 金:国家自然科学基金(52005456);山西省专利转化专项计划(202305006);中央引导地方科技发展专项(YDZJSX2022A032);山西省研究生科研创新项目(2023KY598)。
摘 要:为提升哈里斯鹰优化算法收敛精度,解决易陷入局部最优等问题,提出了一种基于迭代混沌精英反向学习和黄金正弦策略的哈里斯鹰优化算法(gold sine HHO,GSHHO)。利用无限迭代混沌映射初始化种群,运用精英反向学习策略筛选优质种群,提高种群质量,增强算法的全局搜索能力;使用一种收敛因子调整策略重新计算猎物能量,平衡算法的全局探索和局部开发能力;在哈里斯鹰的开发阶段引入黄金正弦策略,替换原有的位置更新方法,提升算法的局部开发能力;在9个测试函数和不同规模的栅格地图上评估GSHHO的有效性。实验结果表明:GSHHO在不同测试函数中具有较好的寻优精度和稳定性能,在2次机器人路径规划中路径长度较原始HHO算法分别减少4.4%、3.17%,稳定性分别提升52.98%、63.12%。In order to improve the convergence accuracy of the HHO algorithm,this paper proposes a GSHHO(gold sine harris hawks optimization)algorithm based on multi-strategies.An infinite iterative chaotic map is used to initialize the population,and an elite reverse learning strategy is used to improve population quality,A convergence factor adjustment strategy is used to recalculate prey energy.balancing the global exploration and local development capabilities of the algorithm,In the development phase of Harris Eagle,the golden sine strategy was introduced to replace the original position update method and improve the local development ability of the algorithm,Experiments were conducted to evaluate the optimization performance of GSHHO.Experimental results show that the path length of GSHHO is reduced by 4.4%and 3.17%respectively and the stability is increased by 52.98%and 63.12%respectively compared with the original HHO algorithm.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7