A general TD-Q learning control approach for discrete-time Markov jump systems

IF 6.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS ISA transactions Pub Date : 2025-03-06 DOI:10.1016/j.isatra.2025.02.032
Jiwei Wen , Huiwen Xue , Xiaoli Luan , Peng Shi
{"title":"A general TD-Q learning control approach for discrete-time Markov jump systems","authors":"Jiwei Wen ,&nbsp;Huiwen Xue ,&nbsp;Xiaoli Luan ,&nbsp;Peng Shi","doi":"10.1016/j.isatra.2025.02.032","DOIUrl":null,"url":null,"abstract":"<div><div>This paper develops a novel temporal difference Q (TD-Q) learning approach, designed to address the robust control challenge in discrete-time Markov jump systems (MJSs) which are characterized by entirely unknown dynamics and transition probabilities (TPs). The model-free TD-Q learning method is uniquely comprehensive, including two special cases: Q learning for MJSs with unknown dynamics, and TD learning for MJSs with undetermined TPs. We propose an innovative ternary policy iteration framework, which iteratively refines the control policies through a dynamic loop of alternating updates. This loop consists of three synergistic processes: firstly, aligning TD value functions with current policies; secondly, enhancing Q-function’s matrix kernels (QFMKs) using these TD value functions; and thirdly, generating greedy policies based on the enhanced QFMKs. We demonstrate that, with a sufficient number of episodes, the TD value functions, QFMKs, and control policies converge optimally within this iterative loop. To illustrate efficiency of the developed approach, we introduce a numerical example that highlights its substantial benefits through a thorough comparison with current learning control methods for MJSs. Moreover, a structured population dynamics model for pests is utilized to validate the practical applicability.</div></div>","PeriodicalId":14660,"journal":{"name":"ISA transactions","volume":"160 ","pages":"Pages 111-121"},"PeriodicalIF":6.5000,"publicationDate":"2025-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ISA transactions","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0019057825001223","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

This paper develops a novel temporal difference Q (TD-Q) learning approach, designed to address the robust control challenge in discrete-time Markov jump systems (MJSs) which are characterized by entirely unknown dynamics and transition probabilities (TPs). The model-free TD-Q learning method is uniquely comprehensive, including two special cases: Q learning for MJSs with unknown dynamics, and TD learning for MJSs with undetermined TPs. We propose an innovative ternary policy iteration framework, which iteratively refines the control policies through a dynamic loop of alternating updates. This loop consists of three synergistic processes: firstly, aligning TD value functions with current policies; secondly, enhancing Q-function’s matrix kernels (QFMKs) using these TD value functions; and thirdly, generating greedy policies based on the enhanced QFMKs. We demonstrate that, with a sufficient number of episodes, the TD value functions, QFMKs, and control policies converge optimally within this iterative loop. To illustrate efficiency of the developed approach, we introduce a numerical example that highlights its substantial benefits through a thorough comparison with current learning control methods for MJSs. Moreover, a structured population dynamics model for pests is utilized to validate the practical applicability.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
离散时间马尔可夫跳跃系统的一般 TD-Q 学习控制方法。
本文提出了一种新的时域差分Q (TD-Q)学习方法,旨在解决具有完全未知动力学和转移概率(TPs)的离散马尔可夫跳变系统(MJSs)的鲁棒控制挑战。无模型的TD-Q学习方法具有独特的综合性,包括两种特殊情况:动态未知的mjs的Q学习和不确定TPs的mjs的TD学习。我们提出了一种创新的三元策略迭代框架,该框架通过交替更新的动态循环迭代地改进控制策略。该循环包括三个协同过程:首先,将TD值函数与当前政策对齐;其次,利用这些TD值函数增强q函数的矩阵核;第三,基于增强的qfmk生成贪婪策略。我们证明,有足够数量的插曲,TD值函数、qfmk和控制策略在这个迭代循环中最优收敛。为了说明所开发方法的效率,我们介绍了一个数值例子,通过与当前mjs学习控制方法的全面比较,突出了其实质性的好处。此外,利用结构化的害虫种群动态模型验证了该模型的实用性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
ISA transactions
ISA transactions 工程技术-工程:综合
CiteScore
11.70
自引率
12.30%
发文量
824
审稿时长
4.4 months
期刊介绍: ISA Transactions serves as a platform for showcasing advancements in measurement and automation, catering to both industrial practitioners and applied researchers. It covers a wide array of topics within measurement, including sensors, signal processing, data analysis, and fault detection, supported by techniques such as artificial intelligence and communication systems. Automation topics encompass control strategies, modelling, system reliability, and maintenance, alongside optimization and human-machine interaction. The journal targets research and development professionals in control systems, process instrumentation, and automation from academia and industry.
期刊最新文献
Editorial Board FGO-Tuned 2-DOF PI controller for pressure regulation in centrifugal fans driven by induction motors using an experimentally validated model Handling ramp inputs and nonlinearity in unstable systems with fractional order modified Smith predictor control Dynamic-gain neural network observer based prescribed performance backstepping sliding mode control of uncertain nonlinear systems Self-triggered adaptive dynamic programming based on experience-replay and spectral adaptive law
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1