Graph Laplacian Potential and Lyapunov Functions for Multi-Agent Systems

Author(s):  
Frank L. Lewis ◽  
Hongwei Zhang ◽  
Kristian Hengster-Movric ◽  
Abhijit Das
Automatica ◽  
2015 ◽  
Vol 58 ◽  
pp. 39-42 ◽  
Author(s):  
Hongwei Zhang ◽  
Zhongkui Li ◽  
Zhihua Qu ◽  
Frank L. Lewis

Automatica ◽  
2018 ◽  
Vol 97 ◽  
pp. 316-326 ◽  
Author(s):  
Serhii Babenko ◽  
Michael Defoort ◽  
Mohamed Djemai ◽  
Serge Nicaise

2015 ◽  
Vol 16 (6) ◽  
pp. 429-448 ◽  
Author(s):  
Zhi-min Han ◽  
Zhi-yun Lin ◽  
Min-yue Fu ◽  
Zhi-yong Chen

Author(s):  
Guisheng Zhai ◽  
Shohei Okuno ◽  
Joe Imae ◽  
Tomoaki Kobayashi

A matrix inequality based design method for consensus problems in multi-agent systemsIn this paper, we study a consensus problem in multi-agent systems, where the entire system is decentralized in the sense that each agent can only obtain information (states or outputs) from its neighbor agents. The existing design methods found in the literature are mostly based on a graph Laplacian of the graph which describes the interconnection structure among the agents, and such methods cannot deal with complicated control specification. For this purpose, we propose to reduce the consensus problem at hand to the solving of a strict matrix inequality with respect to a Lyapunov matrix and a controller gain matrix, and we propose two algorithms for solving the matrix inequality. It turns out that this method includes the existing Laplacian based method as a special case and can deal with various additional control requirements such as the convergence rate and actuator constraints.


2015 ◽  
Vol 10 (8) ◽  
pp. 845 ◽  
Author(s):  
Youness Chaabi ◽  
R. Messoussi ◽  
V. Hilaire ◽  
Y. Ruichek ◽  
K. Lekdioui ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document