- About this Journal ·
- Abstracting and Indexing ·
- Aims and Scope ·
- Annual Issues ·
- Article Processing Charges ·
- Articles in Press ·
- Author Guidelines ·
- Bibliographic Information ·
- Citations to this Journal ·
- Contact Information ·
- Editorial Board ·
- Editorial Workflow ·
- Free eTOC Alerts ·
- Publication Ethics ·
- Reviewers Acknowledgment ·
- Submit a Manuscript ·
- Subscription Information ·
- Table of Contents

Journal of Robotics

Volume 2010 (2010), Article ID 360925, 12 pages

http://dx.doi.org/10.1155/2010/360925

## Cohesive Motion Control Algorithm for Formation of Multiple Autonomous Agents

^{1}Centre of Industrial Electronics & Robotics, Department of Electrical Engineering, National Institute of Technology Rourkela, Rourkela 768018, India^{2}Intelligent Systems Research Laboratory, College of Engineering, University of Saskatchewan, Saskatoon, SK, Canada S7N 5A9

Received 2 October 2009; Accepted 31 May 2010

Academic Editor: Noriyasu Homma

Copyright © 2010 Debabrata Atta et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

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 agent. 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 which can be constructed from an initial Leader-Follower 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 two dimensional plane have been proposed. An infinitesimal deviation in formation shape created continuous motion of Leader is compensated by corresponding continuous motion of other agents fulfilling the shortest path criteria.

#### 1. Introduction

There are several examples of coordinated team work of mobile agents in nature like food foraging by a group of ants, flocking birds, fish schooling for protection from enemies, and so forth. These examples give us a lesson that a particular task accomplished by a single mobile autonomous agent (like fish and birds) may be done more efficiently by a group of agents if they perform in a collaborative manner. During last thirty years or more, this fact has motivated many researchers in the field of control and automation significantly to contribute in several similar applications in industry. In some particular applications during their motion as whole, autonomous agents (e.g., robots, vehicles, etc.) need to maintain a particular geometrical shape for cohesive motion, called formation which satisfies some constraints like desired distance between two agents, desired angle between two lines joining two agents each. Examples of these types of formations are found in collective attack by a group of combat aircraft, search/rescue/surveillance/cooperative transportation by a troop of robots, underwater exploration/underwater inspection (like pipeline inspection) by a group of Autonomous Underwater Vehicles, attitude alignment of clusters of satellites, air traffic management system, automated highway system, and so forth.

In the area of formation control of autonomous agents like robots, the motion control strategies may be either a centralized one or it could be a decentralized control. In centralized mode of control [1, 2], the command for all agents of the group are assigned by the central command control board or a designated group leader for monitoring and control of all agents to guide them be placed at desired position. The centralized formation control could be a good scheme for a small group of robots, when it is implemented with a single computer and a single sensor to monitor and control the entire group. Control of large number of robots in a formation requires greater computational capacity and large amount communication. Due to these problems, decentralized control is recommended when formation involves a large number of agents. In the decentralized mode of control [3–5], one agent of the group can be a leader and others are followers (or each agent of the group can be a leader and follower except a designated group leader and the two outmost agents) and as a follower, each agent generates its own commands autonomously (i.e., control law for each agent is provided separately such that each agent works autonomously) based on the relative measurement only from its neighbours without the need of an external supervisor, and the whole purpose of the formation motion is achieved.

Although two types of basic control strategies are discussed in the last paragraph, motion control scheme for formation may be modified depending upon some factors like agent dynamics, interagent information exchange structure, control goals in different applications, and so forth.

Formations are modeled using *formation graph* whose each vertex represents individual agent kinematics and each edge represents interagent constraint (e.g., desired distance) that must be maintained during motion of formation. Specifically, graph is used to represent coordinated behaviour among agents. Depending upon the pattern of information exchange in that coordination, two types of graphs are possible, that is, *directed* and *undirected*.

In undirected formation graph both of any pair of agents, constrained by an edge have equal responsibility to satisfy the constraint. For example, distance between any pair of agents is sensed by both the agents; that is, sensing is distributed. Therefore, structure of undirected graph suffers from various disadvantages. One of those disadvantages is information-based instability [6], which happens due to possibility of difference in distances measured by noisy sensors of any pair of agents. Communication requirement among agents is more. Therefore, external observer-based centralized control strategy is best suited for undirected formation graph. Control law is mainly focused on rigidity property of formation.

