Erratum to "Consensus seeking over directed networks with limited information communication" [Automatica 49 (2) (2013) 610-618]
نویسندگان
چکیده
a School of Science, Anhui University of Science and Technology, Huainan 232001, Anhui Province, PR China b Department of Automation, Shanghai Jiao Tong University, Shanghai 200240, PR China c Key Laboratory of System Control and Information Processing, Ministry of Education of China, Shanghai 200240, PR China d Charles L. Brown Department of Electrical and Computer Engineering, University of Virginia, P.O. Box 400743, Charlottesville, VA 22904-4743, USA
منابع مشابه
Consensus Networks over Finite Fields
This work studies consensus strategies for networks of agents with limited memory, computation, and communication capabilities. We assume that agents can process only values from a finite alphabet, and we adopt the framework of finite fields, where the alphabet consists of the integers {0, . . . , p − 1}, for some prime number p, and operations are performed modulo p. Thus, we define a new clas...
متن کاملThe Role of Online Social Networks in Users' Everyday-Life Information Seeking
Background and Aim: Considering the increasing number of users who interact with online social networks, it can be inferred that these networks have become an essential part of users' lives and play different roles in their everyday life. Therefore, the present study aims to explore the role of these networks in users' everyday-life information seeking. Method: This research is an applied resea...
متن کاملStochastic consensus seeking with communication delays
This paper investigates the consensus problem of dynamical networks of multi-agents where each agent can only obtain noisy and delayed measurements of the states of its neighbors due to environmental uncertainties and communication delays. We consider general networks with fixed topology and with switching (dynamically changing) topology, propose consensus protocols that take into account both ...
متن کاملThe deformed consensus protocol
This paper studies a generalization of the standard continuous-time consensus protocol, obtained by replacing the Laplacian matrix of the communication graph with the so-called deformed Laplacian. The deformed Laplacian is a second-degree matrix polynomial in the real variable s which reduces to the standard Laplacian for s equal to unity. The stability properties of the ensuing deformed consen...
متن کاملDistributed Consensus of Linear Multi-Agent Systems with Adaptive Dynamic Protocols
This paper considers the distributed consensus problem of multi-agent systems with general continuous-time linear dynamics. Two distributed adaptive dynamic consensus protocols are proposed, based on the relative output information of neighboring agents. One protocol assigns an adaptive coupling weight to each edge in the communication graph while the other uses an adaptive coupling weight for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Automatica
دوره 50 شماره
صفحات -
تاریخ انتشار 2014