Flocking motion in swarms with limited sensing radius and heterogeneous input constraints

Abstract

This paper addresses the flocking motion problem for swarms of agents with two restrictions: limited communication/detection ranges and different input constraints. In this problem, the distance between pairs of agents determines if a communication/detection link exists among them, while each agent has a different control action bound. We use the notion of proximity graph to model communication/detection between agents and provide distributed controllers designed for leaderless and leader-followers flocking motion scenarios. Our proposed designs preserve the connectivity of the proximity graph while the control effort satisfies the bound of each particular agent. Unlike previous results, our protocols take advantage of the group’s input heterogeneity to use agents with a greater capacity to compensate for neighbors that are less capable of meeting the group’s requirements. Additionally, our designs are based only on local state errors and are robust to non-modeled edge failures. To illustrate the effectiveness of our proposal, we use numerical simulations of different flocking scenarios.