Formation graph is *rigid* [7] if distance between any pair of agents remains constant during any continuous motion of formation. A graph is said to be *minimally rigid* if it is rigid and if there is no rigid graph having the same vertices but fewer edges.

In directed formation graph, only one (called *follower*) of any pair of agents, constrained by an edge has responsibility to satisfy the constraint. Therefore, decentralized control strategy is best suited for directed formation graph.

A graph is *constraint consistent* [8] if every agent is able to satisfy all the constraints on it provided all others are trying to do so. A formation that both rigid and constraint consistent is termed as *persistent *graph.*Persistence* is a generalization to directed graphs of the undirected notion of rigidity. A persistent graph is *minimally persistent* if it is persistent and if no edge can be removed without losing persistence.

However, focus in this paper is in development of control strategy for directed graph-based formation. There are several papers in which basics of directed formation graph-related issues are discussed [7–10]. Definitions and theorems [7–10] with regard to undirected and directed graphs included in Section 2.

Digraph is called acyclic when no cycle is present in its sensing pattern [6, 8]. Control scheme for cyclic formation is more complicated than acyclic formation. Minimally persistent formation of autonomous agents may be formed in two ways. First one is *leader-follower* graph architecture constructed from an initial leader-follower seed by Henneberg Sequence with standard vertex additions or edge splitting [11]. Leader-follower type minimally persistent graph is always acyclic. Another type of construction by sequence of specific operation elaborated in [9] such that every intermediate construction is also persistent. Minimally persistent graph constructed by this method may have cycles. In this paper, control strategies for only leader-follower type formation constructed from sequence of vertex addition is described.

Although a number of research works have been directed in the area of cyclic formation graph, but still there remains scope of further work. In [12], Anderson et al. have proposed a distance preservation-based control law when cycles contain in the formation graph.

In most recent works [13, 14] or some previous works [6], distributed control is provided with exploiting gradient control law for each autonomous agent in a formation separately. In [5], formation control strategy of leader-follower and three coleader structures is set up based on discrete-time motion equations considering decentralized approach. In [15], Anderson et al. analyzed control of leader-follower structure in continuous domain assuming linearized system for small motion and stability aspects are also discussed. However, we proceed for the control of leader-follower formation in a different way; that is, our approach is based on optimization of some distances.

In the present paper, we consider the motion control scheme of the *leader-follower* structure type persistent formation in continuous domain that is based on optimization of a set of nonlinear objective functions under a set of equality constraints where each objective function (corresponding to each agent) corresponds to a specific constraints separately, as control scheme considers a decentralized approach. With advent of high speed computational platforms the solution associated with optimization procedure in the control generation is possible.

This paper is organized as follows. In Section 2, application of graph theory in formation control has been discussed. Problem formulation for formation control of multiple autonomous agents has been included in Section 3 followed by the development of control law, simulation, and conclusion in Sections 4, 5, and 6, respectively.

#### 2. Application of Graph Theory in Formation Control

As briefly described about the graph theory in Section 1, it is observed that graph is the best way for proper understanding of information flow among agents in a formation. This makes groundwork for control engineers to design an efficient control scheme for the motion control of formation. In this paper, formation of leader-follower structure has been considered and it may be extended to any number of agents. Therefore, it is worthwhile to understand how a leader-follower type formation graph is built up from an arbitrarily chosen number of agents. In this section, at the outset the pertinent definitions and theorems given in [7–10] about the rigidity and persistence are reviewed and subsequently the procedure of creating a leader-follower formation for a case of four numbers of autonomous agents is described.

##### 2.1. Definitions Associated with Rigid Graph

###### 2.1.1. Infinitesimally Rigid Graph

A representation of an undirected graph with vertex set and edge set is a function , where is the dimension of Euclidean space. Representation is rigid if there exists such that for all realizations due to continuous deformations of distance set induced by and satisfying, (where, , where, ), there holds for all . We simply say this phenomenon as congruence relationship between and .

###### 2.1.2. Generically Rigid Graph

A graph is said to be generically rigid if almost all realizations due to continuous deformations are rigid. This definition of rigidity is to exclude some undesirable situations like certain collections of vertices are collinear during continuous deformations.

