root.pdf (1.93 MB)
Download file

Distributed Resource Allocation over Time-varying Balanced Digraphs with Discrete-time Communication

Download (1.93 MB)
journal contribution
posted on 19.11.2021, 14:28 by Lanlan Su, Mengmou Li, Vijay Gupta, Graziano Chesi
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 inter-event 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.

History

Citation

IEEE Transactions on Control of Network Systems, 2021, https://doi.org/10.1109/TCNS.2021.3112770

Author affiliation

School of Engineering

Version

AM (Accepted Manuscript)

Published in

IEEE Transactions on Control of Network Systems

Publisher

IEEE

issn

2325-5870

Acceptance date

16/09/2021

Copyright date

2021

Available date

19/11/2021

Notes

Early access

Language

en