Reinforcement learning in swarm-robotics for multi-agent foraging-task domain

Y. M, P. S G, Kanagaraj G
{"title":"Reinforcement learning in swarm-robotics for multi-agent foraging-task domain","authors":"Y. M, P. S G, Kanagaraj G","doi":"10.1109/SIS.2013.6615154","DOIUrl":null,"url":null,"abstract":"The main focus of this paper is to study and develop an efficient learning policy to address the exploration vs. exploitation dilemma in a multi-objective foraging task in swarm robotics domain. An efficient learning policy called FIFO-list is proposed to tackle the above mentioned problem. The proposed FIFO-list is a model-based learning policy which can attain near-optimal solutions. In FIFO-list, the swarm robots maintains a dynamic list of recently visited states. States that are included in the list are banned from exploration by the swarm robots regardless of the Q(s, a) values associated with those states. The FIFO list is updated based on First-In-First-Out (FIFO) rule, meaning the states that enters the list first will exit the list first. The recently visited states will remain in the list for a dynamic number of time-steps which is determined by the desirability of the visited states.","PeriodicalId":444765,"journal":{"name":"2013 IEEE Symposium on Swarm Intelligence (SIS)","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE Symposium on Swarm Intelligence (SIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIS.2013.6615154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

The main focus of this paper is to study and develop an efficient learning policy to address the exploration vs. exploitation dilemma in a multi-objective foraging task in swarm robotics domain. An efficient learning policy called FIFO-list is proposed to tackle the above mentioned problem. The proposed FIFO-list is a model-based learning policy which can attain near-optimal solutions. In FIFO-list, the swarm robots maintains a dynamic list of recently visited states. States that are included in the list are banned from exploration by the swarm robots regardless of the Q(s, a) values associated with those states. The FIFO list is updated based on First-In-First-Out (FIFO) rule, meaning the states that enters the list first will exit the list first. The recently visited states will remain in the list for a dynamic number of time-steps which is determined by the desirability of the visited states.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多智能体觅食任务领域的群体机器人强化学习
本文的重点是研究和开发一种有效的学习策略,以解决群体机器人领域中多目标觅食任务中的探索与利用困境。针对上述问题,提出了一种高效的FIFO-list学习策略。所提出的fifo列表是一种基于模型的学习策略,可以获得近似最优解。在FIFO-list中,群体机器人保持最近访问状态的动态列表。无论与这些状态相关的Q(s, a)值如何,被列入列表的状态都被禁止进行群机器人的探索。FIFO列表是根据先进先出(FIFO)规则更新的,这意味着首先进入列表的状态将首先退出列表。最近访问过的国家将在一段动态时间内保留在名单中,这取决于访问过的国家的意愿。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of stagnation behavior of vector evaluated particle swarm optimization Reinforcement learning in swarm-robotics for multi-agent foraging-task domain A novel ACO algorithm for dynamic binary chains based on changes in the system's stability Cooperative particle swarm optimization in dynamic environments Joint energy and spinning reserve dispatch in wind-thermal power system using IDE-SAR technique
×
引用
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