期刊
INTERNATIONAL JOURNAL OF ROBUST AND NONLINEAR CONTROL
卷 28, 期 16, 页码 4900-4915出版社
WILEY
DOI: 10.1002/rnc.4289
关键词
distributed convex optimization; multi-agent system; switching network; time-varying communication delays; zero-gradient-sum algorithm
资金
- National Natural Science Foundation of China [61673077, 61273108]
- Basic and Advanced Research Project of Chongqing [CSTC2016jcyjA0361]
- Fundamental Research Funds for the Central Universities [106112017CDJQJ178827]
The distributed convex optimization problem subject to time-varying communication delays and switching network topologies is addressed in this paper. Based on continuous-time Zero-Gradient-Sum scheme, the novel distributed algorithms are proposed to minimize the global objective function which is composed of a sum of strictly convex local cost functions. In the fixed network topology case, by constructing a new Lyapunov-Krasovskii function, two explicit sufficient conditions for the maximum admissible time delay are derived to guarantee that all agents' states converge to the optimal solution. In the switching network topology case, the stability condition is derived by the common Lyapunov function theory. In addition, two sufficient conditions about the maximum admissible time delays are also derived for the fixed and switching weight-balanced network topologies, respectively. Several simulation tests are used to illustrate the effectiveness of our obtained theoretical results.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据