CSpace  > 系统科学研究所
Distributed continuous-time approximate projection protocols for shortest distance optimization problems
Lou, Youcheng1,2; Hong, Yiguang2; Wang, Shouyang2
2016-07-01
Source PublicationAUTOMATICA
ISSN0005-1098
Volume69Pages:289-297
AbstractIn 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.
KeywordDistributed optimization Convex intersection Shortest distance optimization Approximate projection
DOI10.1016/j.automatica.2016.02.019
Language英语
Funding ProjectNational 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 Research AreaAutomation & Control Systems ; Engineering
WOS SubjectAutomation & Control Systems ; Engineering, Electrical & Electronic
WOS IDWOS:000377312800031
PublisherPERGAMON-ELSEVIER SCIENCE LTD
Citation statistics
Cited Times:21[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/22867
Collection系统科学研究所
Affiliation1.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
Recommended Citation
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.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Lou, Youcheng]'s Articles
[Hong, Yiguang]'s Articles
[Wang, Shouyang]'s Articles
Baidu academic
Similar articles in Baidu academic
[Lou, Youcheng]'s Articles
[Hong, Yiguang]'s Articles
[Wang, Shouyang]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Lou, Youcheng]'s Articles
[Hong, Yiguang]'s Articles
[Wang, Shouyang]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.