arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.14339eess.SYcs.SY
收藏

基于积分强化学习的异质群体数据驱动网络LQG均场博弈

Data-Driven Network LQG Mean Field Games with Heterogeneous Populations via Integral Reinforcement Learning

Polytechnique Montréal(蒙特利尔理工学院);GERAD;Department of Electrical Engineering, Polytechnique Montréal(蒙特利尔理工学院电气工程系)

Jean Zhu, Shuang Gao

AI总结:

本文提出一种基于积分强化学习的数据驱动方法,用于解决具有网络耦合异质群体的无限时间线性二次高斯均场博弈问题,无需群体动力学参数即可生成收敛的策略。

摘要:

本文建立了针对具有网络耦合异质群体的无限时间线性二次高斯均场博弈(MFG)的数据驱动解法,其中群体成员的动力学未知。该解法依赖于积分强化学习和Kleinman迭代法来求解代数Riccati方程(ARE)。所得到的算法利用轨迹数据为群体生成网络耦合的MFG策略,并且不需要群体动力学参数。在持续激励和技术条件以及对应AREs存在唯一稳定解的条件下,学习到的网络耦合MFG策略被证明会收敛到其真实值。

英文摘要:

This paper establishes a data-driven solution for infinite horizon linear quadratic Gaussian Mean Field Games with network-coupled heterogeneous agent populations where the dynamics of the agents are unknown. The solution technique relies on Integral Reinforcement Learning and Kleinman's iteration for solving algebraic Riccati equations (ARE). The resulting algorithm uses trajectory data to generate network-coupled MFG strategies for agents and does not require parameters of agents' dynamics. Under technical conditions on the persistency of excitation and on the existence of unique stabilizing solution to the corresponding AREs, the learned network-coupled MFG strategies are shown to converge to their true values.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