Bowen Xu
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
Bowen Xu has a total of 43 co-authors. Here are the top co-authors by number of shared publications:
- Hai-Tao Zhang
Huazhong University of Science and Technology
10 shared publications - Dengxiu Yu
School of Artificial Intelligence, Optics and Electronics (iOPEN), Northwestern Polytechnical University, Xi’an, China
6 shared publications - Zhen Wang
School of Cybersecurity, Northwestern Polytechnical University, Xi'an, China
3 shared publications - Chun Lung Philip Chen
South China University of Technology
2 shared publications - Fulong Hu
Huazhong University of Science and Technology
2 shared publications - Guanrong Chen
Department of Electrical Engineering, City University of Hong Kong, Kowloon 999077, Hong Kong SAR, P. R. China
2 shared publications
Latest Publications
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (1) , 530-542
Surrounding Control Based on Optimal Targets Assignment and Dynamic Graph Game
In this article, the distributed surrounding control problem is addressed for the linear multi-agent systems, in which a hierarchical strategy framework is constructed consisting of optimal target assignment and game-driven surrounding control. Aiming at fulfilling the multiple targets surrounding task with high efficiency and balanced mission load, an optimal target assignment mechanism is developed with the assistance of the cross entropy method (CEM) and twin delayed deep deterministic policy gradient algorithm (TD3), where an evaluation function related to the arrival time from each agent to capture the target is proposed. Considering the high degree of autonomy of the targets, a surrounding control protocol driven by the dynamic graph game is proposed afterward. To find the equilibrium solution of the pursuit-escape game, the coupled Hamilton–Jacobi–Bellman (HJB) equation is solved by a delicately designed model based value iteration algorithm, whose stability is demonstrated by the rigorous theoretical analysis. Finally, we undertake numerical experiments to ascertain the efficacy of the introduced game-driven surrounding control strategy.
- 31 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Social Systems
- Vol. 13 (1) , 530-542
Surrounding Control Based on Optimal Targets Assignment and Dynamic Graph Game
In this article, the distributed surrounding control problem is addressed for the linear multi-agent systems, in which a hierarchical strategy framework is constructed consisting of optimal target assignment and game-driven surrounding control. Aiming at fulfilling the multiple targets surrounding task with high efficiency and balanced mission load, an optimal target assignment mechanism is developed with the assistance of the cross entropy method (CEM) and twin delayed deep deterministic policy gradient algorithm (TD3), where an evaluation function related to the arrival time from each agent to capture the target is proposed. Considering the high degree of autonomy of the targets, a surrounding control protocol driven by the dynamic graph game is proposed afterward. To find the equilibrium solution of the pursuit-escape game, the coupled Hamilton–Jacobi–Bellman (HJB) equation is solved by a delicately designed model based value iteration algorithm, whose stability is demonstrated by the rigorous theoretical analysis. Finally, we undertake numerical experiments to ascertain the efficacy of the introduced game-driven surrounding control strategy.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (3) , 2133-2142
Self-Supervised Koopman Operator-Learning of Nonlinear Multi-Agent Systems With Partial Information
A hybrid self-supervised Koopman deep learning algorithm has been developed to learn the Koopman operator for nonlinear multi-agent systems (MASs) using partial state information. In contrast, most existing Koopman operator-learning methods rely on full state series, which is infeasible for most general nonlinear networked systems or multi-agent systems (MASs), as each node/agent only has access to its neighbor(s). Therein, a nonlinear encoder is designed as an observer function to lift the nonlinear state into a high-dimensional Hilbert space. In this lifted linear space, a linear networked model is constructed to predict future states. A corresponding nonlinear decoder, serving as the inverse of the encoder, retrieves the original nonlinear states. This algorithm could distill the linear features from the partial state information of nonlinear MASs, transforming complex, hard-to-predict nonlinear dynamics into high-dimensional linear systems. Accordingly, the retrieved linear feature can serve as an interface for other calculations, which can then be decoded back to the original nonlinear states. Theoretical derivation guarantees the feasibility of the present distributed Koopman operator-learning (DKOL). Extensive numerical simulations demonstrate its effectiveness and superiority.
- 17 July 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems I: Regular Papers
- Vol. 73 (3) , 2133-2142
Self-Supervised Koopman Operator-Learning of Nonlinear Multi-Agent Systems With Partial Information
A hybrid self-supervised Koopman deep learning algorithm has been developed to learn the Koopman operator for nonlinear multi-agent systems (MASs) using partial state information. In contrast, most existing Koopman operator-learning methods rely on full state series, which is infeasible for most general nonlinear networked systems or multi-agent systems (MASs), as each node/agent only has access to its neighbor(s). Therein, a nonlinear encoder is designed as an observer function to lift the nonlinear state into a high-dimensional Hilbert space. In this lifted linear space, a linear networked model is constructed to predict future states. A corresponding nonlinear decoder, serving as the inverse of the encoder, retrieves the original nonlinear states. This algorithm could distill the linear features from the partial state information of nonlinear MASs, transforming complex, hard-to-predict nonlinear dynamics into high-dimensional linear systems. Accordingly, the retrieved linear feature can serve as an interface for other calculations, which can then be decoded back to the original nonlinear states. Theoretical derivation guarantees the feasibility of the present distributed Koopman operator-learning (DKOL). Extensive numerical simulations demonstrate its effectiveness and superiority.
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP (2162237X) , 1-15
Deterministic Convergence Analysis and Application of Elman Neural Network via Sparse Mechanism and Entropy Error Function
In this study, we employed the batch gradient method to investigate the monotonicity and convergence of the Elman neural network (ENN) based on the entropy error function (EEF) and regularization methods. This enhances network stability and sparsity while also boosting its ability to generalize. Traditional mean square error (mse) functions in complex networks often result in slower convergence during training, prone-to-local minima, and even incorrect saturation issues. To address this drawback, we propose a novel EEF for training ENN, effectively avoiding the problem of learning speed degradation. Furthermore, by leveraging smoothing group $L_{1/2}$ regularization $(\text {SGL}_{1/2})$ methods in studying ENN based on EEF, we effectively overcome the drawbacks of traditional group $L_{1/2}$ regularization $(\text {GL}_{1/2})$ leading to error function oscillations. In addition, we optimize the network architecture effectively in two key ways: reducing redundant nodes to near 0 and driving redundant weights toward 0 for remaining nodes, further boosting network sparsity. This article rigorously proves the monotonicity of the error function, alongside presenting strong and weak convergence outcomes for the novel method. The effectiveness and correctness of our approach are clearly illustrated through experimental results. The simulation results align with the theoretical findings.
- 21 May 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Neural Networks and Learning Systems
- Vol. PP (2162237X) , 1-15
Deterministic Convergence Analysis and Application of Elman Neural Network via Sparse Mechanism and Entropy Error Function
In this study, we employed the batch gradient method to investigate the monotonicity and convergence of the Elman neural network (ENN) based on the entropy error function (EEF) and regularization methods. This enhances network stability and sparsity while also boosting its ability to generalize. Traditional mean square error (mse) functions in complex networks often result in slower convergence during training, prone-to-local minima, and even incorrect saturation issues. To address this drawback, we propose a novel EEF for training ENN, effectively avoiding the problem of learning speed degradation. Furthermore, by leveraging smoothing group $L_{1/2}$ regularization $(\text {SGL}_{1/2})$ methods in studying ENN based on EEF, we effectively overcome the drawbacks of traditional group $L_{1/2}$ regularization $(\text {GL}_{1/2})$ leading to error function oscillations. In addition, we optimize the network architecture effectively in two key ways: reducing redundant nodes to near 0 and driving redundant weights toward 0 for remaining nodes, further boosting network sparsity. This article rigorously proves the monotonicity of the error function, alongside presenting strong and weak convergence outcomes for the novel method. The effectiveness and correctness of our approach are clearly illustrated through experimental results. The simulation results align with the theoretical findings.
- 9 April 2025
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 113 (14) , 18931-18950
Epidemic spreading in temporal multilayer networks coupling with individual behavioral changes
- 9 April 2025
- Published by Springer Nature in Nonlinear Dynamics
- Vol. 113 (14) , 18931-18950
Epidemic spreading in temporal multilayer networks coupling with individual behavioral changes
- 27 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (6) , 4457-4465
Stabilizing a Class of Periodical Time-Delay Milling Systems by Adaptive Active Control Method
Periodical time-delay scenario is often encountered in industrial manufacturing processes. However, the presence of time delays and periodical coefficients brings challenges to controller design and system analysis, which thereby hinders the performance improvement of such systems. In this work, the dynamics of milling systems are transformed into a time-invariant finite-dimensional uncertain model described by Fourier series and Padé approximation. An adaptive active control law is accordingly designed to stabilize such complex dynamics. With the assistance of LaSalle–Yoshizawa theorem, conditions are derived to guarantee sufficiently large stability regions of the corresponding closed-loop system. A numerical case study is conducted on a standard two degrees of freedom milling perturbation system to substantiate the superiority of the proposed adaptive active control technique in terms of enlarged stable operational regions.
- 27 February 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Industrial Informatics
- Vol. 21 (6) , 4457-4465
Stabilizing a Class of Periodical Time-Delay Milling Systems by Adaptive Active Control Method
Periodical time-delay scenario is often encountered in industrial manufacturing processes. However, the presence of time delays and periodical coefficients brings challenges to controller design and system analysis, which thereby hinders the performance improvement of such systems. In this work, the dynamics of milling systems are transformed into a time-invariant finite-dimensional uncertain model described by Fourier series and Padé approximation. An adaptive active control law is accordingly designed to stabilize such complex dynamics. With the assistance of LaSalle–Yoshizawa theorem, conditions are derived to guarantee sufficiently large stability regions of the corresponding closed-loop system. A numerical case study is conducted on a standard two degrees of freedom milling perturbation system to substantiate the superiority of the proposed adaptive active control technique in terms of enlarged stable operational regions.
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (6) , 4186-4193
Distributed Minimum-Time Consensus Prediction for High-Order Multiagent Systems
In this note, a detective matrix-based distributed algorithm is proposed to address a distributed minimum-time consensus prediction problem for discrete-time high-order multi-agent systems (MASs). Therein, each agent predicts the consensus value merely using the minimum length of individual and/or neighboring successive position time series. Compared to most existing algorithms that could only predict constant consensus values for first-order linear MASs, the present method could predict consensus manifolds for high-order linear MASs as well, which could be time-varying. Finally, both the effectiveness and superiority of the proposed distributed minimum-time consensus algorithm are substantiated by numerical simulations.
- 28 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automatic Control
- Vol. 70 (6) , 4186-4193
Distributed Minimum-Time Consensus Prediction for High-Order Multiagent Systems
In this note, a detective matrix-based distributed algorithm is proposed to address a distributed minimum-time consensus prediction problem for discrete-time high-order multi-agent systems (MASs). Therein, each agent predicts the consensus value merely using the minimum length of individual and/or neighboring successive position time series. Compared to most existing algorithms that could only predict constant consensus values for first-order linear MASs, the present method could predict consensus manifolds for high-order linear MASs as well, which could be time-varying. Finally, both the effectiveness and superiority of the proposed distributed minimum-time consensus algorithm are substantiated by numerical simulations.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1531-1539
Distributed Identification for Node and Edge Numbers of Time-Varying Anonymous Networks
In this paper, a distributed algorithm is proposed to identify the node and edge numbers of anonymous leader-follower networks. The present distributed method works merely by exchanging scalar information by local intercommunication. The merit of the algorithm lies in identifying the required network parameters in time-varying topological networks without special initialization. Sufficient conditions are derived for cascading systems to theoretically guarantee the exponential convergence of the individual estimation to the total number of nodes or edges merely by local information exchanging. Finally, numerical simulations are conducted to substantiate the effectiveness of the present identification algorithm.
- 7 January 2025
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 12 (2) , 1531-1539
Distributed Identification for Node and Edge Numbers of Time-Varying Anonymous Networks
In this paper, a distributed algorithm is proposed to identify the node and edge numbers of anonymous leader-follower networks. The present distributed method works merely by exchanging scalar information by local intercommunication. The merit of the algorithm lies in identifying the required network parameters in time-varying topological networks without special initialization. Sufficient conditions are derived for cascading systems to theoretically guarantee the exponential convergence of the individual estimation to the total number of nodes or edges merely by local information exchanging. Finally, numerical simulations are conducted to substantiate the effectiveness of the present identification algorithm.
- 12 June 2024
- Published by Elsevier in Information Sciences
- Vol. 678
Multiple dynamic targets enclosing control for a class of nonlinear uncertain multiagent systems
- 12 June 2024
- Published by Elsevier in Information Sciences
- Vol. 678
Multiple dynamic targets enclosing control for a class of nonlinear uncertain multiagent systems
- 10 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 37 (6) , 2556-2578
A Practical Predefined-Time Stability Criterion and Its Application to Uncertain Nonlinear Systems
- 10 June 2024
- Published by Springer Nature in Journal of Systems Science and Complexity
- Vol. 37 (6) , 2556-2578
A Practical Predefined-Time Stability Criterion and Its Application to Uncertain Nonlinear Systems