.png){kind=icon}
.png){kind=icon}
Return
Distributed multi-agent optimization via event-triggered based continuous-time Newton-Raphson algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neucom.2017.09.079.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper investigates the problem of distributed convex optimization for multi-agent networks, where the objective function is the summation of local and multidimensional cost functions associated to private agents. To begin with, we develop a continuous-time Newton-Raphson algorithm, which features reduced communication, fast convergence and distributed execution, to solve such a problem. To avoid continuous control signal updating, an asynchronous event-triggered scheme is proposed for each agent. As a consequence, the continuous-time Newton-Raphson can be implemented with discrete-time control law driven by our designed trigger conditions, which is more suitable for practical applications. In addition, the triggering instants for each agent are not influenced by its neighboring agents' latest triggering instants, resulting in reduced total triggering events. It is proved that each agent can exponentially converge to the global optimal point by implementing the proposed algorithms and the proposed event-triggered scheme is naturally free of Zeno behavior. Several examples illustrate our results. (c) 2017 Elsevier B.V. All rights reserved.
Keywords:
Convex optimization
Multi-agent
Event-triggered
Distributed algorithm
Newton-Raphson
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.