Consensus of Switched Multiagent Systems under Relative State Constraints

Qingling Wang

Complexity, 2017, vol. 2017, 1-7

Abstract:

The consensus problem is presented for the switched multiagent system (MAS), where the MAS is switched between continuous- and discrete-time systems with relative state constraints. With some standard assumptions, we obtain the fact that the switched MAS with relative state constraints can achieve consensus under both fixed undirected graphs and switching undirected graphs. Furthermore, based on the absolute average value of initial states, we propose sufficient conditions for consensus of the switched MAS. The challenge of this study is that relative state constraints are considered, which will make the consensus problem much more complex. One of the main contributions is that, for the switched MAS with relative state constraints, we explore the solvability of the consensus problem. Finally, we present two simulation examples to show the effectiveness of the results.

Date: 2017
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/8503/2017/5767495.pdf (application/pdf)
http://downloads.hindawi.com/journals/8503/2017/5767495.xml (text/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:5767495

DOI: 10.1155/2017/5767495

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().