期刊文献+

基于可变异混合PSO的上肢康复机器人轨迹优化

Upper limb rehabilitation robot trajectory optimization based on variable mutation hybrid particle swarm optimizationrch
下载PDF
导出
摘要 针对上肢康复机器人的训练轨迹运动生涩、不贴合人手臂的日常习惯等问题,提出使用改进粒子群算法对上肢康复机器人进行时间最优轨迹优化.由于粒子群算法极易早熟,存在寻优稳定性较差的问题,在算法中引入鸟类混群协同觅食的概念,设计了一种新的速度更新公式,考虑个体极值、群体极值和社会极值对粒子更新的影响,提高了算法在高维搜索空间中和高维约束条件下的全局寻优能力与寻优鲁棒性,并在粒子迭代过程中引入停滞变异补偿机制增加粒子多样性,进一步提升算法的寻优效率.通过MATLAB仿真实验,改进后的粒子群算法将平均最优时间缩短44.29%,平均收敛代数减小了16.75%,使得上肢康复机器人各关节运动符合康复训练要求,能够提高康复训练质量. Regarding the cumbersome motion trajectories of upper limb rehabilitation robots,which do not align with the daily habits of human arms,we propose the use of an improved particle swarm algorithm for time-optimal trajectory optimization.Addressing the issue of premature convergence and poor optimization stability inherent in the particle swarm algorithm,we incorporate the concept of flock foraging coordination in birds into the algorithm.A novel velocity updating formula is designed,taking into account the influences of individual extremum,group extremum,and social extremum on particle updates.This design enhances the algorithm’s global optimization capability and optimization robustness in high-dimensional search spaces and under high-dimensional constraint conditions.Additionally,a stagnation mutation compensation mechanism is introduced during particle iteration to increase particle diversity,further improving the algorithm’s optimization efficiency.Through MATLAB simulation experiments,the improved particle swarm algorithm reduces the average optimal time by 44.29%and decreases the average convergence iterations by 16.75%.Furthermore,the joint movements of the upper limb rehabilitation robot conform to the requirements of rehabilitation training,thereby enhancing the quality of rehabilitation training.
作者 徐玉杰 李宪华 宋韬 Xu Yujie;Li Xianhua;Song Tao(School of Mechanical and Electrical Engineering,Anhui University of Science and Technology,Huainan 232001,China;The First Affiliated Hospital of Anhui University of Science and Technology(Huainan First People’s Hospital),Huainan 232007,China;School of Mechanical and Electrical Engineering and Automation,Shanghai University,Shanghai 200444,China)
出处 《河南科技学院学报(自然科学版)》 2024年第4期36-46,共11页 Journal of Henan Institute of Science and Technology(Natural Science Edition)
基金 国家自然科学基金(61803251) 安徽省重点研究与开发计划(2022i01020015) 载运工具与装备教育部重点实验室开放课题(KLCE2022-01)。
关键词 上肢康复机器人 轨迹优化 粒子群算法 时间最优 upper limb rehabilitation robot trajectory optimization particle swarm optimization time-optimal
  • 相关文献

参考文献14

二级参考文献124

  • 1余灵,喻洪流.上肢康复机器人研究进展[J].生物医学工程学进展,2020(3):134-138. 被引量:12
  • 2徐向荣,秦锋,毕文昌.利用样条函数规划机器人运动轨迹[J].华东冶金学院学报,1996,13(3):203-208. 被引量:2
  • 3各类脑血管疾病诊断要点[J].中华神经科杂志,1996,29(6):379-380. 被引量:33020
  • 4Kennedy J. The particle swarm: social adaptation of knowledge [ C ] // IEEE International Conference on Evolutionary Computation. Washington D C: IEEE, 1997: 303 - 308.
  • 5Battiti R, Pasupuleti S. The gregarious particle swarm optimizer (G-PSO) [ C J // Proceedings of ACM Genetic and Evolutionary Computation Conference. Washington D C: ACM, 2006 : 67 - 74.
  • 6Xie X F, Zhang W J, Yang Z L. A dissipative particle swarm optimization[ C]//Proceedings of the IEEE Conference on Evolutionary Computation. Honolulu: IEEE, 2002:1456 - 1461.
  • 7Shi Y H, Eberhart R C. Fuzzy adaptive particle swarm optimization [ C]// Proceedings of IEEE Evolutionary Computation. Piscataway: IEEE, 2001:101- 106.
  • 8Bergh V, Engellbrecht A. Using neighborhood with the guaranteed convergence PSO [ C ]//IEEE Swarm Intelligence Symposium. Piscataway:IEEE, 2003:235-242.
  • 9Angeline P J. Using selection to improve particle swarm optimization [ C ] // IEEE International Conference on Evolutionary Computation. New York: IEEE, 1998:84 - 89.
  • 10Lovbjerg M, Rasmussen T K, Krink T. Hybrid particle swarm optimizer with breeding and subpopulations [ C ] // Proceeding of the 3rd Genetic and Evolutionary Computation Conference (GECCO2001). Heidelberg: Springer, 2001:413-416.

共引文献72

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部