Cluster Synchronization for Discrete-Time Zero-Sum Graphical Games with Unknown Constrained-Input Systems | ||
| Journal of Modeling and Simulation in Electrical and Electronics Engineering | ||
| دوره 4، شماره 1 - شماره پیاپی 15، تابستان 2024، صفحه 9-18 اصل مقاله (1.1 M) | ||
| نوع مقاله: Research Article | ||
| شناسه دیجیتال (DOI): 10.22075/mseee.2025.33849.1155 | ||
| نویسندگان | ||
| Zahra Jahan1؛ Abbas Dideban* 1؛ Farzaneh Abdollahi2 | ||
| 1Electrical Engineering Department, Semnan University, Semnan, Iran. | ||
| 2Electrical Engineering Department, Amirkabir University, Tehran, Iran. | ||
| چکیده | ||
| This paper addresses the synchronization issue of agents with their respective leaders in each cluster for unknown discrete-time zero-sum graphical games with constrained input. To solve the coupled Hamilton-Jacobi-Isaacs equations under the assumption of unknown dynamics, an adaptive optimal distributed technique based on value iteration heuristic dynamic programming is proposed. An actor-critic framework is employed to approximate the value functions, control policies, and worst-case disturbance policies necessary for implementing the proposed method. Additionally, neural network identifiers are utilized to determine each agent's unknown dynamics. To prevent system instability, a constraint on control inputs is incorporated into the design method. By considering disturbances in the dynamics, the proposed solutions are made robust against unpredictable events, enhancing performance and stability. Furthermore, the closed-loop system's stability is proven. Finally, the theoretical results are validated through simulation outcomes. | ||
| کلیدواژهها | ||
| Cluster synchronization؛ Discrete-time graphical zero-sum games؛ External disturbances؛ Input constraint؛ Neural network؛ Reinforcement learning؛ Unknown dynamics | ||
| مراجع | ||
|
| ||
|
آمار تعداد مشاهده مقاله: 292 تعداد دریافت فایل اصل مقاله: 328 |
||
| تعداد نشریات | 22 |
| تعداد شمارهها | 724 |
| تعداد مقالات | 10,452 |
| تعداد مشاهده مقاله | 73,359,531 |
| تعداد دریافت فایل اصل مقاله | 64,717,091 |