Learning-Based Parallel Control for Unknown Nonaffine Nonzero-Sum Games

In this paper, a novel nonzero-sum game (NSG) method is developed for completely unknown nonaffine nonlinear discrete-time (DT) systems, which is referred to as model-free NSG (MNSG). First, novel dynamic control laws are developed for NSGs using parallel control, namely introducing controls into feedback. Subsequently, an augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG is formulated according to the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG to derive the dynamic control laws. Furthermore, we show that the control stabilities of the original and augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSGs are equivalent. In the meantime, we prove that optimal control of the augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG is equivalent to near-optimal control of the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG, and the Nash equilibrium of the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG can be achieved. Then, a model-free learning scheme is developed to obtain the solution of the augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG using online policy iteration, and neither using a model network to predict unknown dynamics nor off-policy reinforcement learning (RL) is needed in the scheme. Lastly, numerical analysis, including the NSG of a DT system with unknown control-nonaffine dynamics and coupled controls, confirms the correctness of our MNSG method. The associated code is available at: https://github.com/lujingweihh/Adaptive-dynamic-programming-algorithms/tree/main/model_free_nonzero_sum_games_discrete_time.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Automation Science and Engineering
Published
2025-01-01
DOI
https://doi.org/10.1109/tase.2025.3593929
Citations
2
Primary Topic
Advanced Control Systems Optimization
Type
article
Field-Weighted Citation Impact
2.43

Funders

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

Learning-Based Parallel Control for Unknown Nonaffine Nonzero-Sum Games

Lefei Li, Jingwei Lu, Qinglai Wei
2 citations
IEEE Transactions on Automation Science and Engineering
Advanced Control Systems Optimization
2.43
article

Learning-Based Parallel Control for Unknown Nonaffine Nonzero-Sum Games

Lefei Li, Jingwei Lu, Qinglai Wei
article en
2 citations

Abstract

In this paper, a novel nonzero-sum game (NSG) method is developed for completely unknown nonaffine nonlinear discrete-time (DT) systems, which is referred to as model-free NSG (MNSG). First, novel dynamic control laws are developed for NSGs using parallel control, namely introducing controls into feedback. Subsequently, an augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG is formulated according to the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG to derive the dynamic control laws. Furthermore, we show that the control stabilities of the original and augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSGs are equivalent. In the meantime, we prove that optimal control of the augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG is equivalent to near-optimal control of the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG, and the Nash equilibrium of the original <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG can be achieved. Then, a model-free learning scheme is developed to obtain the solution of the augmented <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">N</i>-player NSG using online policy iteration, and neither using a model network to predict unknown dynamics nor off-policy reinforcement learning (RL) is needed in the scheme. Lastly, numerical analysis, including the NSG of a DT system with unknown control-nonaffine dynamics and coupled controls, confirms the correctness of our MNSG method. The associated code is available at: https://github.com/lujingweihh/Adaptive-dynamic-programming-algorithms/tree/main/model_free_nonzero_sum_games_discrete_time.

IEEE Transactions on Automation Science and EngineeringVol. 22
Chinese Academy of Sciences (CN), Institute of Automation (CN), Tsinghua University (CN)
China Postdoctoral Science Foundation
Zero hunger
Openalex Percentile: Top 10%
Advanced Control Systems Optimization
2.43
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.