Distributed convex optimization via continuous time coordination algorithms with discrete time interactions

Solmaz S. Kia, Jorge Cortés, and Sonia Martínez
Automatica, 59 (2015) 112-119

Abstract:

This paper presents distributed algorithmic solutions that employ opportunistic inter-agent communication to achieve dynamic average consensus. In our solutions each agent is endowed with a local criterion that enables it to determine whether to broadcast its state to its neighbors. Our starting point is a continuous-time distributed coordination strategy that, under continuous-time communication, achieves practical asymptotic tracking of the dynamic average of the time-varying agents' reference inputs. Then, for this algorithm, depending on the directed or undirected nature of the time-varying interactions and under suitable connectivity conditions, we propose two dierent distributed event-triggered communication laws that prescribe agent communications at discrete time instants in an opportunistic fashion. In both cases, we establish positive lower bounds on the inter-event times of each agent and characterize their dependence on the algorithm design parameters. This analysis allows us to rule out the presence of Zeno behavior and characterize the asymptotic correctness of the resulting implementations. Several simulations illustrate the results.

File: main.pdf

Bib-tex entry:

@article{SSK-JC-SM:15-auto-a,
author = {S. S. Kia and J. Cort\'es and S. Mart{\'\i}nez},
title = {Distributed convex optimization via continuous time coordination algorithms with discrete time interactions},
journal= {Automatica},
year = {2015},
volume = {59},
pages = {112--119}
}