Consensus for cooperative–competitive network systems: An impulsive perspective

Abstract

AbstractUsually, hypotheses involving cooperative interactions and continuous interplay among interacting agents may result in somewhat conservatism, drastically hurdling potential about interpretations of prevalent aggregation phenomena arising in both nature and practical application. Of interest uncovered in this article is the cooperative–competitive consensus problems for multi‐agent systems by leverage of impulsive‐based control perspective. We first discuss the possibility of quantifying interaction relation of the agents and the description of cooperative–competitive phenomena that capture massive interest recently. Specifically, the former is done by algebraic graph theory, following the same research avenue as the convention; while the cooperative–competitive information is described by some nonzero scaling parameter. We shall pursue the tie that enables to anchor the consensus of participating agents, without depending on the signed graph theory. Subsequently, a manner relying on the local information is carried out to induce the consensus error to circumvent the global information. Then, consensus condition, in connection with the features of both continuous and impulsiveߚbased dynamics, is obtained, as well as several typical circumstances are also elaborated. Both the proposed consensus algorithms and the derived results are underpinned via a numerical study eventually.