Dan Liu
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
Dan Liu has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Binrui Wang
College of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou, China
4 shared publications - Xiaohang Li
China Jiliang University
3 shared publications - Dan Ye
Northeastern University
2 shared publications - Bin Zhang
China Jiliang University
1 shared publication - Binrui Wang
College of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou 310018, China
1 shared publication - Hongtao Li
School of Mechanical and Electrical Engineering, China Jiliang University, Hangzhou, China
1 shared publication
Latest Publications
- 10 June 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (13) , 6613-6625
Fully Distributed Bipartite Consensus of Multiple Euler‐Lagrange Systems Under DoS Attacks
This paper investigates the leader‐follower bipartite consensus (LFBC) problem of multiple Euler‐Lagrange systems (MELSs) under denial‐of‐service (DoS) attacks. Compared with the existing works where the designed observers depend on global parameters, several distributed observers that are independent of any global parameters, including the size of the global system and communication topology, are designed. A secure bipartite consensus protocol is developed by synchronously updating the coupling strengths of all edges during the time intervals without DoS attacks. To reduce the control complexity and save the computing resources, an edge‐pinning‐based consensus protocol with a synchronous updating strategy is developed, under which only the coupling strengths of partial edges are updated instead of all of them during the time intervals without DoS attacks. Then, to improve the flexibility of bipartite consensus protocols against DoS attacks, the novel secure bipartite consensus protocols with asynchronous updating strategies are designed, under which the coupling strengths of the attacked edges remain unchanged at current values, while the coupling strengths of the unattacked edges are updated normally during the time intervals with DoS attack. Eventually, the proposed results are validated through the numerical simulation.
- 10 June 2026
- Published by Wiley in International Journal of Robust and Nonlinear Control
- Vol. 36 (13) , 6613-6625
Fully Distributed Bipartite Consensus of Multiple Euler‐Lagrange Systems Under DoS Attacks
This paper investigates the leader‐follower bipartite consensus (LFBC) problem of multiple Euler‐Lagrange systems (MELSs) under denial‐of‐service (DoS) attacks. Compared with the existing works where the designed observers depend on global parameters, several distributed observers that are independent of any global parameters, including the size of the global system and communication topology, are designed. A secure bipartite consensus protocol is developed by synchronously updating the coupling strengths of all edges during the time intervals without DoS attacks. To reduce the control complexity and save the computing resources, an edge‐pinning‐based consensus protocol with a synchronous updating strategy is developed, under which only the coupling strengths of partial edges are updated instead of all of them during the time intervals without DoS attacks. Then, to improve the flexibility of bipartite consensus protocols against DoS attacks, the novel secure bipartite consensus protocols with asynchronous updating strategies are designed, under which the coupling strengths of the attacked edges remain unchanged at current values, while the coupling strengths of the unattacked edges are updated normally during the time intervals with DoS attack. Eventually, the proposed results are validated through the numerical simulation.
- 17 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-11
Prescribed-Time Containment Control for Multiple Euler–Lagrange Systems Against DoS Attacks
This article discusses the prescribed-time containment control problem of multiple Euler–Lagrange systems (MELSs) under denial-of-service (DoS) attacks. First, for the case of multiple static leaders, the resilient control laws are constructed to drive all followers into the convex hull generated by the trajectories of leaders within a prescribed time under DoS attacks. Then, for the case of multiple dynamic leaders, the new prescribed-time observer is designed to estimate the state of each follower, thereby achieving containment control for MELSs under DoS attacks. Compared with the existing works where the settling time relies on global information or the initial conditions of systems, the developed prescribed-time containment control schemes are entirely decoupled from global information and system parameters. Finally, two numerical simulations are provided to verify the validity of the developed resilient prescribed-time containment control strategies.
- 17 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Cybernetics
- Vol. PP (21682267) , 1-11
Prescribed-Time Containment Control for Multiple Euler–Lagrange Systems Against DoS Attacks
This article discusses the prescribed-time containment control problem of multiple Euler–Lagrange systems (MELSs) under denial-of-service (DoS) attacks. First, for the case of multiple static leaders, the resilient control laws are constructed to drive all followers into the convex hull generated by the trajectories of leaders within a prescribed time under DoS attacks. Then, for the case of multiple dynamic leaders, the new prescribed-time observer is designed to estimate the state of each follower, thereby achieving containment control for MELSs under DoS attacks. Compared with the existing works where the settling time relies on global information or the initial conditions of systems, the developed prescribed-time containment control schemes are entirely decoupled from global information and system parameters. Finally, two numerical simulations are provided to verify the validity of the developed resilient prescribed-time containment control strategies.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 3143-3148
A Trade-Off Between Time and Energy of Stochastic Higher-Order Networks on Multi-Directed Hypergraphs
This paper concentrates on the trade-off between control time and energy consumption in achieving finite-time synchronization of stochastic higher-order networks. Different from the existing results that either only consider pairwise interactions between nodes or restrict higher-order interactions to 1-directed hyperedges, multi-directed hypergraphs are employed to better describe group interactions in real networks. A switching control strategy is proposed to estimate the control time and energy consumption in achieving finite-time synchronization of higher-order networks. In addition, to discuss the trade-off between control time and energy consumption, an evaluation index function with adjustable weights is constructed to analyze the optimal control gains in finite time. Finally, an example for higher-order complex networks composed of Chua’s circuits is provided to validate the effectiveness of the proposed results.
- 12 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Control Systems Letters
- Vol. 9, 3143-3148
A Trade-Off Between Time and Energy of Stochastic Higher-Order Networks on Multi-Directed Hypergraphs
This paper concentrates on the trade-off between control time and energy consumption in achieving finite-time synchronization of stochastic higher-order networks. Different from the existing results that either only consider pairwise interactions between nodes or restrict higher-order interactions to 1-directed hyperedges, multi-directed hypergraphs are employed to better describe group interactions in real networks. A switching control strategy is proposed to estimate the control time and energy consumption in achieving finite-time synchronization of higher-order networks. In addition, to discuss the trade-off between control time and energy consumption, an evaluation index function with adjustable weights is constructed to analyze the optimal control gains in finite time. Finally, an example for higher-order complex networks composed of Chua’s circuits is provided to validate the effectiveness of the proposed results.
- 13 January 2025
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 23 (1) , 187-195
Dynamic Leader-following Bipartite Consensus of Multiple Euler-Lagrange Systems Subject to DoS Attacks
- 13 January 2025
- Published by Springer Nature in International Journal of Control, Automation, and Systems
- Vol. 23 (1) , 187-195
Dynamic Leader-following Bipartite Consensus of Multiple Euler-Lagrange Systems Subject to DoS Attacks
- 18 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 4237-4246
Fully Distributed Secure State Estimation for Nonlinear Multi-Agent Systems Against DoS Attacks: An Edge-Pinning-Based Method
This paper investigates the fully distributed secure state estimation problem of nonlinear multi-agent systems (MASs) against denial-of-service (DoS) attacks. The design of state observer depends on the relative measurement outputs between neighboring agents rather than the absolute ones of agents themselves. To cooperatively estimate system states with the influence of DoS attacks in a fully distributed scenario, an edge-pinning-based synchronous update strategy for coupling weights is proposed. The purpose of adopting edge pinning method is to adjust partial coupling weights between neighboring agents instead of all ones, which can effectively reduce estimation complexity and save computing resources, especially for large-scale MASs. Further, an edge-pinning-based asynchronous update strategy for coupling weights is designed to meet different actual demands. Then, the security state estimation schemes under synchronous and asynchronous update strategies are proposed without utilizing any global information, such as the Laplacian matrix of communication graph or its smallest nonzero eigenvalue, and so on. Finally, a simulation example is provided to verify the theoretical results. Note to Practitioners —This paper addresses the distributed secure state estimation problem for nonlinear MASs, which plays an important role in unmanned aerial vehicle (UAV) formation, intelligent transport systems, smart grids, and so on. The absolute measurement outputs of agents themselves are usually unavailable in practical situations, so the relative measurement outputs between neighboring agents are used to design observers. Moreover, to overcome the difficulty that global information is unavailable in industrial applications with DoS attacks, the edge-pining-based synchronous and asynchronous update strategies for coupling weights are proposed in a fully distributed scenario.
- 18 July 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Automation Science and Engineering
- Vol. 21 (3) , 4237-4246
Fully Distributed Secure State Estimation for Nonlinear Multi-Agent Systems Against DoS Attacks: An Edge-Pinning-Based Method
This paper investigates the fully distributed secure state estimation problem of nonlinear multi-agent systems (MASs) against denial-of-service (DoS) attacks. The design of state observer depends on the relative measurement outputs between neighboring agents rather than the absolute ones of agents themselves. To cooperatively estimate system states with the influence of DoS attacks in a fully distributed scenario, an edge-pinning-based synchronous update strategy for coupling weights is proposed. The purpose of adopting edge pinning method is to adjust partial coupling weights between neighboring agents instead of all ones, which can effectively reduce estimation complexity and save computing resources, especially for large-scale MASs. Further, an edge-pinning-based asynchronous update strategy for coupling weights is designed to meet different actual demands. Then, the security state estimation schemes under synchronous and asynchronous update strategies are proposed without utilizing any global information, such as the Laplacian matrix of communication graph or its smallest nonzero eigenvalue, and so on. Finally, a simulation example is provided to verify the theoretical results. Note to Practitioners —This paper addresses the distributed secure state estimation problem for nonlinear MASs, which plays an important role in unmanned aerial vehicle (UAV) formation, intelligent transport systems, smart grids, and so on. The absolute measurement outputs of agents themselves are usually unavailable in practical situations, so the relative measurement outputs between neighboring agents are used to design observers. Moreover, to overcome the difficulty that global information is unavailable in industrial applications with DoS attacks, the edge-pining-based synchronous and asynchronous update strategies for coupling weights are proposed in a fully distributed scenario.
- 4 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (1) , 334-343
Cluster Synchronization of Complex Networks Under Denial-of-Service Attacks With Distributed Adaptive Strategies
This article studies the security cluster synchronization of complex networks under denial-of-service (DoS) attacks. First, an adaptive strategy is designed to update coupling weights and gains for ensuring cluster synchronization, even if the control channels of complex networks suffer from DoS attacks. This security strategy is developed in a distributed framework, in which only local information is utilized instead of any global information, such as the network topology and the number of nodes. Then, the security cluster synchronization analysis against DoS attacks is extended to the case where only partial coupling weights on edges are updated. By constructing suitable Lyapunov functions with exponential terms, the corresponding security cluster synchronization conditions are presented, and the DoS attack duration ratio that the system can tolerate is also obtained. Finally, a network composed of Chua’s circuits is employed to validate the efficiency of the derived methods.
- 4 August 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Control of Network Systems
- Vol. 9 (1) , 334-343
Cluster Synchronization of Complex Networks Under Denial-of-Service Attacks With Distributed Adaptive Strategies
This article studies the security cluster synchronization of complex networks under denial-of-service (DoS) attacks. First, an adaptive strategy is designed to update coupling weights and gains for ensuring cluster synchronization, even if the control channels of complex networks suffer from DoS attacks. This security strategy is developed in a distributed framework, in which only local information is utilized instead of any global information, such as the network topology and the number of nodes. Then, the security cluster synchronization analysis against DoS attacks is extended to the case where only partial coupling weights on edges are updated. By constructing suitable Lyapunov functions with exponential terms, the corresponding security cluster synchronization conditions are presented, and the DoS attack duration ratio that the system can tolerate is also obtained. Finally, a network composed of Chua’s circuits is employed to validate the efficiency of the derived methods.