Baoyong Zhang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Baoyong Zhang has a total of 145 co-authors. Here are the top co-authors by number of shared publications:
- Shengyuan Xu
Nanjing University of Science and Technology
36 shared publications - Deming Yuan
Nanjing University of Science and Technology
24 shared publications - Zhengqiang Zhang
Qufu Normal University
14 shared publications Deming Yuan
13 shared publications- Shuai Song
Henan University of Science and Technology
12 shared publications - Xiaona Song
Henan University of Science and Technology
12 shared publications
Latest Publications
- 2 November 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (18)
A distributed online mirror descent algorithm for multi-agent systems with asynchronous communication
- 2 November 2026
- Published by Elsevier in Journal of the Franklin Institute
- Vol. 363 (18)
A distributed online mirror descent algorithm for multi-agent systems with asynchronous communication
- 30 September 2026
- Published by Taylor & Francis in International Journal of Systems Science
- p. 1-17
Distributed prescribed-time algorithm for time-varying optimisation with affine formation constraints in nonlinear multi-agent networks
1. With the accelerated advancement of informatisation, various complex problems continue to emerge. In this context, large-scale multi-agent systems are facing increasingly complex and urgent opti...
- 30 September 2026
- Published by Taylor & Francis in International Journal of Systems Science
- p. 1-17
Distributed prescribed-time algorithm for time-varying optimisation with affine formation constraints in nonlinear multi-agent networks
1. With the accelerated advancement of informatisation, various complex problems continue to emerge. In this context, large-scale multi-agent systems are facing increasingly complex and urgent opti...
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42471-42484
Sampled-Data-Based Distributed Optimization Coordination for IoT Heterogeneous Multiagent Systems: Resilient Against FDI Attacks
- 1 September 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Internet of Things Journal
- Vol. 13 (18) , 42471-42484
Sampled-Data-Based Distributed Optimization Coordination for IoT Heterogeneous Multiagent Systems: Resilient Against FDI Attacks
- 18 May 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (10) , 718
Distributed continuous-time constrained online convex optimization for high-order nonlinear multi-agent systems
- 18 May 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (10) , 718
Distributed continuous-time constrained online convex optimization for high-order nonlinear multi-agent systems
- 15 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2258-2272
Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses Under Single and Multiple Consensus Steps
This paper considers the distributed online convex-concave optimization with constraint sets over a multiagent network, in which each agent autonomously generates a series of decision pairs through a designable mechanism to cooperatively minimize the global loss function. To this end, under no-Euclidean distance metrics, we propose a distributed online stochastic mirror descent convex-concave optimization algorithm with timevarying predictive mappings. Taking dynamic saddle point regret as a performance metric, it is proved that the proposed algorithm achieves the regret upper-bound in$O({\rm max}\{T^{θ1} , T^{θ2}(1 + V_T )\})$ for the general convex-concave loss function, where θ1, θ2 ∈ (0, 1) are the tuning parameters, T is the total iteration time, and VT is the path-variation. Surely, this algorithm guarantees the sublinear convergence, provided that VT is sublinear. Moreover, aiming to achieve better convergence, we further investigate a variant of this algorithm by employing the multiple consensus technique. The obtained results show that the appropriate setting can effectively tighten the regret bound to a certain extent. Finally, the efficacy of the proposed algorithms is validated and compared through the simulation example of a target tracking problem.- 15 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 74 (1053587X) , 2258-2272
Distributed Online Stochastic Convex-Concave Optimization: Dynamic Regret Analyses Under Single and Multiple Consensus Steps
This paper considers the distributed online convex-concave optimization with constraint sets over a multiagent network, in which each agent autonomously generates a series of decision pairs through a designable mechanism to cooperatively minimize the global loss function. To this end, under no-Euclidean distance metrics, we propose a distributed online stochastic mirror descent convex-concave optimization algorithm with timevarying predictive mappings. Taking dynamic saddle point regret as a performance metric, it is proved that the proposed algorithm achieves the regret upper-bound in$O({\rm max}\{T^{θ1} , T^{θ2}(1 + V_T )\})$ for the general convex-concave loss function, where θ1, θ2 ∈ (0, 1) are the tuning parameters, T is the total iteration time, and VT is the path-variation. Surely, this algorithm guarantees the sublinear convergence, provided that VT is sublinear. Moreover, aiming to achieve better convergence, we further investigate a variant of this algorithm by employing the multiple consensus technique. The obtained results show that the appropriate setting can effectively tighten the regret bound to a certain extent. Finally, the efficacy of the proposed algorithms is validated and compared through the simulation example of a target tracking problem.- 10 February 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (3) , 212
Intermittent control of delayed positive T-S fuzzy systems under dual-channel hidden DoS attacks
- 10 February 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (3) , 212
Intermittent control of delayed positive T-S fuzzy systems under dual-channel hidden DoS attacks
- 19 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (7) , 3966-3978
Prescribed‐Time Distributed Optimization for Multi‐agent Systems Over Unbalanced Directed Networks
This paper investigates the prescribed‐time distributed convex optimization problem for multi‐agent systems with double‐integrator over unbalanced directed networks. In the continuous‐time setting, a prescribed‐time distributed optimization algorithm is proposed. By introducing an adjustment function, an estimator with prescribed‐time convergence is designed, which makes the algorithm independent of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix. Additionally, we establish a prescribed‐time convergence theory, and then prove that the proposed algorithm converges to the optimal solution within the prescribed‐time and maintains optimality thereafter. Finally, two simulation experiments are employed to support the validity of the algorithm.
- 19 January 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (7) , 3966-3978
Prescribed‐Time Distributed Optimization for Multi‐agent Systems Over Unbalanced Directed Networks
This paper investigates the prescribed‐time distributed convex optimization problem for multi‐agent systems with double‐integrator over unbalanced directed networks. In the continuous‐time setting, a prescribed‐time distributed optimization algorithm is proposed. By introducing an adjustment function, an estimator with prescribed‐time convergence is designed, which makes the algorithm independent of the left eigenvector associated with the zero eigenvalue of the Laplacian matrix. Additionally, we establish a prescribed‐time convergence theory, and then prove that the proposed algorithm converges to the optimal solution within the prescribed‐time and maintains optimality thereafter. Finally, two simulation experiments are employed to support the validity of the algorithm.
- Top Cited Papers
- 15 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (4) , 2501-2513
Reinforcement Learning-Based Optimized Adaptive Secure Control for Constrained Fractional-Order Nonlinear Systems Under FDI Attacks
This article considers the adaptive fuzzy optimized secure self-triggered control (STC) problem for constrained fractional-order nonlinear systems (FONSs) subject to unknown false data injection attacks (FDIAs). To fulfill the unilateral full-state constraints (UFSCs), an emerging nonlinear state-dependent function with convexity is utilized by means of its property in removing the feasibility conditions existing in the traditional constraint control. Meanwhile, since the true information of the state variables under attack signals is unavailable, a method of coordinate transformation combining the compromised system and dynamic surface control is used for designing the corresponding controller while alleviating the adverse impacts of the FDIAs. Additionally, by constructing the equivalent auxiliary systems and employing actor-critic neural networks (NNs), a reinforcement learning (RL)-based adaptive fuzzy optimal program is provided to achieve optimal control. Furthermore, considering that event-triggered mechanism needs real-time supervision of the control signals, a STC strategy is introduced to circumvent this drawback and reduce communication consumption. Leveraging the fractional Lyapunov stability theory, it has been confirmed that the devised controller can ensure that the stabilization errors tend toward a small area nearby the origin at the minimum costs and all the signals arising in the closed-loop system (CLS) are bounded. Eventually, two simulation examples are offered to demonstrate the reported control algorithm’s validity.
- 15 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 56 (4) , 2501-2513
Top Cited PapersReinforcement Learning-Based Optimized Adaptive Secure Control for Constrained Fractional-Order Nonlinear Systems Under FDI Attacks
This article considers the adaptive fuzzy optimized secure self-triggered control (STC) problem for constrained fractional-order nonlinear systems (FONSs) subject to unknown false data injection attacks (FDIAs). To fulfill the unilateral full-state constraints (UFSCs), an emerging nonlinear state-dependent function with convexity is utilized by means of its property in removing the feasibility conditions existing in the traditional constraint control. Meanwhile, since the true information of the state variables under attack signals is unavailable, a method of coordinate transformation combining the compromised system and dynamic surface control is used for designing the corresponding controller while alleviating the adverse impacts of the FDIAs. Additionally, by constructing the equivalent auxiliary systems and employing actor-critic neural networks (NNs), a reinforcement learning (RL)-based adaptive fuzzy optimal program is provided to achieve optimal control. Furthermore, considering that event-triggered mechanism needs real-time supervision of the control signals, a STC strategy is introduced to circumvent this drawback and reduce communication consumption. Leveraging the fractional Lyapunov stability theory, it has been confirmed that the devised controller can ensure that the stabilization errors tend toward a small area nearby the origin at the minimum costs and all the signals arising in the closed-loop system (CLS) are bounded. Eventually, two simulation examples are offered to demonstrate the reported control algorithm’s validity.