IEEE/CAA Journal of Automatica Sinica
Citation: | C. Qian and L. Ding, “Prescribed-time fully distributed Nash equilibrium seeking strategy in networked games,” IEEE/CAA J. Autom. Sinica, vol. 11, no. 1, pp. 261–263, Jan. 2024. doi: 10.1109/JAS.2023.123933 |
[1] |
J. Guo and I. Harmati, “Evaluating semi-cooperative Nash/Stackelberg Q-learning for traffic routes plan in a single intersection,” Control Engineering Practice, vol. 102, p. 104525, 2020. doi: 10.1016/j.conengprac.2020.104525
|
[2] |
A. Deligiannis, A. Panoui, S. Lambotharan, and J. A. Chambers, “Game-theoretic power allocation and the Nash equilibrium analysis for a multistatic MIMO radar network,” IEEE Trans. Signal Processing, vol. 65, no. 24, pp. 6397–6408, 2017. doi: 10.1109/TSP.2017.2755591
|
[3] |
M. Ye, Q.-L. Han, L. Ding, and S. Xu, “Distributed Nash equilibrium seeking in games with partial decision information: A survey,” Proc. the IEEE, vol. 111, no. 2, pp. 140–157, 2023. doi: 10.1109/JPROC.2023.3234687
|
[4] |
M. Ye and G. Hu, “Distributed Nash equilibrium seeking by a consensus based approach,” IEEE Trans. Automatic Control, vol. 62, no. 9, pp. 4811–4818, 2017. doi: 10.1109/TAC.2017.2688452
|
[5] |
M. Ye, “Distributed Nash equilibrium seeking for games in systems with bounded control inputs,” IEEE Trans. Automatic Control, vol. 66, no. 8, pp. 3833–3839, 2020.
|
[6] |
X. Zeng, J. Chen, S. Liang, and Y. Hong, “Generalized Nash equilibrium seeking strategy for distributed nonsmooth multi-cluster game,” Automatica, vol. 103, pp. 20–26, 2019. doi: 10.1016/j.automatica.2019.01.025
|
[7] |
M. Ye, D. Li, Q.-L. Han, and L. Ding, “Distributed Nash equilibrium seeking for general networked games with bounded disturbances,” IEEE/CAA J. Autom. Sinica, vol. 99, pp. 1–12, 2022.
|
[8] |
L. Ding, J. Li, M. Ye, and Y. Zhao, “Fully distributed resilient cooperative control of vehicular platoon systems under DoS attacks,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 5, pp. 937–940, 2022. doi: 10.1109/JAS.2022.105578
|
[9] |
M. Ye and G. Hu, “Adaptive approaches for fully distributed Nash equilibrium seeking in networked games,” Automatica, vol. 129, p. 109661, 2021. doi: 10.1016/j.automatica.2021.109661
|
[10] |
M. Ye, Q.-L. Han, L. Ding, and S. Xu, “Fully distributed Nash equilibrium seeking for high-order players with actuator limitations,” IEEE/CAA J. Autom. Sinica, vol. 10, no. 6, pp. 1434–1444, 2023. doi: 10.1109/JAS.2022.105983
|
[11] |
B. Ning, Q.-L. Han, Z. Zuo, L. Ding, Q. Lu, and X. Ge, “Fixedtime and prescribed-time consensus control of multiagent systems and its applications: A survey of recent trends and methodologies,” IEEE Trans. Industrial Informatics, vol. 19, no. 2, pp. 1121–1135, 2022.
|
[12] |
Q. Tao, Y. Liu, C. Xian, and Y. Zhao, “Prescribed-time distributed time-varying Nash equilibrium seeking for formation placement control,” IEEE Trans. Circuits and Systems Ⅱ: Express Briefs, vol. 69, no. 11, pp. 4423–4427, 2022. doi: 10.1109/TCSII.2022.3179576
|
[13] |
Y. Zhao, Q. Tao, C. Xian, Z. Li, and Z. Duan, “Prescribed-time distributed Nash equilibrium seeking for noncooperation games,” Automatica, vol. 151, p. 110933, 2023. doi: 10.1016/j.automatica.2023.110933
|
[14] |
X. Ge, Q.-L. Han, Q. Wu, and X.-M. Zhang, “Resilient and safe platooning control of connected automated vehicles against intermittent denial-of-service attacks,” IEEE/CAA J. Autom. Sinica, vol. 10, no. 5, pp. 1234–1251, 2023. doi: 10.1109/JAS.2022.105845
|
[15] |
X. Ge, S. Xiao, Q.-L. Han, X.-M. Zhang, and D. Ding, “Dynamic event-triggered scheduling and platooning control co-design for automated vehicles over vehicular ad-hoc networks,” IEEE/CAA J. Autom. Sinica, vol. 9, no. 1, pp. 31–46, 2022. doi: 10.1109/JAS.2021.1004060
|