<p>This paper investigates the bipartite consensus problem for multi-agent systems via uncertain pinning control under directed signed switching topologies. The agent dynamics incorporate randomly varying nonlinearities and parameter uncertainties to reflect more realistic environmental influences. To handle the uncertain connectivity between the leader and followers induced by switching topology, a distributed pinning control protocol is developed. The main contributions are summarized in two theorems. A suitable multiple Lyapunov function is constructed, and <i>M</i>-matrix theory is employed for multi-agent systems without and with time-varying delays. Sufficient conditions for achieving bipartite consensus are established in the form of linear matrix inequalities (LMIs). These conditions ensure that all followers converge asymptotically to either the leader’s state or its opposite. The convergence direction depends on their subgroup affiliation. Finally, the effectiveness of the proposed control strategy is demonstrated through theoretical analysis and supported by numerical simulations.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Bipartite consensus of multi-agent systems with randomly varying nonlinearities via uncertain pinning control under directed signed switching topologies

  • Xin Sui,
  • Fei Wang,
  • Yongqing Yang

摘要

This paper investigates the bipartite consensus problem for multi-agent systems via uncertain pinning control under directed signed switching topologies. The agent dynamics incorporate randomly varying nonlinearities and parameter uncertainties to reflect more realistic environmental influences. To handle the uncertain connectivity between the leader and followers induced by switching topology, a distributed pinning control protocol is developed. The main contributions are summarized in two theorems. A suitable multiple Lyapunov function is constructed, and M-matrix theory is employed for multi-agent systems without and with time-varying delays. Sufficient conditions for achieving bipartite consensus are established in the form of linear matrix inequalities (LMIs). These conditions ensure that all followers converge asymptotically to either the leader’s state or its opposite. The convergence direction depends on their subgroup affiliation. Finally, the effectiveness of the proposed control strategy is demonstrated through theoretical analysis and supported by numerical simulations.