Pheromone averaging exploration algorithm

Bogdan-Florin Florea, O. Grigore, M. Datcu
{"title":"Pheromone averaging exploration algorithm","authors":"Bogdan-Florin Florea, O. Grigore, M. Datcu","doi":"10.1109/ICAR.2015.7251520","DOIUrl":null,"url":null,"abstract":"In this paper we introduce a novel spatial exploration and coverage algorithm based on reflex agents using a pheromone map as storage and communication medium. The algorithm proposed in this paper outperforms many of the popular reflex agent exploration algorithms in terms of exploration performance measured as the cumulative path length.","PeriodicalId":432004,"journal":{"name":"2015 International Conference on Advanced Robotics (ICAR)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Advanced Robotics (ICAR)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAR.2015.7251520","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

In this paper we introduce a novel spatial exploration and coverage algorithm based on reflex agents using a pheromone map as storage and communication medium. The algorithm proposed in this paper outperforms many of the popular reflex agent exploration algorithms in terms of exploration performance measured as the cumulative path length.
信息素平均探索算法
本文提出了一种基于反射因子的空间探测和覆盖算法,该算法以信息素地图为存储和通信媒介。本文提出的算法在以累积路径长度衡量的勘探性能方面优于许多流行的反射体勘探算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信