International audienceThis paper presents a new decentralized algorithm for the deployment and reconfiguration of a multi-agent formation in a convex bounded polygonal area when considering several outgoing agents. The system is deployed over a two-dimensional convex bounded area, each agent being driven by its own linear model predictive controller. At each time instant, the area is partitioned into Voronoi cells associated with each agent. Due to the movement of the agents, this partition is time-varying. The objective of the proposed algorithm is to drive the agents into a static configuration based on the Chebyshev center of each Voronoi cell. When some agents present a non-cooperating behavior (e.g. agents required for a different mission, faulty agents, etc.), they have to leave the formation by tracking a reference outside the system's workspace. The outgoing agents and their objective positions partition the convex bounded polygonal area into working regions. Each remaining agent will track a new objective point allowing it to avoid the trajectory of the outgoing agents. The computation of this objective position is based on the agent's safety region (i.e. the intersection of the contracted Voronoi cell and the contracted working region). When the outgoing agents have left the workspace, the remaining agents resume their deployment objective. Simulation results on a formation of a team of unmanned aerial vehicles are finally presented to validate the algorithm proposed in this paper when several agents leave the formation
