Pricing Scheme based Nash Q-learning Flow Control for Multi-user Network
文献类型:会议论文
作者 | Li X(李鑫); Yu HB(于海斌)![]() |
出版日期 | 2011 |
会议名称 | International Conference on Materials, Mechatronics and Automation (ICMMA 2011) |
会议日期 | JAN 15-16, 2011 |
会议地点 | Melbourne, AUSTRALIA |
关键词 | Computer simulation Controllers Costs Flow control HIgh speed networks Mechatronics Quality of service Time varying networks Traffic congestion |
卷号 | 467-469 |
期号 | 0 |
页码 | 847-852 |
通讯作者 | 李鑫 |
中文摘要 | For the congestion problems with multi-user existing in high-speed networks, a pricing scheme based Nash Q-learning flow controller is proposed. It considers a network with a single service provider, and some non-cooperative users. The pricing scheme is introduced to the design of the reward function in the learning process of Q-learning. Because of the uncertainties and highly time-varying, it is not easy to accurately obtain the complete information for high-speed networks. The Nash Q-learning, which is independent of mathematic model, shows particular superiority. It obtains the Nash Q-values through trial-and-error and interaction with the environment to improve its behavior policy. By means of learning process, the proposed controller can learn to take the best actions to regulate source flow with the features of high quality of service. Simulation results show that the proposed controller can promote the performance of the networks and avoid the occurrence of congestion effectively. |
收录类别 | EI ; CPCI(ISTP) |
产权排序 | 1 |
会议录 | Key Engineering Materials
![]() |
会议录出版者 | TRANS TECH PUBLICATIONS LTD |
会议录出版地 | STAFA-ZURICH, Switzerland |
语种 | 英语 |
ISSN号 | 1013-9826 |
WOS记录号 | WOS:000303364700158 |
源URL | [http://ir.sia.cn/handle/173321/7091] ![]() |
专题 | 沈阳自动化研究所_工业信息学研究室 |
推荐引用方式 GB/T 7714 | Li X,Yu HB. Pricing Scheme based Nash Q-learning Flow Control for Multi-user Network[C]. 见:International Conference on Materials, Mechatronics and Automation (ICMMA 2011). Melbourne, AUSTRALIA. JAN 15-16, 2011. |
入库方式: OAI收割
来源:沈阳自动化研究所
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。