# Formation Control

Formation control is a network control algorithm which allows a collection of robots to form and maintain a particular shape in a distributed manner. This document provides a mathematical derivation and an implementation of sample code to implement formation control for the Robotarium. It summarizes the mathematics behind a decentralized formation control algorithm and highlights the transfer of the formal specification to the Robotarium’s MATLAB API. Additionally, this document contains experimental data from the Robotarium’s robots and a video.

# Problem Statement

Consider a group of agents, where we define the state of each agent as . This particular algorithm models each agent with the single-integrator dynamics

where is the control input to agent . The goal of formation control is to drive the agents to a translationally independent formation that satisfies a set of given constraints. For this particular problem, the static communication topology is given by an undirected graph and a function that models the desired inter-agent distances. To achieve a particular formation specified by and , the communication topology enforced by must be rigid, a concept discussed in [1], [2], and [3]. For , the rigidity requirements to ensure a translationally independent formation are

\begin{equation} \dfrac{\text{car}(E)}{2} = 2N - 3 \label{eq:rigidity} \end{equation}

where represents the number of edges in an undirected graph (i.e., ). Intuitively, (\ref{eq:rigidity}) implies the removal of three degrees of freedom, which is required for translational independence in .

# Solution

The proposed algorithm utilizes the edge tension energy described in [4]. The total edge tension energy of the system may be written as

where is the neighborhood set to agent induced by the graph topology . [4] shows that the control law

can be used to drive the agents to the desired configuration, with the proper choice of . This control law can be seen as a gradient descent on the edge tension energy of the agents. Let be defined as

where is the desired distance between two agents defined by , and is a gain. The gradient of this function is

substituting this result into the agent’s dynamics yields

which is a decentralized formation control law.

# Implementation

Using the previously defined algorithm and the Robotarium’s provided MATLAB interface, we implemented the formation control algorithm described by (\ref{eq:formation-control-law}). The code snippet below demonstrates the transfer of (\ref{eq:formation-control-law}) into the Robotarium’s MATLAB API.

# Deployment

We deployed this algorithm onto the Robotarium with agents and the formation specification

where each index is the distance constraint placed on edges and . Note that induces edges, which ensures rigidity by (\ref{eq:rigidity}). Figure 1 displays the communication topology and the trajectories of the robots during the experiment. Note that the agents achieve the desired rectangular formation. The erratic motion in some agents’ trajectories stems from the rigidity of the formation, which restricts the agents’ movements.

**Fig 1. Physical robots’ trajectories (dashed) and communication topology (solid) during the deployment of the decentralized formation control algorithm onto the Robotarium**

# References

[1] R. Olfati-Saber and R. M. Murray, “Distributed structural stabilization
and tracking for formations of dynamic multi-agents,” *Proc. 41st IEEE
Conf. Decision Control*, vol. 1, pp. 209–215, Dec. 2002.

[2] R. W. Beard, J. R. Lawton, and F. Y. Hadaegh, “A coordination architecture
for spacecraft formation control,” *IEEE Trans. Control Syst. Technol.*,
vol. 9, no. 6, pp. 777–790, Nov. 2001

[3] T. Eren, P. Belhumeur, B. Anderson, and A. Morse, “A framework for
maintaining formations based on rigidity,” in *Proc. 2002 IFAC Congr.*,
pp. 2752–2757.

[4] M. Ji and M. Egerstedt. Distributed Coordination Control of Multi-Agent Systems While Preserving Connectedness. *IEEE Transactions on Robotics*, Vol. 23, No. 4, pp. 693-703, Aug. 2007.