Consensus pursuit of heterogeneous multi-agent systems under a directed acyclic graph

This paper is concerned with the cooperative target pursuit problem by multiple agents based on directed acyclic graph. The target appears at a random location and moves only when sensed by the agents,and agents will pursue the target once they detect its existence. Since the ability of each agent may be different,we consider the heterogeneous multi-agent systems. According to the topology of the multi-agent systems,a novel consensus-based control law is proposed,where the target and agents are modeled as a leader and followers,respectively. Based on Mason’s rule and signal flow graph analysis,the convergence conditions are provided to show that the agents can catch the target in a finite time. Finally,simulation studies are provided to verify the effectiveness of the proposed approach.