This paper addresses the formation control problem without collisions for multiagent systems. A general solution is proposed for the case of any number of agents moving on a plane subject to communication graph composed of cyclic paths. The control law is designed attending separately the convergence to the desired formation and the noncollision problems. First, a normalized version of the directed cyclic pursuit algorithm is proposed. After this, the algorithm is generalized to a more general class of topologies, including all the balanced formation graphs. Once the finite-time convergence problem is solved we focus on the noncollision complementary requirement adding a repulsive vector field to the previous control law. The repulsive vector fields display an unstable focus structure suitably scaled and centered at the position of the rest of agents in a certain radius. The proposed control law ensures that the agents reach the desired geometric pattern in finite time and that they stay at a distance greater than or equal to some prescribed lower bound for all times. Moreover, the closed-loop system does not exhibit undesired equilibria. Numerical simulations and real-time experiments illustrate the good performance of the proposed solution.

SUMMARYIn this paper, a general solution to the formation control problem without collisions for first-order multi-agent systems is proposed. The case of an arbitrary number of mobile agents on a plane with saturated input velocity is analysed. Besides, conditions on the communication graph among agents are relaxed to the only requirement of containing a directed spanning tree. This general approach is an extended result from the simpler case of combinations of cyclic pursuit communication graphs. The proposed solution to this problem is designed in two steps. First, the asymptotic convergence in the absence of collisions is ensured. After this, the non-collision problem is faced by analysing the most general possible geometrical scenario which can lead to collision among agents. Discontinuous vector fields with unstable counterclockwise focus behaviour are applied by every agent in order to repel each other. Numerical simulations illustrate the performance of the proposed scheme.

This paper deals with the formation control problem without collisions for second-order multi-agent systems. We propose a control strategy which consists of a bounded attractive component to ensure convergence to a specific geometrical pattern and a complementary repulsive component to guarantee collision-free rearrangement. For convergence purposes, it is assumed that the communication graph contains at least a directed spanning tree. The avoidance complementary component is formed by applying repulsive vector fields with unstable focus structure. Using the well-known input-to-state stability property a control law for second-order agents is derived in a constructive manner starting from the first-order case. We consider that every agent is able to detect the presence of any other agent in the surrounding area and also can measure and share both position and velocity with his predefined set of neighbours. The resulting control law ensures the convergence to the desired geometrical pattern without collisions during the transient behaviour, as well as bounded velocities and accelerations. Numerical simulations are provided to show the performance and effectiveness of the proposed strategy.

No abstract

No abstract