Further Improvements on Non-Negative Edge Consensus of Networked Systems
研究了无向图下正网络系统使用状态反馈协议的非负边一致性问题，提出了改进的充分必要条件，并开发了半定规划算法，通过实例证明比现有结果更不保守。
In this article, the non-negative edge consensus problem is addressed for positive networked systems with undirected graphs using state-feedback protocols. In contrast to existing results, the major contributions of this work included: 1) significantly improved criteria of consequentiality and non-negativity, therefore leading to a linear programming approach and 2) necessary and sufficient criteria giving rise to a semidefinite programming approach. Specifically, an improved upper bound is given for the maximum eigenvalue of the Laplacian matrix and the (out-) in-degree of the degree matrix, and an improved consensuability and non-negativevity condition is obtained. The sufficient condition presented only requires the number of edges of a nodal network without the connection topology. Also, with the introduction of slack matrix variables, two equivalent conditions of consensuability and non-negativevity are obtained. In the conditions, the system matrices, controller gain, as well as Lyapunov matrices are separated, which is helpful for parameterization. Based on the results, a semidefinite programming algorithm for the controller is readily developed. Finally, a comprehensive analytical and numerical comparison of three illustrative examples is conducted to show that the proposed results are less conservative than the existing work.