The results show that the fast subsystem converges rapidly to the instantaneous stochastic gradient estimates, while the slow subsystem achieves practically fixed-time consensus (Pfxc) in probability and asymptotically bounded tracks the time-varying optimal trajectory.
Abstract
This paper investigates the distributed time-varying optimization of stochastic multi-agent systems (SMASs) using only zero-order information. Unlike existing methods that directly couple gradient estimation and optimization updates on a single time scale, this paper constructs a novel stochastic singular perturbation framework by introducing auxiliary fast systems. The proposed scheme naturally forms a slow-fast coupling structure: by introducing auxiliary variables and constructing fast subsystems to generate smooth gradient estimates, while the agent's state evolution, as the slow subsystem, performs distributed optimization and consensus. The convergence of the proposed scheme is analyzed using stochastic singular perturbation techniques and stochastic Lyapunov theory. The results show that the fast subsystem converges rapidly to the instantaneous stochastic gradient estimates, while the slow subsystem achieves practically fixed-time consensus (Pfxc) in probability and asymptotically bounded tracks the time-varying optimal trajectory. Furthermore, this paper establishes explicit bounds to characterize the effects of parameters, stochastic disturbances, and the properties of the objective function on tracking performance. Finally, the theoretical results are validated through numerical simulations.
This paper develops a selective enhanced high-order SILC, in which historical tracking errors are treated as candidate learning data and are admitted only through a performance-driven probabilistic test, and the asymptotic convergence of the proposed method is proved.
Kun-Hong Chen, Zeyi Zhang, Yu-Jin Cai et al.· ISA transactions· 0 citations
Many real-world processes exhibit long-range dependence, where the current state depends on a slowly decaying trace of past states rather than on the most recent state alone. This paper studies system identification for discrete-time fractional-order linear time-invariant systems from a single observed trajectory of le...
Xiao-Le Zhang, Zi-Yi Zhang, Ze-Hao Zhao et al.· 0 citations
This paper investigates the distributed state estimation problem of a class of multi-agent systems with random transmission delay by designing a Kalman-like recursive optimal distributed filter and an optimal parameter selection scheme for the scalar parameters introduced by the matrix inequality.
Teng Ma, Mei-Xia Yue, Wen Zhang et al.· IEEE Access· 0 citations
This article proposes a fixed-time protocol for distributed optimization over multiagent systems (MASs), coupling time-varying dynamics with event-triggered communication. Unlike conventional constant-coefficient methods, our two-stage design guarantees fixed-time convergence independent of initial conditions, accelera...
Chaojie Li, Ziao Du, Ren-You Xie et al.· IEEE Transactions on Cyberne...· 0 citations
This letter develops a time-parallel policy-gradient framework for discrete-time nonlinear control-affine systems and proves that, for any finite horizon T, the state solver recovers the exact trajectory from any initialization in at most T iterations.
This paper focuses on the fixed-time distributed optimization problem with time-varying cost functions in multi-agent systems (MASs). For the scenario where all agents share the same Hessian matrix, a control framework for minimizing the global cost function is proposed based on the zero-gradient-sum (ZGS) algorithm. S...
Xintian Liang, Luke Li, Qintao Gan· Mathematics· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.