Obstacle avoidance flocking motion in multi-agent systems with limited sensing radius and heterogeneous input constraints.

This paper addresses the leaderless and leader-followers flocking motion problems of multi-agent systems in a workspace with obstacles. We consider inertial agents with equally limited communication radius and heterogeneous input constraints. Using the notion of proximity graphs, we provide distributed controllers to induce the desired flocking behaviour. Unlike previous results, our controller designs do not require predicted states or a target determination scheme and allow edge deletions. Also, by taking advantage of the group's heterogeneity, our controllers allow agents with less restrictive input constraints to compensate for the control effort that their less capable neighbours cannot provide. We illustrate the effectiveness of our proposals through numerical simulations. [ABSTRACT FROM AUTHOR]