کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
4948374 1439611 2016 6 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A combinatorial necessary and sufficient condition for cluster consensus
ترجمه فارسی عنوان
شرایط ترکیبی ضروری و کافی برای توافق خوشه ای
کلمات کلیدی
توافق خوشه، سیستم عامل چندگانه، خطی سوئیچ سیستم، کنترل تعاونی،
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی
In this letter, cluster consensus of discrete-time linear multi-agent systems is investigated. A set of stochastic matrices P is said to be a cluster consensus set if the system achieves cluster consensus for any initial state and any sequence of matrices taken from P. By introducing a cluster ergodicity coefficient, we present an equivalence relation between a range of characterization of cluster consensus set under some mild conditions including the widely adopted inter-cluster common influence. We obtain a combinatorial necessary and sufficient condition for a compact set P to be a cluster consensus set. This combinatorial condition is an extension of the avoiding set condition for global consensus, and can be easily checked by an elementary routine. As a byproduct, our result unveils that the cluster-spanning tree condition is not only sufficient but necessary in some sense for cluster consensus problems.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Neurocomputing - Volume 216, 5 December 2016, Pages 611-616
نویسندگان
,