DocumentCode
2821578
Title
Consensus under general convexity
Author
Tuna, S. Emre ; Sepulchre, Rodolphe
Author_Institution
Univ. of Liege, Liege
fYear
2007
fDate
12-14 Dec. 2007
Firstpage
294
Lastpage
299
Abstract
A method is proposed to characterize contraction of a set through orthogonal projections. For discrete-time multi-agent systems, quantitative estimates of convergence (to a consensus) rate are provided by means of contracting convex sets. Required convexity for the sets that should include the values that the transition maps of agents take is considered in a more general sense than that of Euclidean geometry.
Keywords
discrete time systems; multi-robot systems; set theory; Euclidean geometry; convex sets; discrete-time multiagent systems; general convexity; orthogonal projections; quantitative estimates; transition maps; Communication switching; Communication system control; Convergence; Extraterrestrial measurements; Geometry; Linear systems; Multiagent systems; Network topology; Sensor fusion; USA Councils;
fLanguage
English
Publisher
ieee
Conference_Titel
Decision and Control, 2007 46th IEEE Conference on
Conference_Location
New Orleans, LA
ISSN
0191-2216
Print_ISBN
978-1-4244-1497-0
Electronic_ISBN
0191-2216
Type
conf
DOI
10.1109/CDC.2007.4434440
Filename
4434440
Link To Document