.png){kind=icon}
返回
Distributed continuous-time approximate projection protocols for shortest distance optimization problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.automatica.2016.02.019.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we investigate a distributed shortest distance optimization problem for a multi-agent network to cooperatively minimize the sum of the quadratic distances from some convex sets, where each set is only associated with one agent. To deal with this optimization problem with projection uncertainties, we propose a distributed continuous-time dynamical protocol, where each agent can only obtain an approximate projection and communicate with its neighbors over a time-varying communication graph. First, we show that no matter how large the approximate angle is, system states are always bounded for any initial condition, and uniformly bounded with respect to all initial conditions if the inferior limit of the stepsize is greater than zero. Then, in both cases of nonempty and empty intersection of convex sets, we provide stepsize and approximate angle conditions to ensure the optimal convergence, respectively. Moreover, we also give some characterizations about the optimal solutions for the empty intersection case. (C) 2016 Elsevier Ltd. All rights reserved.
Keyword:
Distributed optimization
Convex intersection
Shortest distance optimization
Approximate projection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5.9
论文数:
1.2W
被引数:
5.2W
机构
引用论文
.png){kind=icon}
分享收藏
分享收藏
查看更多内容