###### 2.1.3. Minimally Rigid Graph

A rigid graph is minimally rigid when no single edge can be removed without losing its rigidity.

###### 2.1.4. Laman’s Criteria (see [10])

If an undirected graph in with at least two vertices is rigid, then there exists a subset of edges such that = and any subgraph of with at least two vertices satisfies , where is number of vertices that are end-vertices of the edges in .

Lemma 1 (see [7]). *Let be a minimally rigid graph in and a subgraph of such that . Then, is minimally rigid.*

In directed graph, each agent is only aware of its own distance constraints and can move freely as long as these distance constraints are satisfied. Persistence is a directed notion and rigidity is an undirected notion. The properties of directed graphs are described below.

##### 2.2. Definitions Associated with Persistent Graph

Suppose, for a directed graph , desired distances for all , edge set where , vertex set, and a realization , then the following definitions are described.

###### 2.2.1. Active Edge

The edge is *active* if , that is, if the corresponding distance constraint is satisfied.

###### 2.2.2. Fitting Position of a Vertex

The position of a vertex is *fitting* for any desired distance set of , if it is not possible to increase the set of active edges leaving by changing the position of while maintaining the positions of other vertices unchanged. Specifically, the position of vertex , for a given realization , is fitting if there is no for which the condition elaborated below is strictly satisfied:

###### 2.2.3. Fitting Realization of a Graph

A realization of a graph is a fitting realization for a certain distance set if all the vertices are at fitting positions for .

###### 2.2.4. Constraint Consistent Graph

A realization of digraph is constraint consistent if there exists such that any realization fitting for the distance set induced by and satisfying is a realization of . A graph is generically constraint consistent if almost all realizations are constraint consistent.

###### 2.2.5. Persistent Graph

Realization of the digraph having desired distances for all is persistent if there exists such that every realization due to continuous deformation, fitting for the distance set induced by and satisfying is congruent to .

###### 2.2.6. Generically Persistent Graph

A graph is generically persistent if almost all possible realizations are persistent (same as elaborated in case of generically rigid).

Theorem 1 (see [8]). *A realization is persistent if and only if it is rigid and constraint consistent. **A graph is generically persistent if and only if it is generically rigid and constraint consistent.*

###### 2.2.7. Minimally Persistent Graph

A persistent graph is minimally persistent if it is persistent and if no edge can be removed without losing persistence.

Theorem 2 (see [8]). *A rigid graph is minimally persistent if and only if either of the two conditions elaborated below is satisfied. *(i)*Out of all vertices, each of three vertices has one outgoing edge and each of rest vertices has two outgoing edges*(ii)*Out of all vertices, one vertex has no outgoing edge; another one vertex has one outgoing edge and each of rest vertices has two outgoing edges.*

Theorem 3 (see [8]). *An acyclic digraph is persistent if all the conditions elaborated below are satisfied. **Out of all vertices, *(i)*one vertex has one outgoing edge. This vertex represents Leader,*(ii)*another vertex has one outgoing edge which must be incident to the Leader. This vertex represents first follower,*(iii)*each of rest vertices must have two or more number of outgoing edges.*

##### 2.3. Construction of Acyclic Minimally Persistent Graph

Acyclic minimally persistent graph is always constructed starting from a combination of two vertices, one is called leader and the other one is first follower, and an edge directed towards leader using Henneberg Sequence with only vertex additions.

##### 2.4. Henneberg Construction (Directed Case) Containing Vertex Addition

It describes the sequence of graphs , such that each graph can be obtained by a vertex addition starting from , where is number of vertices and is cardinality of vertex set of desired graph. Therefore, the procedure of drawing the graph using Henneberg sequence is described as(i)start with a directed edge between two vertices.The vertex towards which edge is directed is called leader and remaining vertex is called first follower. The combination of these two a vertex with a directed edge is called initial leader-follower seed,(ii)at each step of growing graph, add a new vertex,(iii)join the new vertex to two old vertices (corresponding to leader and first follower) via two new edges, directed towards old vertices.

Figure 1 shows the construction procedure of formation of four agents.

#### 3. Problem Formulation

