Cluster Consensus on Discrete-Time Multi-Agent Networks

المؤلفون المشاركون

Xiao, Li
Liao, Xiaofeng
Wang, Huiwei

المصدر

Abstract and Applied Analysis

العدد

المجلد 2012، العدد 2012 (31 ديسمبر/كانون الأول 2012)، ص ص. 1-11، 11ص.

الناشر

Hindawi Publishing Corporation

تاريخ النشر

2012-10-22

دولة النشر

مصر

عدد الصفحات

11

التخصصات الرئيسية

الرياضيات

الملخص EN

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.

نمط استشهاد جمعية علماء النفس الأمريكية (APA)

Xiao, Li& Liao, Xiaofeng& Wang, Huiwei. 2012. Cluster Consensus on Discrete-Time Multi-Agent Networks. Abstract and Applied Analysis،Vol. 2012, no. 2012, pp.1-11.
https://search.emarefa.net/detail/BIM-459485

نمط استشهاد الجمعية الأمريكية للغات الحديثة (MLA)

Xiao, Li…[et al.]. Cluster Consensus on Discrete-Time Multi-Agent Networks. Abstract and Applied Analysis No. 2012 (2012), pp.1-11.
https://search.emarefa.net/detail/BIM-459485

نمط استشهاد الجمعية الطبية الأمريكية (AMA)

Xiao, Li& Liao, Xiaofeng& Wang, Huiwei. Cluster Consensus on Discrete-Time Multi-Agent Networks. Abstract and Applied Analysis. 2012. Vol. 2012, no. 2012, pp.1-11.
https://search.emarefa.net/detail/BIM-459485

نوع البيانات

مقالات

لغة النص

الإنجليزية

الملاحظات

Includes bibliographical references

رقم السجل

BIM-459485