A unifying convex analysis and switching system approach to consensus with undirected communication graphs
A unifying convex analysis and switching system approach to consensus with undirected communication graphs
复制标题
DOI：
10.1016/j.automatica.2019.108598
复制
发表时间：
2020-01-01
期刊：
影响因子：
6.4
通讯作者：
Sanfelice, Ricardo G.
中科院分区：
文献类型：
--
作者：
Goebel, Rafal;Sanfelice, Ricardo G.
研究了凸函数的多个连续时间自治最速下降动力学之间的切换问题。如果凸函数的极小值存在，则证明了凸函数的公共极小值的完全解的收敛性。凸函数不需要是平滑的，并且动态可以受到约束。由于公共极小化器可以表示由无向通信图建模的多智能体系统中的一致性，因此作为特殊情况，推导了关于渐近一致性的几个已知结果。扩展到一个随时间变化的情况下。(C)2019由Elsevier Ltd.出版
Switching between finitely many continuous-time autonomous steepest descent dynamics for convex functions is considered. Convergence of complete solutions to common minimizers of the convex functions, if such minimizers exist, is shown. The convex functions need not be smooth and the dynamics may be subject to constraints. Since the common minimizers may represent consensus in a multi-agent system modeled by an undirected communication graph, several known results about asymptotic consensus are deduced as special cases. Extension to a time-varying case is included. (C) 2019 Published by Elsevier Ltd.