JOURNAL ARTICLE

A Distributed Algorithm with Event-Triggered Communication for Resource Allocation Problem

Abstract

This paper focuses on the distributed resource allocation problem in continuous-time multi-agent systems over undirected networks, in which each agent has a local convex cost function only known by itself and all agents are required to converge to the global optimizer of the sum of the local cost functions under constraints. A gradient-based distributed algorithm is proposed for solving the problem. Furthermore, the step-size of gradient is a constant. A sufficient condition is given which guarantees that the proposed algorithm can achieve the global optimization. Moreover, in order to avoid continuous communication, an event-triggered communication control strategy is designed. Finally, an example of the economic dispatch problem in smart grid is presented to validate and illustrate the feasibility of the proposed algorithm.

Keywords:
Computer science Mathematical optimization Resource allocation Convex function Distributed algorithm Constant (computer programming) Grid Function (biology) Optimization problem Multi-agent system Event (particle physics) Distributed computing Economic dispatch Convex optimization Regular polygon Algorithm Mathematics Artificial intelligence Computer network

Metrics

6
Cited By
0.78
FWCI (Field Weighted Citation Impact)
17
Refs
0.74
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Distributed Control Multi-Agent Systems
Physical Sciences →  Computer Science →  Computer Networks and Communications
Neural Networks Stability and Synchronization
Physical Sciences →  Computer Science →  Computer Networks and Communications
Stability and Control of Uncertain Systems
Physical Sciences →  Engineering →  Control and Systems Engineering
© 2026 ScienceGate Book Chapters — All rights reserved.