基于改进洪水填充算法的多智能体寻路机器人迷宫探索设计

Q3 Engineering
Semuil Tjiharjadi, Sazalinsyah Razali, H. Sulaiman, Gerry Fernando
{"title":"基于改进洪水填充算法的多智能体寻路机器人迷宫探索设计","authors":"Semuil Tjiharjadi, Sazalinsyah Razali, H. Sulaiman, Gerry Fernando","doi":"10.18178/ijmerr.11.8.631-638","DOIUrl":null,"url":null,"abstract":"—Maze exploration is a field of science that continues to be researched and developed. Various algorithms, techniques, and scenarios result in faster trips and shortest distances. Various international competitions in the maze field are also held to encourage quicker and better labyrinth exploration innovations. Usually, maze exploration uses a mobile robot that moves autonomously in pathfinding to reach the target location. This study aims to generate and test a multi-agent algorithm to find the closest distance to reach a target in an unknown maze. So the question is how multi-agents can work together to reach the target using the shortest possible path. For this reason, a flood fill algorithm usually used for single-agent has been developed into an improved flood fill algorithm that can be applied to multi-agents. The result is an algorithm that can be applied to find targets through unknown maze exploration using multi-agent.","PeriodicalId":37784,"journal":{"name":"International Journal of Mechanical Engineering and Robotics Research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Design of Multi-Agent Pathfinding Robot Using Improved Flood Fill Algorithm in Maze Exploration\",\"authors\":\"Semuil Tjiharjadi, Sazalinsyah Razali, H. Sulaiman, Gerry Fernando\",\"doi\":\"10.18178/ijmerr.11.8.631-638\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"—Maze exploration is a field of science that continues to be researched and developed. Various algorithms, techniques, and scenarios result in faster trips and shortest distances. Various international competitions in the maze field are also held to encourage quicker and better labyrinth exploration innovations. Usually, maze exploration uses a mobile robot that moves autonomously in pathfinding to reach the target location. This study aims to generate and test a multi-agent algorithm to find the closest distance to reach a target in an unknown maze. So the question is how multi-agents can work together to reach the target using the shortest possible path. For this reason, a flood fill algorithm usually used for single-agent has been developed into an improved flood fill algorithm that can be applied to multi-agents. The result is an algorithm that can be applied to find targets through unknown maze exploration using multi-agent.\",\"PeriodicalId\":37784,\"journal\":{\"name\":\"International Journal of Mechanical Engineering and Robotics Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Mechanical Engineering and Robotics Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18178/ijmerr.11.8.631-638\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Mechanical Engineering and Robotics Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18178/ijmerr.11.8.631-638","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

摘要

迷宫探索是一个不断研究和发展的科学领域。各种算法、技术和场景导致更快的行程和更短的距离。在迷宫领域还举办各种国际比赛,以鼓励更快更好的迷宫探索创新。通常,迷宫探索使用一个移动机器人,它在寻路中自主移动以到达目标位置。本研究旨在生成并测试一种多智能体算法,以在未知迷宫中找到到达目标的最近距离。所以问题是多智能体如何协同工作以使用最短的可能路径到达目标。因此,通常用于单智能体的洪水填充算法已经发展成为一种适用于多智能体的改进洪水填充算法。该算法可用于多智能体在未知迷宫探索中寻找目标。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Design of Multi-Agent Pathfinding Robot Using Improved Flood Fill Algorithm in Maze Exploration
—Maze exploration is a field of science that continues to be researched and developed. Various algorithms, techniques, and scenarios result in faster trips and shortest distances. Various international competitions in the maze field are also held to encourage quicker and better labyrinth exploration innovations. Usually, maze exploration uses a mobile robot that moves autonomously in pathfinding to reach the target location. This study aims to generate and test a multi-agent algorithm to find the closest distance to reach a target in an unknown maze. So the question is how multi-agents can work together to reach the target using the shortest possible path. For this reason, a flood fill algorithm usually used for single-agent has been developed into an improved flood fill algorithm that can be applied to multi-agents. The result is an algorithm that can be applied to find targets through unknown maze exploration using multi-agent.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
2.80
自引率
0.00%
发文量
25
期刊介绍: International Journal of Mechanical Engineering and Robotics Research. IJMERR is a scholarly peer-reviewed international scientific journal published bimonthly, focusing on theories, systems, methods, algorithms and applications in mechanical engineering and robotics. It provides a high profile, leading edge forum for academic researchers, industrial professionals, engineers, consultants, managers, educators and policy makers working in the field to contribute and disseminate innovative new work on Mechanical Engineering and Robotics Research.
×
引用
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学术官方微信