zbMATH — the first resource for mathematics

Examples
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.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
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)
Consensus of second-order discrete-time multi-agent systems with nonuniform time-delays and dynamically changing topologies. (English) Zbl 1175.93078
Summary: This paper studies the consensus problem of multi-agent systems with nonuniform time-delays and dynamically changing topologies. A linear consensus protocol is introduced to realize local control strategies for these second-order discrete-time agents. By model transformations and applying the properties of nonnegative matrices, sufficient conditions are derived for state consensus of the systems. It is shown that arbitrary bounded time-delays can safely be tolerated, even though the communication structures between agents dynamically change over time and the corresponding directed graphs may not have spanning trees. Finally, a numerical example is included to illustrate the obtained results.
MSC:
93B50Synthesis problems
93C55Discrete-time control systems
93A14Decentralized systems