A New Exploration Method Based on Multi-layer Evidence Grid Map (MLEGM) and Improved A* Algorithm for Mobile Robots

E. Esmaeili, V. Azizi, S. Samizadeh, Sajjad Ziyadloo, M. Meybodi
{"title":"A New Exploration Method Based on Multi-layer Evidence Grid Map (MLEGM) and Improved A* Algorithm for Mobile Robots","authors":"E. Esmaeili, V. Azizi, S. Samizadeh, Sajjad Ziyadloo, M. Meybodi","doi":"10.1109/ICTAI.2012.134","DOIUrl":null,"url":null,"abstract":"An efficient exploration of unknown environments is a fundamental problem in mobile robots. This paper proposes a new exploration method, in this method each specific area in environment is considered as a cell that these cells are represented by 3 abstract layers. The value of each cell in first layer is calculated by range finder's free beams. In other layers, the value of each cell is calculated by visual information, the information is received by other sensors' data and image processing that used in potential filed algorithm. We merge the value of these layers to have a single meaning value. We can use this value in many purposes e.g. finding optimal path for exploration or using this value as reward for learning methods. Then it mixed with a new improved version of A* algorithm that introduces for first time to find optimal path in unknown areas. This method implemented in official simulator of Virtual Robots League in Robocop competitions and compared with random search method. The simulation result of this method covers more unknown area compared to last methods.","PeriodicalId":155588,"journal":{"name":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE 24th International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICTAI.2012.134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

An efficient exploration of unknown environments is a fundamental problem in mobile robots. This paper proposes a new exploration method, in this method each specific area in environment is considered as a cell that these cells are represented by 3 abstract layers. The value of each cell in first layer is calculated by range finder's free beams. In other layers, the value of each cell is calculated by visual information, the information is received by other sensors' data and image processing that used in potential filed algorithm. We merge the value of these layers to have a single meaning value. We can use this value in many purposes e.g. finding optimal path for exploration or using this value as reward for learning methods. Then it mixed with a new improved version of A* algorithm that introduces for first time to find optimal path in unknown areas. This method implemented in official simulator of Virtual Robots League in Robocop competitions and compared with random search method. The simulation result of this method covers more unknown area compared to last methods.
基于多层证据网格图(MLEGM)和改进A*算法的移动机器人探索新方法
对未知环境的有效探索是移动机器人的一个基本问题。本文提出了一种新的勘探方法,该方法将环境中的每个特定区域视为一个单元,这些单元由3个抽象层表示。第一层每个单元的值由测距仪的自由波束计算。在其他层中,通过视觉信息计算每个单元的值,这些信息被其他传感器的数据和图像处理所接收,并用于势场算法。我们将这些层的值合并为一个有意义的值。我们可以在许多用途中使用这个值,例如寻找探索的最佳路径或使用这个值作为学习方法的奖励。然后混合了一种新的改进的a *算法,首次引入了在未知区域寻找最优路径的方法。该方法在虚拟机器人联盟官方模拟器中实现,并与随机搜索法进行了比较。与以往的方法相比,该方法的仿真结果覆盖了更多的未知区域。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信