zbMATH — the first resource for mathematics

Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
Distributed consensus for multiagent systems with communication delays and limited data rate. (English) Zbl 1234.68034
Summary: This paper considers the average consensus problem for multiagent networks with communication delays and limited data rate. On the one hand, communication delays often exist in information acquisition and transmission; on the other hand, only limited state information of agents can be transmitted to their neighbors at each time step due to bandwidth constraints. The average consensus problem becomes much more complicated when both delays and data-rate constraints are to be considered. In this paper, a distributed consensus protocol is proposed based on dynamic encoding and decoding. It is shown that for a connected network, as long as the time delays are bounded, the average consensus can be achieved with a finite communication data rate. In particular, it is shown that merely a one-bit information exchange between each pair of adjacent agents at each time step suffices to guarantee the average consensus.
68M14Distributed systems
68Q85Models and methods for concurrent and distributed computing
68W15Distributed algorithms
68M10Network design and communication of computer systems