Initial Excitation‐Based Inverse Reinforcement Learning for Continuous‐Time Linear Non‐Zero‐Sum Games

ABSTRACT In this article, the initial excitation‐based inverse reinforcement learning methods are presented for continuous‐time linear non‐zero‐sum games. The policy iteration and value iteration algorithms are presented for the inverse reinforcement learning problems, and an online‐verifiable initial excitation condition is given to guarantee the convergence of the presented algorithms. Comparing with the traditional inverse reinforcement learning algorithms for linear non‐zero‐sum games, the presented algorithms relax the requirement on data‐storage mechanism. Furthermore, the requirement on the initial stabilizing state feedback matrices is relaxed in the presented initial excitation‐based value iteration algorithm. The properties of the presented initial excitation‐based policy iteration and value iteration algorithms are analyzed. Simulation results show the efficiency of the presented algorithms.

Authors

Institutions

Publication Details

Journal
International Journal of Robust and Nonlinear Control
Published
2025-05-26
DOI
https://doi.org/10.1002/rnc.8026
Primary Topic
Adaptive Dynamic Programming Control
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Initial Excitation‐Based Inverse Reinforcement Learning for Continuous‐Time Linear Non‐Zero‐Sum Games

Gansu Zhang, Qinglai Wei, Hongyang Li
International Journal of Robust and Nonlinear Control
Adaptive Dynamic Programming Control
article

Initial Excitation‐Based Inverse Reinforcement Learning for Continuous‐Time Linear Non‐Zero‐Sum Games

Gansu Zhang, Qinglai Wei, Hongyang Li
article en

Abstract

ABSTRACT In this article, the initial excitation‐based inverse reinforcement learning methods are presented for continuous‐time linear non‐zero‐sum games. The policy iteration and value iteration algorithms are presented for the inverse reinforcement learning problems, and an online‐verifiable initial excitation condition is given to guarantee the convergence of the presented algorithms. Comparing with the traditional inverse reinforcement learning algorithms for linear non‐zero‐sum games, the presented algorithms relax the requirement on data‐storage mechanism. Furthermore, the requirement on the initial stabilizing state feedback matrices is relaxed in the presented initial excitation‐based value iteration algorithm. The properties of the presented initial excitation‐based policy iteration and value iteration algorithms are analyzed. Simulation results show the efficiency of the presented algorithms.

International Journal of Robust and Nonlinear ControlVol. 35(15)
Macau University of Science and Technology (MO), Chinese Academy of Sciences (CN), China University of Mining and Technology (CN), Beijing Academy of Artificial Intelligence (CN), Institute of Automation (CN), University of Chinese Academy of Sciences (CN)
National Natural Science Foundation of China, Beijing Municipal Natural Science Foundation
Openalex Percentile: Top 87%
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.

Initial Excitation‐Based Inverse Reinforcement Learning for Continuous‐Time Linear Non‐Zero‐Sum Games — Gansu Zhang, Qinglai Wei, et al. · International Journal of Robust and Nonlinear Control (2025) | TGRS Research Map | TGRS