Inverse agreement algorithms with application to swarm dispersion for multiple nonholonomic agents

We propose an inverse agreement control strategy for multiple nonholonomic agents that forces the team members to disperse in the workspace in a distributed manner. Both the cases of an unbounded and a circular bounded workspace are considered. In the first case, we show that the closed loop system reaches a configuration in which the minimum distance between any pair of agents is larger than a specific lower bound. It is proved that this lower bound coincides with the agents' sensing radius. In the case of a bounded workspace, the control law is modified to force the agents to remain within the workspace boundary throughout the closed loop system evolution. Moreover the proposed control guarantees collision avoidance between the team members. The results are supported through relevant computer simulations.