Robust Nash Strategy for Uncertain Delay Systems with LSTM and Its Application for TCP/AQM Congestion Control

H. Mukaidani, Ramasamy Saravanakumar, Hua Xu, M. Sagara
{"title":"Robust Nash Strategy for Uncertain Delay Systems with LSTM and Its Application for TCP/AQM Congestion Control","authors":"H. Mukaidani, Ramasamy Saravanakumar, Hua Xu, M. Sagara","doi":"10.23919/SICE.2019.8859817","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a robust Nash strategy for a class of uncertain delay systems (UDSs) via static output feedback (SOF) with additive gain variation based on long short-term memory (LSTM), which is known as one of the recurrent neural networks. After establishing the extended bounded real lemma for UDS, the conditions for the existence of a robust Nash strategy set are determined by means of matrix inequalities. It is shown that input delay can be compensated because the LSTM has the powerful capability of learning past state information. It should be noted that the proposed LSTM can be worked as the additive gain variation and the stability for the closed-loop UDS is guaranteed. In order to solve the SOF problem, an heuristic algorithm is developed based on the algebraic equations and the linear matrix inequalities (LMIs). In particular, it is shown that robust convergence is guaranteed under a new convergence condition. Finally, a practical numerical example based on the congestion control for active queue management is provided to demonstrate the reliability and usefulness of the proposed design scheme.","PeriodicalId":147772,"journal":{"name":"2019 58th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 58th Annual Conference of the Society of Instrument and Control Engineers of Japan (SICE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/SICE.2019.8859817","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we propose a robust Nash strategy for a class of uncertain delay systems (UDSs) via static output feedback (SOF) with additive gain variation based on long short-term memory (LSTM), which is known as one of the recurrent neural networks. After establishing the extended bounded real lemma for UDS, the conditions for the existence of a robust Nash strategy set are determined by means of matrix inequalities. It is shown that input delay can be compensated because the LSTM has the powerful capability of learning past state information. It should be noted that the proposed LSTM can be worked as the additive gain variation and the stability for the closed-loop UDS is guaranteed. In order to solve the SOF problem, an heuristic algorithm is developed based on the algebraic equations and the linear matrix inequalities (LMIs). In particular, it is shown that robust convergence is guaranteed under a new convergence condition. Finally, a practical numerical example based on the congestion control for active queue management is provided to demonstrate the reliability and usefulness of the proposed design scheme.
基于LSTM的不确定延迟系统鲁棒纳什策略及其在TCP/AQM拥塞控制中的应用
针对一类不确定延迟系统(UDSs),提出了一种基于长短期记忆(LSTM)的具有加性增益变化的静态输出反馈(SOF)鲁棒纳什策略,该策略被称为递归神经网络之一。在建立了UDS的扩展有界实引理后,利用矩阵不等式确定了鲁棒纳什策略集存在的条件。由于LSTM具有强大的学习过去状态信息的能力,因此可以补偿输入延迟。需要注意的是,所提出的LSTM可以作为加性增益变化,保证了闭环UDS的稳定性。为了求解sofc问题,提出了一种基于代数方程和线性矩阵不等式的启发式算法。特别地,在新的收敛条件下,证明了算法的鲁棒收敛性。最后,给出了一个基于拥塞控制的主动队列管理实例,验证了所提设计方案的可靠性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信