Distributed Optimization of Second-Order Nonlinear Multiagent Systems With Event-Triggered Communication

In this article, we study the event-triggered distributed optimization problem of second-order nonlinear multiagent systems under undirected and connected communication topologies. To reduce the cost of information exchange in an optimization problem, a distributed event-triggered communication-base...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on control of network systems Jg. 8; H. 4; S. 1954 - 1963
Hauptverfasser: Li, Shiling, Nian, Xiaohong, Deng, Zhenhua
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Piscataway IEEE 01.12.2021
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:
Algorithms
Communication
Distributed optimization
event-triggered control
Liapunov functions
Multi-agent systems
Multiagent systems
Nonlinear control systems
Nonlinear systems
Optimization
Resource management
second-order systems
Topology
zeno behavior
ISSN:2325-5870, 2372-2533
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In this article, we study the event-triggered distributed optimization problem of second-order nonlinear multiagent systems under undirected and connected communication topologies. To reduce the cost of information exchange in an optimization problem, a distributed event-triggered communication-based algorithm is proposed. In an event-triggered mechanism, the information interaction process of the network is controlled by a set of trigger conditions. The trigger condition of each agent only requires its own state information and its neighboring agents' state information. Each agent updates its own states only at the triggering time. In order to achieve the optimal result of the optimization problem and reduce the cost of communicatio, we propose a distributed event-triggered algorithm based on gradient descent. Moreover, we analyze the convergence of the algorithm by constructing a suitable Lyapunov function. Furthermore, we prove that the Zeno behavior can be avoid. Finally, we provide examples to validate the effectiveness of the obtained result.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2021.3092832