Distributed continuous-time approximate projection protocols for shortest distance optimization problems
文献类型:期刊论文
作者 | Lou, Youcheng1,2![]() ![]() ![]() |
刊名 | AUTOMATICA
![]() |
出版日期 | 2016-07-01 |
卷号 | 69页码:289-297 |
关键词 | Distributed optimization Convex intersection Shortest distance optimization Approximate projection |
ISSN号 | 0005-1098 |
DOI | 10.1016/j.automatica.2016.02.019 |
英文摘要 | 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. |
资助项目 | National Natural Science Foundation of China[71401163] ; National Natural Science Foundation of China[61333001] ; Beijing Natural Science Foundation[4152057] ; Hong Kong Research Grants Council[419511] ; Hong Kong Scholars Program[XJ2015049] |
WOS研究方向 | Automation & Control Systems ; Engineering |
语种 | 英语 |
WOS记录号 | WOS:000377312800031 |
出版者 | PERGAMON-ELSEVIER SCIENCE LTD |
源URL | [http://ir.amss.ac.cn/handle/2S8OKBNM/22866] ![]() |
专题 | 系统科学研究所 |
通讯作者 | Lou, Youcheng |
作者单位 | 1.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China |
推荐引用方式 GB/T 7714 | Lou, Youcheng,Hong, Yiguang,Wang, Shouyang. Distributed continuous-time approximate projection protocols for shortest distance optimization problems[J]. AUTOMATICA,2016,69:289-297. |
APA | Lou, Youcheng,Hong, Yiguang,&Wang, Shouyang.(2016).Distributed continuous-time approximate projection protocols for shortest distance optimization problems.AUTOMATICA,69,289-297. |
MLA | Lou, Youcheng,et al."Distributed continuous-time approximate projection protocols for shortest distance optimization problems".AUTOMATICA 69(2016):289-297. |
入库方式: OAI收割
来源:数学与系统科学研究院
浏览0
下载0
收藏0
其他版本
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。