Mobile Robot Path Planning Optimization Based on Integration of Firefly Algorithm and Cubic Polynomial Equation

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS Journal of ICT Research and Applications Pub Date : 2022-04-30 DOI:10.5614/itbj.ict.res.appl.2022.16.1.1
Sura Mazin Ali, Jan Yonan, Omar Alniemi, A. A. Ahmed
{"title":"Mobile Robot Path Planning Optimization Based on Integration of Firefly Algorithm and Cubic Polynomial Equation","authors":"Sura Mazin Ali, Jan Yonan, Omar Alniemi, A. A. Ahmed","doi":"10.5614/itbj.ict.res.appl.2022.16.1.1","DOIUrl":null,"url":null,"abstract":"Mobile Robot is an extremely essential technology in the industrial world. Optimal path planning is essential for the navigation of mobile robots. The firefly algorithm is a very promising tool of Swarm Intelligence, which is used in various optimization areas. This study used the firefly algorithm to solve the mobile robot path-planning problem and achieve optimal trajectory planning. The objective of the proposed method is to find the free-collision-free points in the mobile robot environment and then generate the optimal path based on the firefly algorithm. It uses the A∗ algorithm to find the shortest path. The essential function of use the firefly algorithm is applied to specify the optimal control points for the corresponding shortest smooth trajectory of the mobile robot. Cubic Polynomial equation is applied to generate a smooth path from the initial point to the goal point during a specified period. The results of computer simulation demonstrate the efficiency of the firefly algorithm in generating optimal trajectory of mobile robot in a variable degree of mobile robot environment complexity.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":" ","pages":""},"PeriodicalIF":0.5000,"publicationDate":"2022-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of ICT Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/itbj.ict.res.appl.2022.16.1.1","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

Mobile Robot is an extremely essential technology in the industrial world. Optimal path planning is essential for the navigation of mobile robots. The firefly algorithm is a very promising tool of Swarm Intelligence, which is used in various optimization areas. This study used the firefly algorithm to solve the mobile robot path-planning problem and achieve optimal trajectory planning. The objective of the proposed method is to find the free-collision-free points in the mobile robot environment and then generate the optimal path based on the firefly algorithm. It uses the A∗ algorithm to find the shortest path. The essential function of use the firefly algorithm is applied to specify the optimal control points for the corresponding shortest smooth trajectory of the mobile robot. Cubic Polynomial equation is applied to generate a smooth path from the initial point to the goal point during a specified period. The results of computer simulation demonstrate the efficiency of the firefly algorithm in generating optimal trajectory of mobile robot in a variable degree of mobile robot environment complexity.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于萤火虫算法与三次多项式方程集成的移动机器人路径规划优化
移动机器人是工业界一项极其重要的技术。最优路径规划是移动机器人导航的关键。萤火虫算法是Swarm Intelligence的一个非常有前途的工具,用于各种优化领域。本研究采用萤火虫算法来解决移动机器人的路径规划问题,实现最优轨迹规划。该方法的目的是在移动机器人环境中找到自由碰撞的自由点,然后基于萤火虫算法生成最优路径。它使用A*算法来寻找最短路径。应用萤火虫算法的基本功能来指定移动机器人相应最短平滑轨迹的最优控制点。三次多项式方程用于在指定的时间段内生成从初始点到目标点的平滑路径。计算机仿真结果表明,在移动机器人环境复杂度可变的情况下,萤火虫算法能够有效地生成移动机器人的最优轨迹。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Journal of ICT Research and Applications
Journal of ICT Research and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
1.60
自引率
0.00%
发文量
13
审稿时长
24 weeks
期刊介绍: Journal of ICT Research and Applications welcomes full research articles in the area of Information and Communication Technology from the following subject areas: Information Theory, Signal Processing, Electronics, Computer Network, Telecommunication, Wireless & Mobile Computing, Internet Technology, Multimedia, Software Engineering, Computer Science, Information System and Knowledge Management. Authors are invited to submit articles that have not been published previously and are not under consideration elsewhere.
期刊最新文献
Smart Card-based Access Control System using Isolated Many-to-Many Authentication Scheme for Electric Vehicle Charging Stations The Evaluation of DyHATR Performance for Dynamic Heterogeneous Graphs Machine Learning-based Early Detection and Prognosis of the Covid-19 Pandemic Improving Robustness Using MixUp and CutMix Augmentation for Corn Leaf Diseases Classification based on ConvMixer Architecture Generative Adversarial Networks Based Scene Generation on Indian Driving Dataset
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1