Consensus control for linear systems with optimal energy cost

Consensus control for linear systems with optimal energy cost
复制标题

DOI:
10.1016/j.automatica.2018.03.044
复制
发表时间:
2016-12
期刊:
Autom.
影响因子:
--
通讯作者:
Han Zhang;Xiaoming Hu
Han Zhang;Xiaoming Hu
中科院分区:
其他
文献类型:
--
作者:
Han Zhang;Xiaoming Hu

文献摘要

被引文献

相似文献

In this paper, we design an optimal energy cost controller for linear systems asymptotic consensus given the topology of the graph. The controller depends only on relative information of the agents. Since finding the control gain for such controller is hard, we focus on finding an optimal controller among a classical family of controllers which is based on Algebraic Riccati Equation (ARE) and guarantees asymptotic consensus. Through analysis, we find that the energy cost is bounded by an interval and hence we minimize the upper bound. In order to do that, there are two classes of variables that need to be optimized: the control gain and the edge weights of the graph and are hence designed from two perspectives. A suboptimal control gain is obtained by choosing Q= 0 in the ARE. Negative edge weights are allowed, and the problem is formulated as a Semi-definite Programming (SDP) problem. Having negative edge weights means that “competitions” between the agents are allowed. The motivation behind this setting is to have a better system performance. We provide a different proof compared to Thunberg and Hu (2016) from the angle of optimization and show that the lowest control energy cost is reached when the graph is complete and with equal edge weights. Furthermore, two sufficient conditions for the existence of negative optimal edge weights realization are given. In addition, we provide a distributed way of solving the SDP problem when the graph topology is regular.