ZLZhijie Li

Zhijie Li

*This is an algorithmically generated author record based on publicly available information.

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


Zhijie Li has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Event-triggered low-complexity consensus control for uncertain nonlinear multi-agent systems

    by Zhijie Li, Ding Li, Changda Zhang, Guopin Liu, Yafeng Li, Yana Yang

  • Open Access

    Low-Complexity Event-Triggered Control for Nonlinear Systems with Full-State Constraints and Unknown Control Directions

    by Zhijie Li, Ding Li, Changda Zhang, Guopin Liu, Yafeng Li, YaNa Yang

    This paper focuses on the problem of full-state constraints prescribed performance tracking control for uncertain nonlinear systems with unknown control directions. General full-state constraint control imposes strict constraints on the feasibility conditions of virtual controllers, such that the parameters in the control scheme are difficult to design. Unlike existing studies, this paper proposes a weak-conservatism full-state constraint control method, which eliminates the restrictions on the feasibility conditions of virtual controllers. Moreover, a new approach based on the direction function is developed to address the issue of unknown control directions, avoiding the control peaking issue in Nussbaum gain techniques. Meanwhile, by introducing nonlinear transformation functions, the original constrained systems are converted into new unconstrained tracking error systems, which eliminate the limitation of initial conditions. Furthermore, based on event-triggered method, this paper proposes a fixed-time low-complexity control strategy, such that the tracking error enters a predefined set within fixed time, reduces the update times of the controller, and avoids the problem of differential calculation explosion caused by backstepping control. Finally, simulation examples are provided to demonstrate the superiority of the proposed algorithm.

  • Pole-Dynamics Attacks Detection in Multiagent Systems by Distributed Additive Watermarking

    by Changda Zhang, Xuangfeng Shi, Zhijie Li, Dajun Du, Changchun Hua

    This article investigates the stealthy distributed pole-dynamics attacks (dPDAs) detection for multiagent systems (MASs) by distributed additive watermarking (DAW). First, the limitation of traditional MASs for dPDAs is revealed, where dPDAs cannot be detected. Second, unlike the well-established single-agent additive watermarking, to eliminate the side effect of watermarking signal on system state and enable dPDAs detection, the proposed DAW adds watermarking to the control signal of any agent for transmission and removes watermarking of the control signal after receiving it. Meanwhile, the covariance of the watermarking signal in DAW for all agents is different from each other to enable compromised links isolation. Furthermore, the relationship between the dPDAs detection performance and DAW is quantified in the sense of expectation, where the dPDAs detection performance is directly proportional to the sum of the watermarking covariance of the compromised links. Third, leveraging the relationship between dPDAs detection performance and DAW, a DAW-based link isolation scheme is proposed to accurately isolate the compromised links by comparing with the detection function and its approximation, where the approximation of the detection function is iteratively calculated on all possible attack links combination for the compromised agent. As a result, the adverse impacts of dPDAs on MASs are mitigated. Finally, simulation results are conducted to validate the theoretical results.


  • Resource-Sensitive Stealthy and Consensus-Kept State-Destructive Cyber Attacks for Multiagent Systems

    by Changda Zhang, Xiaoye An, Zhijie Li, Dajun Du, Changchun Hua

    Multiagent systems (MASs) are increasingly vulnerable to cyber attacks that exploit limited system resource to evade detection while causing disruptions. This paper investigates the resource-sensitive cyber attacks for MASs. Firstly, distributed replay attack (dRAs) and distributed pole-dynamics attack (dPDAs) are proposed, where dRAs utilize available resources of agents historical measurements, and dPDAs utilize available resources of agent parameter. Secondly, the relationship between available resources and stealthiness of cyber attack are revealed, where both dRAs and dPDAs can be with 0-stealthiness under different available resources. Thirdly, the relationship between available resources and destructiveness of cyber attack are revealed, where dRAs is not with ck-s-destructiveness (i.e., cyber attacks can achieve state trajectory destructiveness without disrupting consensus), because the state trajectory can only be driven to the historical one due to requiring historical measurements. Oppositely, dPDAs can be with ck-s-destructiveness, where the state consistency trajectory can be driven to any one designed by the attacker due to requiring agent parameter. Finally, numerical examples are provided to verify the effectiveness of the proposed attacks. Note to Practitioners—Many critical engineering applications (such as smart grids, autonomous networks and industrial automation) can be modeled as MASs, where multiple interconnected agents collaborate to achieve common goals. The wide range of applications and the reliance on communication networks have made MASs vulnerable to distributed cyber attacks. Nevertheless, most researches on distributed cyber attacks against MASs simply make the directly extension of centralized cyber attacks against singleagent systems, and involve the partial available resources of MASs. When designing cyber attacks for MASs, the resources for the cyber attack are crucial and closely related, where different available resources of cyber attacks may guarantee different degree of stealthiness and destructiveness. Resource-sensitive cyber attacks is a significant research direction. Thus, this paper proposes resource-sensitive stealthy and consensus-kept state-destructive cyber attacks for MASs. Finally, the effectiveness of the proposed cyber attacks is illustrated by a simulation example under a scenario on Internet of vehicles.


  • Distributed Nodes Detection and Event-Triggered Links Isolation of Stealthy Attacks in Multiagent Systems by Topology-Oriented Watermarking

    by Changda Zhang, Jingbo Wang, Zhijie Li, Dajun Du, Changchun Hua

    The communication links of multiagent systems (MASs) could be compromised by stealthy cyberattacks. To solve the problem, this article proposes distributed nodes detection and event-triggered links isolation of stealthy attacks in MASs by topology-oriented watermarking (TOW). First, the limitation of traditional MASs against distributed pole-dynamics attacks (dPDAs) is revealed. Second, different from existing watermarking methods for single-agent systems, a novel TOW method with four optional parameters selection schemes is proposed for distributed nodes detection in MASs, where it is proved that only one of optional parameters selection schemes can simultaneously possesses complexity and resistance to collusive dPDAs. Moreover, TOW combines the advantages of multiplicative and additive watermarking to achieve dPDAs detection. Furthermore, the positive relationship between dPDAs detection performance and the coupling factor of attack topology, attack signal, and TOW parameters is quantified. Third, a new TOW-based event-triggered links isolation algorithm incorporating multiple link-deletion observers is proposed, where TOW is leveraged to trigger running of link-deletion observers. It is proved that the compromised links can be correctly isolated. Finally, the simulation results verify our proposed scheme.


  • DGM: Decentralized GTO-MPC for Multiquadrotor Trajectory Planning in Cluttered Environments

    by Lele Xi, Hao Guo, Ning Zhou, Zhijie Li, Yue Wei, Changchun Hua

    Motion planning for multiquadrotor in cluttered environments presents a significant challenge, particularly due to the need for precise navigation through static obstacles, dynamic obstacles, and the simultaneous interaction with other agents. In this article, a decentralized and asynchronous trajectory planning method is proposed to generate collision-free trajectories. We utilize a guided time-optimal model predictive control (GTO-MPC) algorithm to achieve trajectory planning. First, a dynamic programming (DP)-based controller is employed to design boundary state-constrained primitives (BSCPs), which are then utilized to generate a motion primitive library. Then, the algorithm integrates a neural network (NN) with gradient-free differential evolution (DE) to perform rolling optimization, coupled with a collision detection mechanism for local replanning in response to environmental changes. We conducted multiple simulations and experiments to compare performance in obstacle-free and cluttered environments. The results demonstrate that our distributed method effectively generates safe, smooth, and deadlock-free motion trajectories for multiquadrotor systems, significantly enhancing their motion planning capabilities.

  • Top Cited Papers

    Distributed Output Feedback Prescribed Performance Control for High-Order Nonlinear Multi-Agent Systems

    by Zhijie Li, Xiaofei Wang, Hao Guo, Lele Xi, Guopin Liu, Yafeng Li, Changchun Hua

    This paper presents an output feedback prescribed performance control method for a class of high-order nonlinear uncertain multiagent systems. General prescribed performance consensus control for multiagent systems requires that the initial consensus error is constraining within a boundary value. Unlike existing works, the conservative condition of prescribed performance consensus control for multiagent systems is relaxed as the consensus error is independent of the initial state. In this condition, we employ a control scheme with improved prescribed performance to constraint the transient behavior of the system. By designing reduce order dynamic gain K-filter, the state variables of the systems are reconstructed. Based on the baskstepping method and dynamic surface control technology, we introduce an innovative prescribed performance event-triggered approach aimed at ensuring prescribed performance levels for both transient and steady-state aspects of consensus control and reducing the communication bandwidth resource. Furthermore, we rigorously demonstrated through the Lyapunov function that all agents can achieve consensus with the leader driven by the controller. The simulation results have demonstrated the effective tracking performance of the developed control approach. Finally, the effectiveness and reliability of the proposed control strategy are verified through the successful execution of multi-QUAVs formation encirclement control.