Yunru Zhu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Yunru Zhu has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Yuanshi Zheng
Xidian University
5 shared publications - Sulan Li
Xidian University
3 shared publications - Jiahui Wu
Shaanxi Key Laboratory of Space Solar Power Station System, School of Mechano-electronic Engineering, Xidian University, Xi'an 710071, PR China
2 shared publications Huaizhu Wang
School of Intelligent Engineering and Technology, Ningxia University, Zhongwei, China
1 shared publication- Huaizhu Wang
School of Advanced Interdisciplinary Studies Ningxia University Zhongwei Ningxia China
1 shared publication - Jiaming Chang
School of Mechano-Electronic Engineering, Xidian University, Xi’an, China
1 shared publication
Latest Publications
- Open Access
- 1 July 2025
- Published by KEAI Publishing in Journal of Information and Intelligence
- Vol. 3 (4) , 289-302
Time-varying formation control with obstacle avoidance for fractional-order multi-agent systems
- 1 July 2025
- Published by KEAI Publishing in Journal of Information and Intelligence
- Vol. 3 (4) , 289-302
Open AccessTime-varying formation control with obstacle avoidance for fractional-order multi-agent systems
- 9 June 2025
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 57 (3) , 857-867
Resilient quantised consensus of multiagent systems under malicious attacks
- 9 June 2025
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 57 (3) , 857-867
Resilient quantised consensus of multiagent systems under malicious attacks
- 26 November 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 48 (3) , 460-468
Time-varying formation consensus for fractional-order multi-agent systems based on sliding mode control
This article addresses the problem of time-varying formation control when the fractional derivatives of the expected formation are different from the fractional multi-agent system. To achieve the infinite convergence of the relative position among agents, the synthetic error of the agent is introduced. Then according to the sliding mode control theory, the sliding mode function is designed based on the defined error. The time-varying formation control problem converts into the asymptotic stability problem of the system. Sufficient conditions for fractional-order multi-agent systems are derived by employing the Lyapunov stability theory, matrix theory, graph theory, and property of fractional-order systems. Finally, two numerical simulations are presented to validate the theoretical analysis.
- 26 November 2024
- Published by SAGE Publications in Transactions of the Institute of Measurement and Control
- Vol. 48 (3) , 460-468
Time-varying formation consensus for fractional-order multi-agent systems based on sliding mode control
This article addresses the problem of time-varying formation control when the fractional derivatives of the expected formation are different from the fractional multi-agent system. To achieve the infinite convergence of the relative position among agents, the synthetic error of the agent is introduced. Then according to the sliding mode control theory, the sliding mode function is designed based on the defined error. The time-varying formation control problem converts into the asymptotic stability problem of the system. Sufficient conditions for fractional-order multi-agent systems are derived by employing the Lyapunov stability theory, matrix theory, graph theory, and property of fractional-order systems. Finally, two numerical simulations are presented to validate the theoretical analysis.
- Open Access
- 11 July 2023
- Published by Institute of Information Theory and Automation in Kybernetika
- Vol. 59 (3) , 512-526
Generalized synchronization-based partial topology identification of complex networks
- 11 July 2023
- Published by Institute of Information Theory and Automation in Kybernetika
- Vol. 59 (3) , 512-526
Open AccessGeneralized synchronization-based partial topology identification of complex networks
- 27 May 2022
- Published by Elsevier in ISA Transactions
- Vol. 131, 274-281
Synchronous and asynchronous resilient impulsive control for group consensus of second-order multi-agent systems with communication delays
- 27 May 2022
- Published by Elsevier in ISA Transactions
- Vol. 131, 274-281
Synchronous and asynchronous resilient impulsive control for group consensus of second-order multi-agent systems with communication delays
- 24 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 146-153
Resilient Bipartite Consensus of Second-Order Multiagent Systems With Event-Triggered Communication
This article investigates the resilient bipartite consensus problem for continuous-time second-order multiagent systems in the presence of totally bounded malicious nodes under signed digraphs. An event-based resilient impulsive algorithm is employed, which cannot only mitigate the malicious nodes’ influence on the convergence of normal ones but also reduce the communication loads of agents. A necessary and sufficient condition related to the network topology is established for solving resilient bipartite consensus by using system transformation. A numerical simulation illustrates the effectiveness of the result.
- 24 December 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Systems Journal
- Vol. 17 (1) , 146-153
Resilient Bipartite Consensus of Second-Order Multiagent Systems With Event-Triggered Communication
This article investigates the resilient bipartite consensus problem for continuous-time second-order multiagent systems in the presence of totally bounded malicious nodes under signed digraphs. An event-based resilient impulsive algorithm is employed, which cannot only mitigate the malicious nodes’ influence on the convergence of normal ones but also reduce the communication loads of agents. A necessary and sufficient condition related to the network topology is established for solving resilient bipartite consensus by using system transformation. A numerical simulation illustrates the effectiveness of the result.
- 5 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 65 (12) , 2012-2016
Bipartite Consensus in Networks of Agents With Antagonistic Interactions and Quantization
This paper deals with the consensus problem in network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic quantizer accuracy under connected and structurally balanced topology and the states of all agents asymptotically converge to zero under connected and structurally unbalanced topology. In addition, finite-time bipartite consensus is considered for single-integrator agents with binary quantized information. The simulation results are given to demonstrate the effectiveness of the theoretical results.
- 5 March 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems II: Express Briefs
- Vol. 65 (12) , 2012-2016
Bipartite Consensus in Networks of Agents With Antagonistic Interactions and Quantization
This paper deals with the consensus problem in network of agents with cooperative and antagonistic interactions subject to quantization. By employing the techniques from nonsmooth analysis, we prove that all agents can be guaranteed to asymptotically reach bipartite consensus for any logarithmic quantizer accuracy under connected and structurally balanced topology and the states of all agents asymptotically converge to zero under connected and structurally unbalanced topology. In addition, finite-time bipartite consensus is considered for single-integrator agents with binary quantized information. The simulation results are given to demonstrate the effectiveness of the theoretical results.
- 2 April 2012
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 45 (3) , 579-588
Finite-time consensus of multiple second-order dynamic agents without velocity measurements
This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results.
- 2 April 2012
- Published by Taylor & Francis in International Journal of Systems Science
- Vol. 45 (3) , 579-588
Finite-time consensus of multiple second-order dynamic agents without velocity measurements
This article considers the finite-time consensus of multiple second-order dynamic agents without velocity measurements. A feasible protocol under which each agent can only obtain the measurements of its position relative to its neighbours is proposed. By applying the graph theory, Lyapunov theory and the homogeneous domination method, some sufficient conditions for finite-time consensus of second-order multi-agent systems are established under the different kinds of communication topologies. Some examples are presented to illustrate the effectiveness of the theoretical results.