Abstract In this note, an effort is put forward to make two revisions with respect to mistakes in the derivations of Khan et al. (2019). The main result of Khan et al. (2019) claimed that the Laplacian matrix L is a symmetric matrix. However, the paper only assumed that the jointly connected graph contains a spanning tree. Clearly, L is a symmetric matrix if and only if the joint graph is strongly connected. Hence, the basic Assumption needs to be revised. Also, some equations need to be modified without treating L as a symmetric matrix. This revision will affect the stability conditions of switching topologies, which leading thereby to redesign the parameters λ and μ appeared in Theorem 4.1 (Khan et al., 2019). In addition, there is a mistake when the authors designing real reference systems. The output matrix C = [ C v , 0 ] should be C = [ N C v , 0 ] , otherwise the follower systems will track a wrong trajectory pattern.

中文翻译：

---

评论“非线性异构多智能体系统与交换网络的输出同步”：[Systems & Control Letters 125 (2019) 45-50]

摘要 在这篇笔记中，试图对 Khan 等人的推导中的错误进行两次修改。(2019)。Khan 等人的主要结果。(2019) 声称拉普拉斯矩阵 L 是一个对称矩阵。但是，该论文仅假设联合连接图包含生成树。显然，L 是对称矩阵当且仅当联合图是强连通的。因此，需要修改基本假设。此外，需要修改一些方程而不将 L 视为对称矩阵。此修订将影响开关拓扑的稳定性条件，从而导致重新设计定理 4.1（Khan 等人，2019）中出现的参数 λ 和 μ。此外，作者在设计真实参考系统时存在错误。输出矩阵 C = [ C v ,