On f-Consensus Problems Solvable via Distributed Convex Optimization Methods

This paper is concerned with the distributed f-consensus problem in a multi-agent system, the aim of which is to achieve consensus on a particular value relating to function, f, of the labels owned by the agents. The paper utilizes distributed convex optimization as a tool to solve a series of f-consensus problems including network size estimation, k-th smallest value consensus and leader-following consensus (information sharing). The effectiveness of the theoretical results is verified by means of numerical simulations.