For simplicity, we restrict our analysis only in quadrilateral formation of leader-follower structure taking into account four mobile autonomous point agents, in plane. This formation is shown in Figure 2. One among them is leader which has no outgoing edge; that is, it is free to move along a specified path and does not have any responsibility to maintain any distance constraint from other agents, the second one as the first follower which has one outgoing edge; that is, it requires to maintain only one desired distance constraint from the leader, the third one as ordinary follower-1 which has two outgoing edges; that is, it requires to maintain two distance constraints, one of which is directed towards leader and other one towards first follower, the fourth one as ordinary follower-2 which has two outgoing edges; that is, it requires to maintain two distance constraints, one of which is directed towards first follower and other one towards ordinary follower-1.

The different distance constraints among agents assumed are as follows: is the desired distance maintained by first follower from leader, is the desired distance maintained by ordinary follower-1 from first follower, is the desired distance maintained by ordinary follower-1 from leader, is the desired distance maintained by ordinary follower-2 from ordinary follower-1, and is the desired distance maintained by ordinary follower-2 from first follower.

*We assume the desired distances among the agents satisfy noncollinear condition such that at least three point agents do not form a straight line*.

*Assumptions. *(i) For simplicity, for each agent “”, the kinematic model [5] of unicycle nonholonomic point agent is considered as follows:
where with denotes, the position of th agent, , and denote the orientation and translational velocity of the th agent at each instant of time , respectively. is with respect to an earth-fixed coordinate coordinate system.

(ii) Each agent can measure its position with respect to earth-fixed coordinate system by proper sensor arrangement.

(iii) First follower has position information of leader only with respect to its own point body system by using an active sensor (e.g., sonar).

(iv) Ordinary follower-1 has position information of leader and first follower only with respect to its own point body system by using an active sensor (e.g., sonar).

(v) Ordinary follower-2 has position information of first follower and ordinary follower-1 only with respect to its own point body system by using an active sensor (e.g., sonar).

(vi) Each agent (except leader) can achieve the positions of neighbours w.r.t earth-fixed coordinate system from the relative informations of its neighbours and its own position w.r.t. earth-fixed coordinate system.

Now, the objective is to provide a control scheme for this triangular formation (starting from a non-collinear arrangement) such that during the motion of three robots for any mission, desired interagent distances are preserved.

#### 4. Development of Control Law

Here, we intend to develop set of decentralized control laws for overall formation. Therefore, for each agent, we provide separate control law for continuous movement in autonomous manner based on local knowledge only of direction of its neighbours. Control Law for each agent is derived by optimizing corresponding objective function with given constraints involving desired distance constraints of formation. The unknown variables to be solved are and coordinates (which are continuous function of time) of position (with respect to earth-fixed coordinate system) of corresponding agent for which objective function is derived.

*Assumptions. *(i) Interagent distances are sufficiently large so that initial collision among robots can be avoided.

(ii) Initially positions of robots are not collinear (already stated).

(iii) During motion of formation, failure of sensors do not occur.

(iv) There is no time delay in sensing.

(v) Control input in the form of translational velocity and angular velocity (discussed later in this section) calculated from final and initial position of any agent should be necessarily generated by controller of each agent.

*When all the agents of given formation completes movement to a new set of position coordinates from an old set of position coordinates during certain period of time such that desired distances among agents are preserved for both set of positions and not any other distance preserving position set is available in between these two position sets during motion, then the movement of formation from the old set to new set of positions is called one complete displacement of formation.*

Before proceeding to develop the control laws for all agents, it is assumed that at any time *t *each agent is maintaining its own distance constraints. Then how these agents move to their new positions for a complete displacement is discussed below.

##### 4.1. Control Law for Leader

