Zhongkui Li

Zhongkui Li

Auto-generated profile, based on publicly available information

Zhongkui Li

Peking University

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 July 2018 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BCBin Cheng
Bin Cheng
ZLZhongkui Li
Zhongkui Li
This paper considers the distributed event-triggered consensus problem for general linear multi-agent networks. Both the leaderless and leader-follower consensus problems are considered. Based on the local sampled state or local output information, distributed adaptive event- triggered protocols are designed, which can ensure that consensus of the agents is achieved and the Zeno behavior is excluded by showing that the interval between any two triggering events is lower bounded by a strictly positive value. Compared to the previous related works, our main contribution is that the proposed adaptive event-based protocols are fully distributed and scalable, which do not rely on any global information of the network graph and are independent of the networks scale. In these event-based protocols, continuous communications are not required for either control laws updating or triggering functions monitoring.

9 December 2011 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
ZLZhongkui Li
Zhongkui Li
WRWei Ren
Wei Ren
XLXiangdong Liu
Xiangdong Liu
MFMengyin Fu
Mengyin Fu

7 September 2017 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
ZLZhenhong Li
Zhenhong Li
Zhengtao DingZhengtao Ding
Zhengtao Ding
JSJunyong Sun
Junyong Sun
ZLZhongkui Li
Zhongkui Li
This note considers the distributed optimization problem on directed graphs with nonconvex local objective functions and the unknown network connectivity. A new adaptive algorithm is proposed to minimize a differentiable global objective function. By introducing dynamic coupling gains and updating the coupling gains using relative information of system states, the nonconvexity of local objective functions, unknown network connectivity, and the uncertain dynamics caused by locally Lipschitz gradients are tackled concurrently. Consequently, the global asymptotic convergence is established when the global objective function is strongly convex and the gradients of local objective functions are only locally Lipschitz. When the communication graph is strongly connected and weight-balanced, the algorithm is independent of any global information. Then, the algorithm is naturally extended to unbalanced directed graphs by using the left eigenvector of the Laplacian matrix associated with the zero eigenvalue. Several numerical simulations are presented to verify the results.

29 January 2019 in IEEE Transactions on Automatic Control
Verified
Journal Article
Closed access
BCBin Cheng
Bin Cheng
ZLZhongkui Li
Zhongkui Li

27 May 2014 in International Journal of Robust and Nonlinear Control
Verified
Journal Article
Closed access
PDF file
ZLZhongkui Li
Zhongkui Li
ZDZhisheng Duan
Zhisheng Duan
WRWei Ren
Wei Ren
GFGang Feng
Gang Feng

26 September 2018 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
BCBin Cheng
Bin Cheng
ZLZhongkui Li
Zhongkui Li
This paper considers the distributed event-triggered consensus control problem for a network of linear systems subject to bounded uncertainties satisfying the matching condition. Due to the existence of nonidentical uncertainties, the multiagent system studied in this paper is essentially heterogeneous, and the event-triggered consensus problem of which is much more challenging than that of homogeneous linear networks in the existing works. We propose a static nonsmooth event-triggered protocol that includes a nonlinear term to ensure that consensus is achieved and the Zeno behavior is excluded. To avoid the undesirable chattering effect caused by the nonsmooth protocol, we design a static continuous event-based protocol, which can guarantee that the consensus error is ultimately bounded and the upper bound of the consensus error can be made satisfactorily small by choosing properly the design parameters. We also design a continuous adaptive event-triggered protocol that includes time-varying weights into both the control law and the triggering function. Contrary to the event-triggered protocols in the previous related works, the adaptive event-based protocol is fully distributed and scalable, whose design does not require any global information of the network graph. Besides, all the event-triggered protocols in this paper do not need continuous communications among neighboring agents in either control laws' updating or triggering conditions' monitoring.