Event-Triggered Quantized Communication-Based Distributed Convex Optimization

A NOVEL distributed algorithm based on multiple agents with continuous-time dynamics is proposed for a convex optimization problem where the objective function is the summation of local objective functions and the state of each agent is subject to a convex constraint set. Considering the limited bandwidth of the communication channels, we introduce a dynamic quantizer for each agent. To further save on communication costs, we develop an event-based broadcasting scheme for each agent. In comparison with algorithms that rely on continuous communication, the proposed algorithm serves to save communication expenditure by exploiting temporal and spatial aspects. Though a joint design of dynamic quantizers and event-trigger functions are under mild conditions, the states of the agents asymptotically approach the global optimal point with an adjustable error bound without incurring Zeno behavior.