1. What have the authors contributed in "Distributed optimal in-network resource allocation algorithm design via a control theoretic approach" ?
In this paper, the authors consider an in-network optimal resource allocation problem with multiple demand equations.. The authors propose a novel distributed continuous-time algorithm that solves the problem over strongly connected and weight-balanced digraph network topologies when the local cost functions are strongly convex.. The authors also discuss the extension of their convergence guarantees to dynamically changing topologies.. Finally, the authors show that if the network is an undirected connected graph, they can guarantee stability and convergence of their algorithm for problems involving local convex functions.. The design and analysis of their algorithm are carried out using a control theoretic approach.. The authors demonstrate their results through a numerical example.
read more
2. What are the future works mentioned in the paper "Distributed optimal in-network resource allocation algorithm design via a control theoretic approach" ?
Finally the authors showed that if the communication topology is a connected graph, the convergence to a point in the set of minimizers of the problem of interest can be extended to convex local cost functions.. Future work includes rigorous treatment of use of exact penalty methods to extend the proposed algorithm to solve allocation problems with limited local resources at each agent.. As future work the authors will also study the event-triggered communication implementation of their proposed algorithm and characterize its privacy preservation properties.
read more
