Relative controllability of multiagent systems with pairwise different delays in states

Abstract

In this manuscript, relative controllability of leader–follower multiagent systems with pairwise different delays in states and fixed interaction topology is considered. The interaction topology of the group of agents is modeled by a directed graph. The agents with unidirectional information flows are selected as leaders, and the others are followers. Dynamics of each follower obeys a generic time-invariant delay differential equation, and the delays of agents, which satisfy a specified condition, are different one another because of the degeneration or burn-in of sensors. With a neighbor-based protocol steering, the dynamics of followers become a compact form with multiple delays. Solution of the multidelayed system without pairwise matrices permutation is obtained by improving the method in the references, and relative controllability is established via Gramian criterion. Further rank criterion of a single delay system is dealt with. Simulation illustrates the theoretical deduction.

Structural controllability of multi‐agent systems with directed switching topologies

“…Controllability of MASs is a fundamental problem of distributed cooperative control, which is firstly introduced by Tanner [3] and has achieved lots of important results (see earlier studies [4][5][6], etc). Controllability of MASs is concerning the ability that we steer the group of followers from any initial configuration to any terminal configuration with inner information interactions among agents in a finite time by manipulating a small number of leaders [7,8].…”

Controllability of multi-agent systems with input and communication delays

“…Whereas, almost the existed literature concerning structural controllability of the structured systems ignores the time delay although it is a very common phenomenon in mechanical engineering, information technology, economics, etc. (see more in [21,24]). In fact, from [23,30] we know that for a system with delay, controllability on some time interval does not imply that on any time interval.…”

Necessary and sufficient conditions for mean‐square bounded consensus of multiagent systems with additive noise

“…In order to control the research cost and solve the problem of large number and complex structure of agents, an unbiased gradient technique is proposed in [15]. In addition, time delay and switching topologies will also affect the consensus of MASs [16][17][18].…”