Reaching an Optimal Consensus: Dynamical Systems that Compute Intersections of Convex Sets
Preprint
Abstract
In this paper, multi-agent systems minimizing a sum of objective functions, where each component is only known to a particular node, is considered for continuous-time dynamics with time-varying interconnection topologies. Assuming that each node can observe a convex solution set of its optimization component, and the intersection of all such sets is nonempty, the considered optimization problem is converted to an intersection computation problem. By a simple distributed control rule, the considered multi-agent system with continuous-time dynamics achieves not only a consensus, but also an optimal agreement within the optimal solution set of the overall optimization objective. Directed and bidirectional communications are studied, respectively, and connectivity conditions are given to ensure a global optimal consensus. In this way, the corresponding intersection computation problem is solved by the proposed decentralized continuous-time algorithm. We establish several important properties of the distance functions with respect to the global optimal solution set and a class of invariant sets with the help of convex and non-smooth analysis.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- Global target aggregation and state agreement of nonlinear multi-agent systems with switching topologiesAutomatica, 2009
- On decentralized negotiation of optimal consensusAutomatica, 2008
- Distributed Consensus in Multi-vehicle Cooperative Control2008
- Motion Coordination with Distributed InformationIEEE Control Systems, 2007
- State consensus for multi-agent systems with switching topologies and time-varying delaysInternational Journal of Control, 2006
- Information Flow and Cooperative Control of Vehicle FormationsIEEE Transactions on Automatic Control, 2004
- Consensus Problems in Networks of Agents With Switching Topology and Time-DelaysIEEE Transactions on Automatic Control, 2004
- Algebraic Graph Theory2001
- Analysis of recursive stochastic algorithmsIEEE Transactions on Automatic Control, 1977
- The method of projections for finding the common point of convex setsUSSR Computational Mathematics and Mathematical Physics, 1967