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 control for a class of networks of dynamic agents. (English) Zbl 1266.93013
Summary: In this paper, the consensus problems for networks of dynamic agents are investigated. The agent dynamics is adopted as a typical point mass model based on the Newton’s law. The average-consensus problem is proposed for such class of networks, which includes two aspects, the agreement of the states of the agents and the convergence to zero of the speeds of the agents. A linear consensus protocol for such networks is established for solving such a consensus problem that includes two parts, a local speed feedback controller and the interactions from the finite neighbours. Two kinds of topology are discussed: one is fixed topology, the other is switching one. The convergence analysis is proved and the protocol performance is discussed as well. The simulation results are presented that are consistent with our theoretical results.
MSC:
93A14Decentralized systems
68T42Agent technology (AI aspects)
94C15Applications of graph theory to circuits and networks
93C30Control systems governed by other functional relations