Abstract
This paper examines a consensus problem in multiagent discrete-time systems, where each agent can exchange information only from its neighbor agents. A decentralized protocol is designed for each agent to steer all agents to the same vector. The design condition is expressed in the form of a linear matrix inequality. Finally, a simulation example is presented and a comparison is made to demonstrate the effectiveness of the developed methodology.
| Original language | English |
|---|---|
| Article number | 7738322 |
| Pages (from-to) | 509-513 |
| Number of pages | 5 |
| Journal | IEEE/CAA Journal of Automatica Sinica |
| Volume | 5 |
| Issue number | 2 |
| DOIs | |
| State | Published - Mar 2018 |
Bibliographical note
Publisher Copyright:© 2014 Chinese Association of Automation.
Keywords
- Consensus algorithms
- Discrete-time systems
- Linear matrix inequalities
- Multi-agent systems
ASJC Scopus subject areas
- Control and Systems Engineering
- Information Systems
- Artificial Intelligence
Fingerprint
Dive into the research topics of 'LMI consensus condition for discrete-time multi-agent systems'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver