A New Algorithm for Motion Control of Leader-Follower Formation of Mobile Autonomous Agents

This paper presents a motion control strategy for a rigid and constraint consistent formation that can be modeled by a directed graph whose each vertex represents individual agent kinematics and each of directed edges represents distance constraints maintained by an agent, called follower, to its neighbouring agents. A rigid and constraint consistent graph is called persistent graph. A persistent graph is minimally persistent if it is persistent and no edge can be removed without losing its persistence. An acyclic (free of cycles in its sensing pattern) minimally persistent graph of Leader-Follower structure has been considered here and which can be constructed from an initial LeaderFollower seed (initial graph with two vertices, one is Leader and another one is First Follower and one edge in between them is directed towards Leader) by Henneberg sequence (a procedure of growing a graph) containing only vertex additions. A set of nonlinear optimization based decentralized control laws for mobile autonomous point agents in plane have been proposed. An infinitesimal deviation in formation shape created by continuous motion of Leader is compensated by corresponding continuous motion of other agents fulfilling the shortest path criteria.