Haokun Hu
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
Haokun Hu has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Quanxin Zhu
MOE‐LCSM, CHP‐LCOCS, School of Mathematics and Statistics Hunan Normal University Changsha China
4 shared publications - Lipo Mo
Beijing Wuzi University
3 shared publications - Muzhou Hou
School of Computer Science and Engineering, Hunan University of Information Technology, Changsha, China
3 shared publications Fei Long
School of Artificial Intelligence and Electrical Engineering, Guizhou Institute of Technology Guiyang 550003 China
1 shared publication- Fei Long
School of Artificial Intelligence and Electrical Engineering, Guizhou Institute of Technology, Guiyang 550003, China
1 shared publication Menglin Kong
1 shared publication
Latest Publications
- 20 April 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (8) , 577
Exponential consensus of stochastic delayed multi-agent systems with Lévy noise under event-triggered control
- 20 April 2026
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 114 (8) , 577
Exponential consensus of stochastic delayed multi-agent systems with Lévy noise under event-triggered control
- Open Access
- 30 October 2025
- Published by Scilight Press Pty Ltd in Complex Systems Stability & Control
- Vol. 1 (1) , 5
Distributed Constrained Optimization for Nonlinear Stochastic Multi-Agent Systems: Application to Resource Allocation
This paper investigates the resource allocation problem (RAP) for nonlinear stochastic systems subject to random disturbances. The communication network is modeled as a weight-balanced digraph, where each agent can only access its own differentiable and strongly convex local cost function. A fully distributed adaptive state-feedback algorithm is proposed, and rigorous analysis shows that the decision variables converge almost surely to the optimal solution. Unlike existing studies on deterministic RAPs, the system considered here is affected by two types of stochastic factors-Brownian motion and unknown nonlinear dynamics—which significantly increase the difficulty of algorithm design. Finally, numerical simulations on a resource allocation example are provided to demonstrate the effectiveness of the proposed approach.
- 30 October 2025
- Published by Scilight Press Pty Ltd in Complex Systems Stability & Control
- Vol. 1 (1) , 5
Open AccessDistributed Constrained Optimization for Nonlinear Stochastic Multi-Agent Systems: Application to Resource Allocation
This paper investigates the resource allocation problem (RAP) for nonlinear stochastic systems subject to random disturbances. The communication network is modeled as a weight-balanced digraph, where each agent can only access its own differentiable and strongly convex local cost function. A fully distributed adaptive state-feedback algorithm is proposed, and rigorous analysis shows that the decision variables converge almost surely to the optimal solution. Unlike existing studies on deterministic RAPs, the system considered here is affected by two types of stochastic factors-Brownian motion and unknown nonlinear dynamics—which significantly increase the difficulty of algorithm design. Finally, numerical simulations on a resource allocation example are provided to demonstrate the effectiveness of the proposed approach.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 567-578
Finite-Time Consensus of Stochastic Delayed Multiagent Systems Subject to Lévy Noise, Markov Switching, and Actuator Fault Uncertainties
This study proposes a novel and cohesive framework to address stochastic finite-time consensus (FTC) problems, with the following main contributions: (i) We first introduce the original stochastic delay systems and, based on this, analyze the effects of Lévy noise, actuator faults, and Markov switching. Both leaderless and leader–follower topologies are considered, and a new control algorithm is proposed to investigate the fault-tolerant control problem under the influence of communication delays and Markov switching dynamics. (ii) To ensure that the states converge to a bounded compact set, the convergence analysis uses strong mathematical techniques, such as stopping time theory and the evolution of finite-time stochastic theory, to achieve mean-square and almost certain consensus. (iii) An important aspect of this study is the consideration of Markov-switching actuator faults, where fault occurrence and recovery evolve randomly according to a Markov process, introducing additional stochastic uncertainties into the system dynamics. Additionally, two numerical examples are provided to validate the correctness of the theoretical results.
- 19 September 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. 56 (1) , 567-578
Finite-Time Consensus of Stochastic Delayed Multiagent Systems Subject to Lévy Noise, Markov Switching, and Actuator Fault Uncertainties
This study proposes a novel and cohesive framework to address stochastic finite-time consensus (FTC) problems, with the following main contributions: (i) We first introduce the original stochastic delay systems and, based on this, analyze the effects of Lévy noise, actuator faults, and Markov switching. Both leaderless and leader–follower topologies are considered, and a new control algorithm is proposed to investigate the fault-tolerant control problem under the influence of communication delays and Markov switching dynamics. (ii) To ensure that the states converge to a bounded compact set, the convergence analysis uses strong mathematical techniques, such as stopping time theory and the evolution of finite-time stochastic theory, to achieve mean-square and almost certain consensus. (iii) An important aspect of this study is the consideration of Markov-switching actuator faults, where fault occurrence and recovery evolve randomly according to a Markov process, introducing additional stochastic uncertainties into the system dynamics. Additionally, two numerical examples are provided to validate the correctness of the theoretical results.
- 5 August 2025
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 113 (21) , 29247-29261
Adaptive distributed optimization for nonlinear stochastic multi-agent systems with event-triggered strategy
- 5 August 2025
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 113 (21) , 29247-29261
Adaptive distributed optimization for nonlinear stochastic multi-agent systems with event-triggered strategy
- 2 July 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 167
ACENet: Adaptive correlation-enhanced network for multivariate time series forecasting
- 2 July 2025
- Published by Elsevier in Digital Signal Processing
- Vol. 167
ACENet: Adaptive correlation-enhanced network for multivariate time series forecasting
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5520-5530
Constraint-Coupled Distributed Coordination Control for Nonlinear Stochastic Multiagent Systems: Application to Power Resource Allocation
This article studies the distributed coordination control problem of the nonlinear stochastic multiagent system, which involves multiple inequality constraints, as well as random disturbances. The communication network is modeled as an undirected and connected graph, where each node has a cost function that is considered to be strongly convex. First, an algorithm is developed that utilizes state feedback and projection operations, along with auxiliary variables, to precisely estimate the optimal state and its derivatives in a distributed manner. Furthermore, the decision variable is subject to several inequality constraints, and there are no restrictions on the initial value. Taking into account the impact of nonlinearity resulting from drift coefficients, diffusion coefficients, and external disturbances on the system’s stability, the existing works cannot be directly applied to this study. Through the utilization of the ${\rm It}\hat{\rm o}$ formula and convex analysis, a novel analytical approach has been demonstrated to establish the asymptotic convergence of decision variable to the optimal value in mean square. This method distinguishes itself from the conventional convergence analysis techniques. Finally, the algorithm is utilized for the allocation of energy resources, resulting in the attainment of the optimal regulating method for power resource allocation.
- 3 June 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Vol. 55 (8) , 5520-5530
Constraint-Coupled Distributed Coordination Control for Nonlinear Stochastic Multiagent Systems: Application to Power Resource Allocation
This article studies the distributed coordination control problem of the nonlinear stochastic multiagent system, which involves multiple inequality constraints, as well as random disturbances. The communication network is modeled as an undirected and connected graph, where each node has a cost function that is considered to be strongly convex. First, an algorithm is developed that utilizes state feedback and projection operations, along with auxiliary variables, to precisely estimate the optimal state and its derivatives in a distributed manner. Furthermore, the decision variable is subject to several inequality constraints, and there are no restrictions on the initial value. Taking into account the impact of nonlinearity resulting from drift coefficients, diffusion coefficients, and external disturbances on the system’s stability, the existing works cannot be directly applied to this study. Through the utilization of the ${\rm It}\hat{\rm o}$ formula and convex analysis, a novel analytical approach has been demonstrated to establish the asymptotic convergence of decision variable to the optimal value in mean square. This method distinguishes itself from the conventional convergence analysis techniques. Finally, the algorithm is utilized for the allocation of energy resources, resulting in the attainment of the optimal regulating method for power resource allocation.
- 29 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 256
PHCDTI: A multichannel parallel high-order feature crossover model for DTIs prediction
- 29 July 2024
- Published by Elsevier in Expert Systems with Applications
- Vol. 256
PHCDTI: A multichannel parallel high-order feature crossover model for DTIs prediction
- 11 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 37 (4) , 1470-1487
Distributed Heterogeneous Multi-Agent Optimization with Stochastic Sub-Gradient
- 11 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 37 (4) , 1470-1487
Distributed Heterogeneous Multi-Agent Optimization with Stochastic Sub-Gradient
- 8 February 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (4) , 1150-1162
Stochastic Consensus for Heterogeneous Multi-agent Networks With Constraints and Communication Noises
- 8 February 2024
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 22 (4) , 1150-1162
Stochastic Consensus for Heterogeneous Multi-agent Networks With Constraints and Communication Noises
- 4 March 2022
- Published by Wiley in Asian Journal of Control
- Vol. 25 (1) , 395-406
Distributed second‐order multi‐agent constrained optimization algorithm with time‐varying cost function
This paper mainly discusses distributed constrained optimization problem for second‐order multi‐agent system under undirected communication network. The task of all agents is to minimize the sum of the local convex functions, where each agent is individual and only accesses to one objective function. Different from the most existing results, where the objective functions are assumed to be time‐invariable, this paper considers the situation of time‐varying objective function. Besides, we don't require that the Hessian matrices are identical and the gradients are bounded. First, a novel time‐varying optimization algorithm is proposed based on the projection algorithm. Second, by using convex analysis and Lyapunov theory, it is shown that the states of all agents can reach consensus and asymptotically converge to the neighborhood of the optimal solution. Finally, some numerical examples are given to verify the effectiveness of our algorithms.
- 4 March 2022
- Published by Wiley in Asian Journal of Control
- Vol. 25 (1) , 395-406
Distributed second‐order multi‐agent constrained optimization algorithm with time‐varying cost function
This paper mainly discusses distributed constrained optimization problem for second‐order multi‐agent system under undirected communication network. The task of all agents is to minimize the sum of the local convex functions, where each agent is individual and only accesses to one objective function. Different from the most existing results, where the objective functions are assumed to be time‐invariable, this paper considers the situation of time‐varying objective function. Besides, we don't require that the Hessian matrices are identical and the gradients are bounded. First, a novel time‐varying optimization algorithm is proposed based on the projection algorithm. Second, by using convex analysis and Lyapunov theory, it is shown that the states of all agents can reach consensus and asymptotically converge to the neighborhood of the optimal solution. Finally, some numerical examples are given to verify the effectiveness of our algorithms.