A survey of multi-agent formation control

TL;DR: A formation control problem in which a target formation is defined with both distance and signed area constraints, to drive spatially distributed agents to reach a unique target rigid formation shape with desired inter-agent distances is discussed.

TL;DR: This paper provides and proves a sufficient and necessary condition of achieving the directed graphical affine localizability, and it only needs that the leaders have a generic configuration and the followers are accessible to the subset of leaders.

TL;DR: The authors propose the distributed dynamic adaptive state feedback and adaptive output feedback protocols for driving followers into the moving convex hull spanned by leaders, which are independent of any global information, and hence are fully distributed.

TL;DR: A novel adaptive finite-time disturbance observer (AFTDO) is incorporated into the proposed control strategy that enhances its robustness to the environmental disturbance and contributes to smaller computation load and facilitates the implementation of the algorithm in ocean engineering.

TL;DR: A distinctive feature of this work is to address consensus problems for networks with directed information flow by establishing a direct connection between the algebraic connectivity of the network and the performance of a linear consensus protocol.

TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.

TL;DR: In this article, an approach based on simulation as an alternative to scripting the paths of each bird individually is explored, with the simulated birds being the particles and the aggregate motion of the simulated flock is created by a distributed behavioral model much like that at work in a natural flock; the birds choose their own course.

TL;DR: The Laplacian of a Graph and Cuts and Flows are compared to the Rank Polynomial.