Distributed dynamic event-triggered algorithm with positive minimum inter-event time for convex optimisation problem
In this study, we investigate the distributed convex optimisation problem of the multi-agent system over an undirected network, in which the global objective function is the sum of all the local cost functions and the local cost function of each agent is only known by itself. In order to save the co...
Saved in:
| Published in: | International journal of control Vol. 95; no. 5; pp. 1363 - 1370 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Abingdon
Taylor & Francis
04.05.2022
Taylor & Francis Ltd |
| Subjects: | |
| ISSN: | 0020-7179, 1366-5820 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this study, we investigate the distributed convex optimisation problem of the multi-agent system over an undirected network, in which the global objective function is the sum of all the local cost functions and the local cost function of each agent is only known by itself. In order to save the computation and communication resources, the above optimisation problem is addressed by designing two zero-gradient-sum algorithms with state-based dynamic event-triggered mechanism, where the information communication only occurs at some discrete triggering time instants. The Zeno behaviour of the above event-triggered control scheme is excluded by the existence of the positive minimum inter-event time (MIET). The convergence is proved based on the Lyapunov method. Finally, we illustrate and evaluate the effectiveness of the proposed event-triggered algorithms through numerical experiments on simulated. |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ISSN: | 0020-7179 1366-5820 |
| DOI: | 10.1080/00207179.2020.1854866 |