Model-Free H∞ Control for Markov Jump Stochastic Systems with Mean-Field Terms Using On-Policy and Off-Policy Algorithms

This paper presents on-policy and off-policy algorithms for the H∞ control of continuous-time mean-field stochastic Markov jump systems. Using online state and input data, these algorithms can learn control and disturbance strategies without the need for prior knowledge of system matrices. Under the standard assumptions that the system is mean-square stabilizable and detectable, we rigorously prove the monotonicity, boundedness, and convergence of the proposed iterative algorithms to obtain the unique stabilizing solution of cross-coupled generalized algebraic Riccati equations. Moreover, the off-policy algorithm features high data efficiency because the collected data can be utilized again after each iteration. Numerical simulations demonstrate the effectiveness of two algorithms and explicitly show that the off-policy algorithm achieves a faster convergence rate compared to its on-policy counterpart.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-04-30
DOI
https://doi.org/10.3390/math14091514
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Model-Free H∞ Control for Markov Jump Stochastic Systems with Mean-Field Terms Using On-Policy and Off-Policy Algorithms

X WANG, Yaning Lin
Mathematics
Adaptive Dynamic Programming Control
article

Model-Free H∞ Control for Markov Jump Stochastic Systems with Mean-Field Terms Using On-Policy and Off-Policy Algorithms

X WANG, Yaning Lin
article en

Abstract

This paper presents on-policy and off-policy algorithms for the H∞ control of continuous-time mean-field stochastic Markov jump systems. Using online state and input data, these algorithms can learn control and disturbance strategies without the need for prior knowledge of system matrices. Under the standard assumptions that the system is mean-square stabilizable and detectable, we rigorously prove the monotonicity, boundedness, and convergence of the proposed iterative algorithms to obtain the unique stabilizing solution of cross-coupled generalized algebraic Riccati equations. Moreover, the off-policy algorithm features high data efficiency because the collected data can be utilized again after each iteration. Numerical simulations demonstrate the effectiveness of two algorithms and explicitly show that the off-policy algorithm achieves a faster convergence rate compared to its on-policy counterpart.

MathematicsVol. 14(9)
Shandong University of Technology (CN)
Peace, Justice and strong institutions
Openalex Percentile: Top 6%
Adaptive Dynamic Programming Control
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.