An event-triggered quantization communication strategy for distributed optimal resource allocation

Taken limited communication resources in practical applications into consideration, this paper studies the distributed resource allocation problem for continuous-time multi-agent systems on switching networks. Transmission information among agents is quantized by a dynamic encoding/decoding scheme t...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Systems & control letters Ročník 180; s. 105619
Hlavní autoři: Cai, Xin, Zhong, Huiru, Li, Yanbiao, Liao, Junbo, Chen, Xingzhi, Nan, Xinyuan, Gao, Bingpeng
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 01.10.2023
Témata:
Distributed algorithm
Quantization
Resource allocation
Switching graphs
Quantization
Switching graphs
Distributed algorithm
Resource allocation
ISSN:0167-6911, 1872-7956
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Taken limited communication resources in practical applications into consideration, this paper studies the distributed resource allocation problem for continuous-time multi-agent systems on switching networks. Transmission information among agents is quantized by a dynamic encoding/decoding scheme to reduce the amount of data transmitted in communication networks. Furthermore, an event-triggered communication scheme is designed to determine when to transmit quantized information to neighboring agents. Compared with the existing distributed event-triggered resource allocation algorithms, the proposed algorithm can reduce not only the communication frequency but also the amount of transmission data. Under mild conditions, all agents’ decisions asymptotically reach to the optimal allocation. It is analyzed that the proposed event-triggered quantization communication scheme is free of the Zeno behavior. A numerical example is given to verify the effectiveness of the proposed algorithm.
ISSN:0167-6911
1872-7956
DOI:10.1016/j.sysconle.2023.105619