Distributed Resource Allocation Over Time-Varying Balanced Digraphs With Discrete-Time Communication

This work is concerned with the problem of distributed resource allocation in continuous-time setting but with discrete-time communication over infinitely jointly connected and balanced digraphs. We provide a passivity-based perspective for the continuous-time algorithm, based on which an intermittent communication scheme is developed. Particularly, a periodic communication scheme is first derived through analyzing the passivity degradation over output sampling of the distributed dynamics at each node. Then, an asynchronous distributed event-triggered scheme is further developed. The sampled-based event-triggered communication scheme is exempt from Zeno behavior as the minimum interevent time is lower bounded by the sampling period. The parameters in the proposed algorithm rely only on local information of each individual node, which can be designed in a truly distributed fashion.