Abstract
Consensus problem of multi-agent systems with communication channel constraint is studied by providing a special Laplacian of directed graphs in this paper. Communication delays as one kind of channel constrains in multi-agent systems have been discussed in the recent literature. Different from those works, consensus problem with communication channel constraint on signal amplitude is addressed in this paper. Our work shows that the consensus can be obtained as long as some state-dependent switching parameters are introduced into the consensus protocol. It is shown that the system given by the proposed protocol can reach globally asymptotically consensus and that the system can also achieve a generalized average-consensus if the directed graph is balanced. An example has been proposed to illustrate the effectiveness of the method.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the SICE Annual Conference |
| Pages | 108-112 |
| Number of pages | 5 |
| Publication status | Published - 2012 |
| Event | 2012 51st Annual Conference on of the Society of Instrument and Control Engineers of Japan, SICE 2012 - Akita Duration: 2012 Aug 20 → 2012 Aug 23 |
Other
| Other | 2012 51st Annual Conference on of the Society of Instrument and Control Engineers of Japan, SICE 2012 |
|---|---|
| City | Akita |
| Period | 12/8/20 → 12/8/23 |
Keywords
- communication channel constraint
- Consensus protocol
- graph Laplacians
- multi-agent systems
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Control and Systems Engineering
- Computer Science Applications