Leader does not need to maintain any distance constraint from any other agent in formation. A specified control action is provided for its dynamics such that it moves along a specified path (trajectory); that is, each position (at each instant of time ) coordinate is known (preprogrammed (known)/unknown) to computational system of the leader. Suppose at time initial position coordinate for leader is assumed as (. Let the leader move to a new position , that is, the final position (rest point), in very small period of time *such that continuity preserves between * & ; that is, *the distance between these two positions is sufficiently small. *This motion of the leader and corresponding movement of the first follower is shown in Figure 3. According to Figure 2, , where , a vector field along the trajectory curve of the leader, and are unit vectors along and direction of the global coordinate system, and and . It should be noted that and are always on . Therefore, control input to reach its final position is
where, and .

The translational velocity control input during meter/second.

The angular velocity control input (rad./sec) during same period of time is

##### 4.2. Control Law for First Follower

It may be noted that first follower has one outgoing edge; that is, it has to maintain only one distance constraint (desired distance ) and that is to leader. Initial and final position coordinates for the leader are , , respectively. Then, first follower senses the disturbance in position of leader; that is, it senses error in desired distance constraint () by sensing the final position of the leader staying at its initial position . It tries to satisfy this distance constraint to leader. Therefore, suppose it moves to a rest point (final position) at the next instant of time after the instant during which the leader moves to its final position. During this movement of first follower, leader is assumed to be stationary at the position . A condition is given to first follower such that only due to disturbance in position of leader, first follower changes its position.To maintain the cohesive motion with the leader, distance of the first follower from the leader must be at final position of both the agents. It can be formulated as follows: where the values of , and are known to computational system of first follower. But it is clear from (5) that locus of the position of first follower is a circle. Hence, its rest position may be at anywhere on this circle. First follower may take its rest position for which it crosses over the leader and may collide with leader. Undesirable consequence of this phenomenon is that ordinary follower may collide with leader and first follower both for maintaining the distant constraints from both of them. Hence, to provide a control avoiding this unsafe situation, a restriction to the motion of first follower must be imposed, such that it reaches to a.

In Figure 3, is defined as the distance between the final and initial position of first follower. Here, a vector field along the trajectory curve of first follower. It should be noted that , and are always on . Then, we have Therefore, must be minimum such that first follower moves along the shortest path to its final position. Hence, the first follower follows the leader maintaining safe motion. Now, we intend to propose a control law for motion of first follower satisfying the aforesaid conditions. Actually, the whole problem may be treated as an optimization problem, where minimization of objective function (7) under equality constraint (6) should be performed. And a control law based on this optimization is presented as where and and and are unit vectors along and direction of the global coordinate system.

The translational velocity control input = meter/second.

The angular velocity (rad/sec) control input is

##### 4.3. Control Law for Ordinary Follower-1

Ordinary follower-1 tries to satisfy two distance constraints; that is, it has two outgoing edges, the first one is directed towards first follower and the second one is directed towards leader. Let the leader and first follower be placed at their corresponding final positions. The ordinary follower senses the disturbances in position of leader and first follower; that is, it senses error in desired distance constraints and by sensing the final position of the first follower and leader, respectively. It tries to satisfy these distance constraints to first follower and leader (as shown in Figure 4). Therefore, suppose the ordinary follower moves to its final position (rest point) at the next time instant of the time () after the instant during which first follower moves to its final position. During this movement of ordinary follower, leader and first follower are assumed to be stationary at the position and , respectively. At the final position, ordinary follower satisfies its distance constraints. Here, a condition is given to the ordinary follower such that only when disturbances in positions of both leader as well as first follower (not merely leader) occur; ordinary follower changes its position to final one. This final position is assumed . The assumed initial position of the ordinary follower is . Now, according to the desired distance constraints for it, two conditions are to be satisfied as given in where , and are known to the computational system of ordinary follower. Hence, is defined as the distance between the final and initial position of ordinary follower. Here, a vector field along the trajectory curve of ordinary follower. It should be noted that and are always on . Then, we define Actually, (9) are equations of two circles. They meet at two different points. The ordinary follower will follow the leader and first follower maintaining safe motion and moves to any one meeting point such that is minimum. By maintaining minimum, ordinary follower moves along shortest path to its final position. Now, it is the need to propose a control law for motion of first follower satisfying the aforesaid conditions. Actually, the whole problem may be treated as an optimization problem, where minimization of objective function (10) under equality constraint (9) should be performed. And a control law based on this optimization is presented as where, , , and are unit vectors along , and direction of the global coordinate system.

The translational velocity control input m/second.

Angular velocity (rad./sec) control input is

##### 4.4. Control Law for Ordinary Follower-2

Ordinary follower-2 tries to satisfy two distance constraints; that is, it has two outgoing edges, first one is directed towards ordinary follower-1 and second one is directed towards first follower. Let the first follower and ordinary follower-1 be placed at their corresponding final positions. The ordinary follower senses the disturbances in position of first follower and ordinary follower-1; that is, it senses error in desired distance constraints and by sensing the final position of the first follower and ordinary follower-1. It tries to satisfy these distance constraints to first follower and ordinary follower-1. Therefore, suppose the ordinary follower-2 moves to its final position (rest point) at the next instant of the time () after the instant during which ordinary follower-1 moves to its final position. During this movement of ordinary follower-2– ordinary follower-1, first follower and leader are assumed to be stationary at the position , and , respectively. At the final position, the ordinary follower satisfies its distance constraints. Here, a condition is given to the ordinary follower such that only when disturbances in positions of both leader as well as first follower (not merely leader) occur, ordinary follower changes its position to final one. This final position is assumed . The assumed initial position of the ordinary follower is . Now according to the desired distance constraints for it, two conditions are to be satisfied as given in where , and are known to the computational system of ordinary follower. Hence, is defined as distance between the final and initial position of ordinary follower. Here, is a vector field along the trajectory curve of ordinary follower. It should be noted that and are always on . Then we define Actually, (13) are equations of two circles. They meet at two different points. The ordinary follower will follow the leader and first follower maintaining safe motion and moving to any one meeting point such that is minimum. By maintaining minimum, ordinary follower moves along shortest path to its final position. Now it is the need to propose a control law for motion of first follower satisfying aforesaid conditions. Actually, the whole problem may be treated as an optimization problem where minimization of objective function (14) under equality constraint (13) should be performed. And a control law based on this optimization is presented as where and and and are unit vectors along and directions of the global coordinate system.

The translational velocity control input m/second.

Angular velocity (rad./sec) control input is

*Remarks 1. *Hence, from the previous discussion it is concluded that for each complete displacement of considered quadrilateral formation, at the end of first instant of time the leader moves to its desired final position. Then, at the end of next instant (which is the second one) the first follower moves to its final desired position to maintain distance constraints to the leader, during which leader is kept stationary. At end of another instant (which is third one) the ordinary follower-1 reaches to its final position to maintain distance constraints to both leader and first follower. At end of another instant (which is fourth one) the ordinary follower-2 reaches to its final position to maintain distance constraints to both leader and first follower. Therefore, the agents are not reaching their corresponding final position exactly at the same time. Consequently, during the period from “after the starting of first instant” and “before the end of fourth instant” desired distances are not preserved among the agents, rather the first follower, ordinary follower-1 and ordinary follower-2 try to form up. So it may be concluded that after every time, the desired formation is obtained. Therefore, each agent start to move to its new position (to be in a new position set) after every time. That is there is a discontinuous motion that occurs for every agent. Therefore, for formation of n number of agents, after every time the desired formation is maintained. Each agent start to move to its new position (to be in a new position set) after every time. However, if the is chosen as very small we may assume that all the agents reach their corresponding final (new) positions during first instant of time (almost same time taken by leader to reach its desired final position) and during each complete displacement of formation, and continuous motion of formation is maintained. Consequently we may also assume all the agents move with continuous motion. Simulation results in the next section are also done based on this assumption.

#### 5. Simulation Studies

The control laws (3), (7), (11), and (15) for different agents have been tested successfully via three cases of simulations for specified formation with consideration of meters. Length of each time instant is considered as 0.01 second for simulation during optimization as described in what follows.

##### 5.1. Specific Assumptions in Different Cases

###### 5.1.1. Case I and Case II

In Case and Case , the assumptions are as follows:(i)Initial position coordinates are (), (), (), and () for leader, first follower, Ordinary Follower-1, and Ordinary Follower-2, respectively;(ii)Translational velocity input to the leader is 1 meter/second;(iii)Distance travelled by leader is 1.5 meter in each case;

###### 5.1.2. Case III

Here the considerations are as follows:(i)Initial position coordinates are (), (), (), and () for leader, First follower, Ordinary Follower-1, and Ordinary Follower-2, respectively;(ii)Leader is assumed to move along a sinusoidal path. The equations that describe that sinusoidal path of the leader is considered as (iii)Time travelled by the leader is 100 second;

Control laws given in (3), (7), (11), and (15) require the final position of the corresponding agent at each instant of time during their motion. For the leader, the final position at each instant of time is available as the path is specified for it, but for other agents, these positions must be calculated. To find out the final position at each instant of time , the controller in each case requires optimization of an quadratic objective function under one or two quadratic equality constraints as described in Section 4. Several optimization methods are available for this purpose. Our choice here is to exploit Sequential Quadratic Programming (SQP) as it is one of the most popular and robust algorithms for nonlinear continuous optimization. The method is based on solving a series of subproblems designed to minimize a quadratic model of the objective subject to a linearization of the constraints. In the proposed controller, the objective functions are chosen as quadratic whilst the constraints are taken as nonlinear quadratic which can be linearized during course of optimization procedure. At the beginning of each instant of time (i.e., at the beginning of a complete displacement of the whole formation), the position of each agent is used as the initial position in control law of that particular agent. This position coordinate is also assumed as starting point of that agent’s complete iterative procedure (in optimization process using SQP) for finding out its final position.That iterative procedure follows the steps elaborated below:(i)making a Quadratic Programming (QP) subproblem (based on a quadratic approximation of the Lagrangian function) using nonlinear objective function and equality constraints,(ii)solving that Quadratic Programming (QP) sub problem at each iteration,(iii)during (ii) updating an estimate of the Hessian of the Lagrangian at each iteration using the BFGS (Broyden–Fletcher–Goldfarb–Shanno) formula [16, 17],(iv)quadratic Programming solution at each iteration performing appropriate Line Search using Merit Function [16–18].

In this work, MATLAB optimization toolbox has been used for solving the above said optimization problem using Sequential Quadratic Programming. However, alternatively other packages such as NPSOL, NLPQL, OPSYC, and OPTIMA can be used.

##### 5.2. Description of Simulation Result in Different Cases

###### 5.2.1. Case I

We provide straight line motion to the Leader such that it moves along global -axis. The paths followed by all agents during motion of formation are shown in Figure 5. Distances , and are observed maintained at specified values.

###### 5.2.2. Case II

We provide 0.09 degree (approximately 0.00157 rad/sec) angular velocity input to the motion of leader.The translational velocity input is constant at 1 m/s. In this case complete path of the leader may be considered as part of a complete circle. For this case paths of all agents during motion are shown in Figure 6. From the simulation studies of Case it is found that the distances among agents are maintained at the desired values during the motion of the formation as in case of Case-I. Plots of versus , versus and versus , versus , versus are shown in Figures 7, 8, 9, 10, and 11, respectively. These plots are also observed in Case-I also.

###### 5.2.3. Case III

As the path of leader is sinusoidal the velocity and orientation (corresponding angular velocity) change at each instant. The changes in translational velocity and angular velocity (which are control inputs for leader) along sinusoidal path are shown in Figure 12, Figure 13, and Figure 10. for travelling time 250 seconds. For this case path followed by first follower and ordinary follower along with leader are shown in Figure 11. Here also in this case similar observations are made on the maintaining of the distance constraints during the motion of the formation as in Case and Case .

#### 6. Conclusions

In this paper, a new algorithm using a set of decentralized control laws based on optimization (using Sequential Quadratic Programming) of distance constraints has been proposed for the motion control of a *leader-follower* structure type formation of multiple mobile autonomous agents. The effectiveness of the proposed control schemes have been demonstrated through a number simulation studies. During the motion of formation, the interagent distances are maintained at desired values.

The above described control design strategy may be extended to the formation of any number of autonomous agents in the form of leader-follower structure in which each agent (except First Follower) observes the distances of only two neighboring agents to which it needs to maintain distance constraints. The control strategy considering kinematics (other than unicycle nonholonomic point model) of each agent and phenomenon of obstacle avoidance are currently in contemplation. The future work in this context may be to pursue the stability study of proposed control design.

#### References

- R. Carelli, C. de la Cruz, and F. Roberti, “Centralized formation control of non-holonomic mobile robots,”
*Latin American Applied Research*, vol. 36, no. 2, pp. 63–69, 2006. View at Scopus - C. de la Cruz and R. Carelli, “Dynamic modeling and centralized formation control of mobile robots,” in
*Proceedings of the 32nd Annual Conference on IEEE Industrial Electronics (IECON '06)*, pp. 3880–3885, November 2006. View at Publisher · View at Google Scholar · View at Scopus - R. Olfati-Saber and R. M. Murray, “Consensus problems in networks of agents with switching topology and time-delays,”
*IEEE Transactions on Automatic Control*, vol. 49, no. 9, pp. 1520–1533, 2004. View at Publisher · View at Google Scholar · View at Scopus - J. R. T. Lawton, R. W. Beard, and B. J. Young, “A decentralized approach to formation maneuvers,”
*IEEE Transactions on Robotics and Automation*, vol. 19, no. 6, pp. 933–941, 2003. View at Publisher · View at Google Scholar · View at Scopus - S. Sandeep, B. Fidan, and C. Yu, “Decentralized cohesive motion control of multi-agent formations,” in
*Proceedings of the 14th Mediterranean Conference on Control and Automation (MED'06)*, June 2006. View at Publisher · View at Google Scholar · View at Scopus - J. Baillieul and A. Suri, “Information patterns and hedging Brockett's theorem in controlling vehicle formations,” in
*Proceedings of the 42nd IEEE Conference on Decision and Control*, vol. 1, pp. 556–563, December 2003. View at Scopus - C. Yu, J. M. Hendrickx, B. Fidan, B. D. O. Anderson, and V. D. Blondel, “Three and higher dimensional autonomous formations: rigidity, persistence and structural persistence,”
*Automatica*, vol. 43, no. 3, pp. 387–402, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. M. Hendrickx, B. D. O. Anderson, J.-C. Delvenne, and V. D. Blondel, “Directed graphs for the analysis of rigidity and persistence in autonomous agent systems,”
*International Journal of Robust and Nonlinear Control*, vol. 17, no. 10-11, pp. 960–981, 2007. View at Publisher · View at Google Scholar · View at Scopus - J. M. Hendrickx, B. Fidan, C. Yu, B. D. O. Anderson, and V. D. Blondel, “Elementary operations for the reorganization of minimally persistent formations,” in
*Proceedings of the 17th International Symposium on. Mathematical Theory of Networks and Systems (MTNS '06)*, pp. 859–873, Kyoto, Japan, 2006. - B. D. O. Anderson, C. Yu, B. Fidan, and J. M. Hendrickx, “Rigid graph control architectures for autonomous formations,”
*IEEE Control Systems Magazine*, vol. 28, no. 6, pp. 48–63, 2008. View at Publisher · View at Google Scholar · View at Scopus - T. Eden, W. Whitely, B. D.O. Andersoon, A. S. Morse, and P. N. Belhumeur, “Information structures to secure Control of rigid formations with leader-follower architecture,” in
*Proceedings of the American Control Conference*, vol. 4, pp. 2966–2971, Portland, Ore, USA, June 2005. View at Scopus - B. D. O. Anderson, C. Yu, S. Dasgupta, and A. Stephen Morse, “Control of a three-coleader formation in the plane,”
*Systems and Control Letters*, vol. 56, no. 9-10, pp. 573–578, 2007. View at Publisher · View at Google Scholar · View at Scopus - M. Cao, A. S. Morse, C. Yu, B. D. O. Anderson, and S. Dasgupta, “Controlling a triangular formation of mobile autonomous agents,” in
*Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07)*, pp. 3603–3608, December 2007. View at Publisher · View at Google Scholar · View at Scopus - L. Krick, M. E. Broucke, and B. A. Francis, “Stabilization of infinitesimally rigid formations of multi-robot networks,”
*International Journal of Control*, vol. 82, no. 3, pp. 423–439, 2008. View at Publisher · View at Google Scholar · View at Scopus - B. D. O. Anderson, S. Dasgupta, and C. Yu, “Control of directed formations with a leader-first follower structure,” in
*Proceedings of the 46th IEEE Conference on Decision and Control (CDC '07)*, pp. 2882–2887, New Orleans, La, USA, December 2007. View at Publisher · View at Google Scholar · View at Scopus - M. J. D. Powell, “A fast algorithm for nonlinearly constrained optimization calculations,” in
*Numerical Analysis*, G. A. Watson, Ed., vol. 630 of*Lecture Notes in Mathematics*, Springer, London, UK, 1978. - M. J. D. Powell, “The Convergence of variable metric methods for nonlinearly constrained optimization calculations,” in
*Nonlinear Programming 3*, O. L. Mangasarian, R. R. Meyer, and S. M. Robinson, Eds., Academic Press, Boston, Mass, USA, 1978. - S. P. Han, “A globally convergent method for nonlinear programming,”
*Journal of Optimization Theory and Applications*, vol. 22, no. 3, pp. 297–309, 1977. View at Publisher · View at Google Scholar · View at Scopus