Tuna, SE and Sepulchre, R (2007) Consensus under general convexity. In: UNSPECIFIED pp. 294-299..Full text not available from this repository.
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. © 2007 IEEE.
|Item Type:||Conference or Workshop Item (UNSPECIFIED)|
|Divisions:||Div F > Control|
|Depositing User:||Cron Job|
|Date Deposited:||15 Dec 2015 13:33|
|Last Modified:||12 Feb 2016 03:27|