Fast finite-time adaptive optimal algorithm for stochastic multiagent systems under deception attacks and time-varying output constraints
An adaptive optimal neural network algorithm with fast finite-time convergence is proposed for stochastic multiagent systems (SMASs) under deception attacks, time-varying asymmetric output constraints and dead zones. An additional attack signal corrupts the state information of nonlinear systems, resulting in the unavailability of real state information for controller development. To overcome this obstacle, a reinforcement learning (RL)-based identifier-actor-critic-disturbance architecture is used to develop a fast finite-time adaptive optimal tracking algorithm for each subsystem in SMASs, which alleviates the negative effects of cyberattacks that intentionally tamper with sensor signals. Herein, a barrier function is designed to transform the constrained system into an unconstrained equivalent. Furthermore, time-varying dead zones in SMASs pose considerable challenges for controller design, while enhancing the applicability of the system in practical scenarios. The proposed resilient adaptive optimal tracking algorithm guarantees the boundedness of all signals in the overall system in probability. Eventually, two simulation results are conducted to prove the effectiveness of the proposed method.
Authors
- Junsheng Zhao (ORCID: https://orcid.org/0000-0002-8182-0961)
- Zong‐Yao Sun (ORCID: https://orcid.org/0000-0002-2102-9588)
- Xin Zhang (ORCID: https://orcid.org/0009-0001-5770-0652)
- Chaoxu Mu
Institutions
- Tianjin University (CN)
- Liaocheng University (CN)
- Qufu Normal University (CN)
Publication Details
- Journal
- Applied Mathematics and Computation
- Published
- 2026-09-17
- DOI
- https://doi.org/10.1016/j.amc.2026.130314
- Primary Topic
- Adaptive Dynamic Programming Control
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Natural Science Foundation of Shandong Province