基于改进 SSA 算法的移动机器人二维和三维路径规划

IF 2.1 Q3 ROBOTICS
Mailing Zhang, Pei Hao
{"title":"基于改进 SSA 算法的移动机器人二维和三维路径规划","authors":"Mailing Zhang, Pei Hao","doi":"10.1007/s41315-024-00374-7","DOIUrl":null,"url":null,"abstract":"<p>In recent years, mobile robots have been widely used in industrial automation, logistics, military, medical, and service industries. However, traditional mobile robots face difficulties in complex path planning. To solve this problem, a robot 2D and 3D path planning method has been proposed. Based on improved sparrow search algorithm (SSA), this method introduces a parameter adaptive update strategy to balance search and development. To enhance the algorithm’s path search capability in 3D environments, this study innovatively introduces ant colony algorithm to generate initial paths based on SSA. It also introduces local search mechanism to help the algorithm select the optimal path. Experiments have shown that the improved algorithm can quickly plan the shortest path, with a length reduction of 3.37% and 6.82%. It has reduced the average length by 6.09% and 5.54%, respectively. To verify its search performance, the improved algorithm significantly improved its convergence accuracy, and improved its mean fitness by about 20.5%, 24%, and 27.5%, respectively. The proposed technology has good application effects and will provide important technical references for mobile robots’ path planning in load environments.</p>","PeriodicalId":44563,"journal":{"name":"International Journal of Intelligent Robotics and Applications","volume":"47 1","pages":""},"PeriodicalIF":2.1000,"publicationDate":"2024-08-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"2D and 3D path planning for mobile robots based on improved SSA algorithm\",\"authors\":\"Mailing Zhang, Pei Hao\",\"doi\":\"10.1007/s41315-024-00374-7\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>In recent years, mobile robots have been widely used in industrial automation, logistics, military, medical, and service industries. However, traditional mobile robots face difficulties in complex path planning. To solve this problem, a robot 2D and 3D path planning method has been proposed. Based on improved sparrow search algorithm (SSA), this method introduces a parameter adaptive update strategy to balance search and development. To enhance the algorithm’s path search capability in 3D environments, this study innovatively introduces ant colony algorithm to generate initial paths based on SSA. It also introduces local search mechanism to help the algorithm select the optimal path. Experiments have shown that the improved algorithm can quickly plan the shortest path, with a length reduction of 3.37% and 6.82%. It has reduced the average length by 6.09% and 5.54%, respectively. To verify its search performance, the improved algorithm significantly improved its convergence accuracy, and improved its mean fitness by about 20.5%, 24%, and 27.5%, respectively. The proposed technology has good application effects and will provide important technical references for mobile robots’ path planning in load environments.</p>\",\"PeriodicalId\":44563,\"journal\":{\"name\":\"International Journal of Intelligent Robotics and Applications\",\"volume\":\"47 1\",\"pages\":\"\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-08-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Intelligent Robotics and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1007/s41315-024-00374-7\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"ROBOTICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Intelligent Robotics and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1007/s41315-024-00374-7","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"ROBOTICS","Score":null,"Total":0}
引用次数: 0

摘要

近年来,移动机器人已广泛应用于工业自动化、物流、军事、医疗和服务等行业。然而,传统的移动机器人在复杂的路径规划中面临着困难。为了解决这个问题,人们提出了一种机器人二维和三维路径规划方法。该方法基于改进的麻雀搜索算法(SSA),引入了参数自适应更新策略,以平衡搜索和开发。为了增强算法在三维环境中的路径搜索能力,本研究在 SSA 的基础上创新性地引入了蚁群算法来生成初始路径。它还引入了局部搜索机制,帮助算法选择最优路径。实验表明,改进后的算法可以快速规划出最短路径,长度缩短了 3.37% 和 6.82%。平均长度分别减少了 6.09% 和 5.54%。为了验证其搜索性能,改进算法显著提高了收敛精度,平均适合度分别提高了约 20.5%、24% 和 27.5%。所提出的技术具有良好的应用效果,将为移动机器人在负载环境中的路径规划提供重要的技术参考。
本文章由计算机程序翻译,如有差异,请以英文原文为准。

2D and 3D path planning for mobile robots based on improved SSA algorithm

2D and 3D path planning for mobile robots based on improved SSA algorithm

In recent years, mobile robots have been widely used in industrial automation, logistics, military, medical, and service industries. However, traditional mobile robots face difficulties in complex path planning. To solve this problem, a robot 2D and 3D path planning method has been proposed. Based on improved sparrow search algorithm (SSA), this method introduces a parameter adaptive update strategy to balance search and development. To enhance the algorithm’s path search capability in 3D environments, this study innovatively introduces ant colony algorithm to generate initial paths based on SSA. It also introduces local search mechanism to help the algorithm select the optimal path. Experiments have shown that the improved algorithm can quickly plan the shortest path, with a length reduction of 3.37% and 6.82%. It has reduced the average length by 6.09% and 5.54%, respectively. To verify its search performance, the improved algorithm significantly improved its convergence accuracy, and improved its mean fitness by about 20.5%, 24%, and 27.5%, respectively. The proposed technology has good application effects and will provide important technical references for mobile robots’ path planning in load environments.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.80
自引率
5.90%
发文量
50
期刊介绍: The International Journal of Intelligent Robotics and Applications (IJIRA) fosters the dissemination of new discoveries and novel technologies that advance developments in robotics and their broad applications. This journal provides a publication and communication platform for all robotics topics, from the theoretical fundamentals and technological advances to various applications including manufacturing, space vehicles, biomedical systems and automobiles, data-storage devices, healthcare systems, home appliances, and intelligent highways. IJIRA welcomes contributions from researchers, professionals and industrial practitioners. It publishes original, high-quality and previously unpublished research papers, brief reports, and critical reviews. Specific areas of interest include, but are not limited to:Advanced actuators and sensorsCollective and social robots Computing, communication and controlDesign, modeling and prototypingHuman and robot interactionMachine learning and intelligenceMobile robots and intelligent autonomous systemsMulti-sensor fusion and perceptionPlanning, navigation and localizationRobot intelligence, learning and linguisticsRobotic vision, recognition and reconstructionBio-mechatronics and roboticsCloud and Swarm roboticsCognitive and neuro roboticsExploration and security roboticsHealthcare, medical and assistive roboticsRobotics for intelligent manufacturingService, social and entertainment roboticsSpace and underwater robotsNovel and emerging applications
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信