Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning

B. Tutuko, S. Nurmaini, Ganesha Ogi
{"title":"Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning","authors":"B. Tutuko, S. Nurmaini, Ganesha Ogi","doi":"10.18495/COMENGAPP.V7I1.241","DOIUrl":null,"url":null,"abstract":"Path planning is an essential task for the mobile robot navigation. However, such a task is difficult to solve, due to the optimal path needs to be rerouted in real-time when a new obstacle appears. It produces a sub-optimal path and the robot can be trapped in local minima. To overcome the problem the Ant Colony Optimization (ACO) is combined with Fuzzy Logic Approach to make a globally optimal path. The Fuzzy-ACO algorithm is selected because the fuzzy logic has good performance in imprecision and uncertain environment and the ACO produce simple optimization with an ability to find the globally optimal path. Moreover, many optimization algorithms addressed only at the simulation level. In this research, the real experiment is conducted with the low-cost Explorer-Follower robot. The results show that the proposed algorithm, enables them to successfully identify the shortest path without collision and stack in “local minima”.","PeriodicalId":120500,"journal":{"name":"Computer Engineering and Applications","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Engineering and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18495/COMENGAPP.V7I1.241","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Path planning is an essential task for the mobile robot navigation. However, such a task is difficult to solve, due to the optimal path needs to be rerouted in real-time when a new obstacle appears. It produces a sub-optimal path and the robot can be trapped in local minima. To overcome the problem the Ant Colony Optimization (ACO) is combined with Fuzzy Logic Approach to make a globally optimal path. The Fuzzy-ACO algorithm is selected because the fuzzy logic has good performance in imprecision and uncertain environment and the ACO produce simple optimization with an ability to find the globally optimal path. Moreover, many optimization algorithms addressed only at the simulation level. In this research, the real experiment is conducted with the low-cost Explorer-Follower robot. The results show that the proposed algorithm, enables them to successfully identify the shortest path without collision and stack in “local minima”.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有全局最优路径规划的探索者-追随者机器人模糊逻辑-蚁群优化
路径规划是移动机器人导航的一项重要任务。然而,这样的任务很难解决,因为当出现新的障碍物时,最优路径需要实时重新路由。它产生了一个次优路径,机器人可能被困在局部极小值中。为了解决这一问题,将蚁群优化算法与模糊逻辑方法相结合,得到全局最优路径。选择模糊-蚁群算法是因为模糊逻辑在不精确和不确定环境下具有良好的性能,而且蚁群算法优化简单,能够找到全局最优路径。此外,许多优化算法仅在仿真级别进行处理。在本研究中,使用低成本的Explorer-Follower机器人进行了真实实验。结果表明,所提出的算法使他们能够在€œlocal minima€€中成功地识别出无碰撞和堆栈的最短路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Fuzzy Logic-Ant Colony Optimization for Explorer-Follower Robot with Global Optimal Path Planning BLOB Analysis for Fruit Recognition and Detection Some Physical and Computational Features of Unloaded Power Transmission Lines' Switching-off Process A new method to improve feature selection with meta-heuristic algorithm and chaos theory Implementation Color Filtering and Harris Corner Method on Pattern Recognition System
×
引用
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