Volume 30, Issue 4 pp. 1719-1732
RESEARCH ARTICLE

Sum-of-squares–based consensus verification for directed networks with nonlinear protocols

Quanyi Liang

Quanyi Liang

Department of Mechanical Engineering, National University of Singapore, Singapore

Search for more papers by this author
Chong-Jin Ong

Corresponding Author

Chong-Jin Ong

Department of Mechanical Engineering, National University of Singapore, Singapore

Chong-Jin Ong, Department of Mechanical Engineering, National University of Singapore, Singapore 117575.

Email: [email protected]

Search for more papers by this author
Zhikun She

Zhikun She

SKLSDE, LMIB and School of Mathematics and Systems Science, Beihang University, Beijing, China

Search for more papers by this author
First published: 30 December 2019
Citations: 7
All authors contributed equally to the work.

Summary

In this paper, we investigate the consensus verification problem of nonlinear agents in a fixed directed network with a nonlinear protocol. Inspired by the classical Lipschitz-like condition, we introduce a more relax condition for the dynamics of the nonlinear agents. This condition is motivated via the construction of general Lyapunov functions for achieving asymptotic consensus. Especially, for agents where dynamics are described by polynomial function of the states, our consensus criterion can be converted to a sum of squares (SOS) programming problem, solvable via semidefinite programming tools. Of interest is that the scale of the resulting SOS programming problem does not increase as the size of the network increases, and thus, the applicability to analyze consensus of large-scale networks is promising. Finally, an example is given to illustrate the effectiveness of our theoretical results.

The full text of this article hosted at iucr.org is unavailable due to technical difficulties.