AntNet with Reward-Penalty Reinforcement Learning

Pooia Lalbakhsh, Bahram Zaeri, A. Lalbakhsh, M. Fesharaki
{"title":"AntNet with Reward-Penalty Reinforcement Learning","authors":"Pooia Lalbakhsh, Bahram Zaeri, A. Lalbakhsh, M. Fesharaki","doi":"10.1109/CICSyN.2010.11","DOIUrl":null,"url":null,"abstract":"The paper deals with a modification in the learning phase of AntNet routing algorithm, which improves the system adaptability in the presence of undesirable events. Unlike most of the ACO algorithms which consider reward-inaction reinforcement learning, the proposed strategy considers both reward and penalty onto the action probabilities. As simulation results show, considering penalty in AntNet routing algorithm increases the exploration towards other possible and sometimes much optimal selections, which leads to a more adaptive strategy. The proposed algorithm also uses a self-monitoring solution called Occurrence-Detection, to sense traffic fluctuations and make decision about the level of undesirability of the current status. The proposed algorithm makes use of the two mentioned strategies to prepare a self-healing version of AntNet routing algorithm to face undesirable and unpredictable traffic conditions.","PeriodicalId":358023,"journal":{"name":"2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Computational Intelligence, Communication Systems and Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CICSyN.2010.11","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

The paper deals with a modification in the learning phase of AntNet routing algorithm, which improves the system adaptability in the presence of undesirable events. Unlike most of the ACO algorithms which consider reward-inaction reinforcement learning, the proposed strategy considers both reward and penalty onto the action probabilities. As simulation results show, considering penalty in AntNet routing algorithm increases the exploration towards other possible and sometimes much optimal selections, which leads to a more adaptive strategy. The proposed algorithm also uses a self-monitoring solution called Occurrence-Detection, to sense traffic fluctuations and make decision about the level of undesirability of the current status. The proposed algorithm makes use of the two mentioned strategies to prepare a self-healing version of AntNet routing algorithm to face undesirable and unpredictable traffic conditions.
奖励-惩罚强化学习的蚁网
本文对蚁网路由算法的学习阶段进行了改进,提高了系统在出现不良事件时的适应性。与大多数考虑奖励-不作为强化学习的蚁群算法不同,该策略同时考虑了行动概率的奖励和惩罚。仿真结果表明,考虑惩罚的蚁网路由算法增加了对其他可能的、有时甚至更多的最优选择的探索,从而产生了更强的自适应策略。所提出的算法还使用一种称为“发生检测”的自我监测解决方案来感知交通波动,并对当前状态的不受欢迎程度做出决定。该算法利用上述两种策略准备了一种自愈版本的AntNet路由算法,以面对不希望和不可预测的流量状况。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信