HiQ: a hierarchical Q-learning algorithm to solve the reader collision problem

Junius Ho, D. Engels, S. Sarma
{"title":"HiQ: a hierarchical Q-learning algorithm to solve the reader collision problem","authors":"Junius Ho, D. Engels, S. Sarma","doi":"10.1109/SAINT-W.2006.20","DOIUrl":null,"url":null,"abstract":"HiQ is a hierarchical, online learning algorithm that finds dynamic solutions to the reader collision problem in RFID systems. When the transmissions from one reader interfere with the operation of another reader, a reader collision occurs. The objective of the reader collision problem is to minimize the reader collisions experienced by RFID readers while using the minimum number of frequencies and using the minimum total time for all readers to communicate successfully. HiQ attempts to minimize reader collisions by learning the collision patterns of the readers and by effectively assigning frequencies over time to ensure neighboring readers do not experience collisions from one another. HiQ is arranged hierarchically with distributed, local control. The algorithm is based on a type of reinforcement learning called Q-learning, which is used to determine frequency and time assignments. Through repeated interaction with the system, Q-learning attempts to discover an optimum frequency assignment over time. We show that HiQ finds optimal or near optimal solutions to the reader collision problem.","PeriodicalId":297153,"journal":{"name":"International Symposium on Applications and the Internet Workshops (SAINTW'06)","volume":"60 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"159","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Symposium on Applications and the Internet Workshops (SAINTW'06)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SAINT-W.2006.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 159

Abstract

HiQ is a hierarchical, online learning algorithm that finds dynamic solutions to the reader collision problem in RFID systems. When the transmissions from one reader interfere with the operation of another reader, a reader collision occurs. The objective of the reader collision problem is to minimize the reader collisions experienced by RFID readers while using the minimum number of frequencies and using the minimum total time for all readers to communicate successfully. HiQ attempts to minimize reader collisions by learning the collision patterns of the readers and by effectively assigning frequencies over time to ensure neighboring readers do not experience collisions from one another. HiQ is arranged hierarchically with distributed, local control. The algorithm is based on a type of reinforcement learning called Q-learning, which is used to determine frequency and time assignments. Through repeated interaction with the system, Q-learning attempts to discover an optimum frequency assignment over time. We show that HiQ finds optimal or near optimal solutions to the reader collision problem.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
HiQ:解决阅读器碰撞问题的分层q学习算法
HiQ是一种分层的在线学习算法,用于寻找RFID系统中读写器碰撞问题的动态解决方案。当一个读取器的传输干扰另一个读取器的操作时,就会发生读取器碰撞。阅读器碰撞问题的目标是使RFID阅读器在使用最少的频率数和使用最少的总时间使所有阅读器成功通信的情况下,最大限度地减少阅读器碰撞。HiQ试图通过学习读取器的碰撞模式和有效地分配频率以确保相邻的读取器不会相互碰撞来最小化读取器碰撞。HiQ采用分布式、局部控制的分层结构。该算法基于一种称为Q-learning的强化学习,用于确定频率和时间分配。通过与系统的反复交互,Q-learning试图发现一个最佳的频率分配。我们表明,HiQ找到最优或接近最优的解决方案,阅读器碰撞问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A distributed and cooperative load balancing mechanism for large-scale P2P systems The /spl mu/Jini proxy architecture for impromptu mobile services Design and implementation of an active RFID system platform MapWiki: a ubiquitous collaboration environment on shared maps Context-aware, ontology-based recommendations
×
引用
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