Distributed discrete-time optimization of heterogeneous multi-agent networks with unbounded position constraints and nonconvex velocity constraints

2021 ◽  
Vol 466 ◽  
pp. 92-101
Author(s):  
Lipo Mo ◽  
Zixin Zhang ◽  
Yongguang Yu
Author(s):  
Lulu Li ◽  
Daniel W. C. Ho ◽  
Yuanyuan Zou ◽  
Chi Huang ◽  
Jianquan Lu

2012 ◽  
Vol 2012 ◽  
pp. 1-11 ◽  
Author(s):  
Li Xiao ◽  
Xiaofeng Liao ◽  
Huiwei Wang

Nowadays, multi-agent networks are ubiquitous in the real world. Over the last decade, consensus has received an increasing attention from various disciplines. This paper investigates cluster consensus for discrete-time multi-agent networks. By utilizing a special coupling matrix and the Kronecker product, a criterion based on linear matrix inequality (LMI) is obtained. It is shown that the addressed discrete-time multi-agent networks achieve cluster consensus if a certain LMI is feasible. Finally, an example is given to demonstrate the effectiveness of the proposed criterion.


Sign in / Sign up

Export Citation Format

Share Document