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)
Tracking control for multi-agent consensus with an active leader and variable topology. (English) Zbl 1117.93300
Summary: We consider a multi-agent consensus problem with an active leader and variable interconnection topology. The state of the considered leader not only keeps changing but also may not be measured. To track such a leader, a neighbor-based local controller together with a neighbor-based state-estimation rule is given for each autonomous agent. Then we prove that, with the proposed control scheme, each agent can follow the leader if the (acceleration) input of the active leader is known, and the tracking error is estimated if the input of the leader is unknown.

MSC:
93A13Hierarchical systems
93D05Lyapunov and other classical stabilities of control systems
93B52Feedback control
93C15Control systems governed by ODE
WorldCat.org
Full Text: DOI arXiv
References:
[1] Fax, A.; Murray, R. M.: Information flow and cooperative control of vehicle formations. IEEE transactions on automatic control 49, No. 9, 1453-1464 (2004)
[2] Godsil, C.; Royle, G.: Algebraic graph theory. (2001) · Zbl 0968.05002
[3] Horn, R.; Johnson, C.: Matrix analysis. (1985) · Zbl 0576.15001
[4] Jadbabaie, A.; Lin, J.; Morse, A. S.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE transactions on automatic control 48, No. 6, 998-1001 (2003)
[5] Lin, Z.; Broucke, M.; Francis, B.: Local control strategies for groups of mobile autonomous agents. IEEE transactions on automatic control 49, No. 4, 622-629 (2004)
[6] Merris, R.: Laplacian matrices of graphs: A survey. Linear algebra and applications 197, 143-176 (1994) · Zbl 0802.05053
[7] Olfati-Saber, R.; Murray, R. M.: Consensus problems in networks of agents with switching topology and time-delays. IEEE transactions on automatic control 49, No. 9, 1520-1533 (2004)
[8] Savkin, A.: Coordinated collective motion of groups of autonomous mobile robots: analysis of vicsek’s model. IEEE transactions on automatic control 49, No. 6, 981-983 (2004)