23,966 research outputs found
Distributed convex optimization via continuous-time coordination algorithms with discrete-time communication
This paper proposes a novel class of distributed continuous-time coordination
algorithms to solve network optimization problems whose cost function is a sum
of local cost functions associated to the individual agents. We establish the
exponential convergence of the proposed algorithm under (i) strongly connected
and weight-balanced digraph topologies when the local costs are strongly convex
with globally Lipschitz gradients, and (ii) connected graph topologies when the
local costs are strongly convex with locally Lipschitz gradients. When the
local cost functions are convex and the global cost function is strictly
convex, we establish asymptotic convergence under connected graph topologies.
We also characterize the algorithm's correctness under time-varying interaction
topologies and study its privacy preservation properties. Motivated by
practical considerations, we analyze the algorithm implementation with
discrete-time communication. We provide an upper bound on the stepsize that
guarantees exponential convergence over connected graphs for implementations
with periodic communication. Building on this result, we design a
provably-correct centralized event-triggered communication scheme that is free
of Zeno behavior. Finally, we develop a distributed, asynchronous
event-triggered communication scheme that is also free of Zeno with asymptotic
convergence guarantees. Several simulations illustrate our results.Comment: 12 page
Distributed Event-Triggered Control for Asymptotic Synchronization of Dynamical Networks
This paper studies synchronization of dynamical networks with event-based
communication. Firstly, two estimators are introduced into each node, one to
estimate its own state, and the other to estimate the average state of its
neighbours. Then, with these two estimators, a distributed event-triggering
rule (ETR) with a dwell time is designed such that the network achieves
synchronization asymptotically with no Zeno behaviours. The designed ETR only
depends on the information that each node can obtain, and thus can be
implemented in a decentralized way.Comment: 8 pages, 2 figues, 1 tabl
- …