Research Article | Open Access

Masood Ghasemi, Sergey G. Nersesov, "Sliding Mode Cooperative Control for Multirobot Systems: A Finite-Time Approach", *Mathematical Problems in Engineering*, vol. 2013, Article ID 450201, 16 pages, 2013. https://doi.org/10.1155/2013/450201

# Sliding Mode Cooperative Control for Multirobot Systems: A Finite-Time Approach

**Academic Editor:**Xudong Zhao

#### Abstract

Finite-time stability in dynamical systems theory involves systems whose trajectories converge to an equilibrium state in finite time. In this paper, we use the notion of finite-time stability to apply it to the problem of coordinated motion in multiagent systems. We consider a group of agents described by Euler-Lagrange dynamics along with a leader agent with an objective to reach and maintain a desired formation characterized by steady-state distances between the neighboring agents in finite time. We use graph theoretic notions to characterize communication topology in the network determined by the information flow directions and captured by the graph Laplacian matrix. Furthermore, using sliding mode control approach, we design decentralized control inputs for individual agents that use only data from the neighboring agents which directly communicate their state information to the current agent in order to drive the current agent to the desired steady state. We further extend these results to multiagent systems involving underactuated dynamical agents such as mobile wheeled robots. For this case, we show that while the position variables can be coordinated in finite time, the orientation variables converge to the steady states asymptotically. Finally, we validate our results experimentally using a wheeled mobile robot platform.

#### 1. Introduction

Finite-time stability of a dynamical system involves trajectories that converge to the desired equilibrium state in finite time and remain there for all further times. As a result, such systems do not possess the property of uniqueness of solutions in backward time, and thus their dynamics are non-Lipschitz. Sufficient conditions for finite-time stability were rigorously studied in [1, 2] using Hölder continuous Lyapunov functions. Finite-time stabilization of second-order systems was considered in [3, 4]. More recently, researchers have considered finite-time stabilization of higher-order systems [5] as well as finite-time stabilization using output feedback [6].

Sufficient conditions for finite-time stability developed in [1] were further extended to finite-time stability and stabilization of sets for nonlinear dynamical systems in [7]. In this paper, we use these results in the context of coordination in multiagent systems. We consider specifically a group of agents characterized by Euler-Lagrange dynamics along with a leader agent with an objective to reach and maintain the desired formation in finite time. Using graph-theoretic notions [8, 9], we describe the communication topology in the network of agents characterized by the information share among the agents. Based on the assumption of a weakly connected graph, we develop a directed graph Laplacian matrix whose properties provide the basis for defining the generalized error states. Furthermore, we design decentralized sliding mode controllers for individual vehicles to drive the error states of the entire multiagent system to the origin in finite time. We show that these sliding mode controllers use only information from the neighboring agents that directly communicate their generalized position and velocity information to the current agent.

Recently, *finite-time consensus* was studied in [10] for single integrator systems with an objective to reach the state of equipartition [11] (or consensus), that is, equal steady states for all agents. In contrast with [10], our approach is not limited by a particular steady state configuration. In fact, the developed framework places no limitation on the motion of the leader and the structure of the desired formation and includes, as a special case, all of the above types of coordinated motion such as flocking, cyclic pursuit, and rendezvous. Furthermore, we have extended our results to multiagent systems composed of underactuated dynamical agents.

We use sliding mode control technique [12] to design decentralized controllers for individual agents to reach the desired formation in finite time. Traditionally, sliding mode control is based on defining the sliding surface as a function of the system states and using finite-time stability theory for sets to ensure that all closed-loop systems trajectories reach this surface in finite time [13–17]. The smooth surface is usually designed in such a way that the closed-loop dynamics restricted to the surface is exponentially stable which ensures that trajectories, after reaching the surface, slide along it to the origin exponentially. The main disadvantage of sliding mode control is chattering around the surface during the sliding phase due to the use of discontinuous sign function which, in practice, is normally approximated by a continuous function. In this paper, we briefly review the results of [18] where finite-time coordination in multiagent systems is achieved by designing *nonsmooth* sliding surfaces to obtain non-Lipschitzian closed-loop dynamics restricted to the surface which leads to the convergence of the system trajectories to the origin in finite time. It appears that the sliding mode control designed for such nonsmooth surfaces can be unbounded in a certain region of the state space. In order to overcome this difficulty, we design auxiliary (smooth) sliding surfaces for the initial conditions in this region such that the sliding mode control predicated on these smooth surfaces is bounded. We show that the trajectories starting in this region will inevitably leave it, and hence switching from the sliding mode control designed for smooth surfaces to the one designed for nonsmooth surfaces guarantees convergence of the closed-loop system trajectories to the desired steady states in finite time.

The main focus of this paper is on extending the above framework to multiagent systems composed of underactuated dynamical agents. We use wheeled mobile robot model of an agent to show that while the position variables can be coordinated in finite time, the orientation variables can only be shown to converge to the steady state asymptotically. We demonstrate the efficacy of our approach using an example involving eight planar mobile robots and the leader with given communication topology and the formation structure. In addition, we provide an experimental validation of our results using wheeled mobile robot platform. Overall, the framework reveals fast converging times without excessive control effort.

#### 2. Mathematical Preliminaries

In this section, we introduce notation and definitions and present some key results needed for developing the main results of this paper. Let denote the set of real numbers, let denote the set of column vectors, let denote transpose, and let denote matrix inverse. Furthermore, let , , and denote the interior, the closure, and the boundary of the set , respectively. Finally, we write for the Fréchet derivative of at , for vector/matrix norm, and for the ones vector of order , that is, .

Next, consider the nonlinear dynamical system given by where , , is the system state vector, is an open set, , , and is continuous on . We denote by the solution to (1) with the initial condition at . We assume that (1) possesses unique solutions in forward time for all initial conditions except possibly the origin. Sufficient conditions for forward uniqueness in the absence of Lipschitz continuity can be found in [19], [20, Section 10], [21], and [22, Section 1].

*Definition 1 (see [7]). *Consider the nonlinear dynamical system (1). Let be a positively invariant set with respect to (1). is * finite-time stable* if there exist an open neighborhood of and a function , called the *settling-time function*, such that the following statements hold.

*(i) Finite-Time Convergence.* For every , is defined on , for all , and .

*(ii) Lyapunov Stability.* For every open neighborhood of , there exists an open neighborhood of such that for every , for all .

Finally, is *globally finite-time stable* if it is finite-time stable with .

The next result provides sufficient conditions for finite-time stability of an invariant set.

Theorem 2 (see [7]). *Consider the nonlinear dynamical system (1) and let be an invariant set with respect to (1). Assume there exists a continuously differentiable function and real numbers and such that , , , , and
**
Then, is finite-time stable. Moreover, if is as in Definition 1 and is the settling-time function, then
**
and is continuous on . If, in addition, , is radially unbounded, and (2) holds on , then is globally finite-time stable.*

Next, we present some basic definitions and results from the graph theory needed in this paper. For more details, see [8, 23, 24].

A *directed graph * of order is a pair , where (*vertex set*) is a set of elements called *vertices* (or *nodes*) and (*edge set*) is a set of ordered pairs of vertices called edges. For , the ordered pair denotes an edge from to . We assume that for any , that is, the graph has no self-loops. If implies for any , then the graph is called *undirected graph* or simply *graph*.

The *adjacency matrix* of is defined as , where is equal to one if for and is equal to zero otherwise. Since, has no self-loops, . The *in-degree*, respectively *out-degree*, of a vertex , denoted by , respectively , is the number of edges , respectively , where , respectively . Moreover, the *in-degree matrix* of the directed graph , respectively *out-degree matrix* of the directed graph , denoted by , respectively , is defined as a diagonal matrix with , respectively , for all as its diagonal elements.

A *path* on graph of length from to is an ordered set of distinct vertices such that, for any pair of consecutive vertices, for all . A *directed path* on a directed graph of length from to is an ordered set of distinct vertices such that, for any directed pair of consecutive vertices, for all . A graph is *connected* if there exists a path between any two of its vertices. A directed graph is *strongly connected* if there exists a directed path between any two of its vertices. Also, a directed graph is *weakly connected* if it is not strongly connected and its associated undirected graph obtained by removing directions on edges is connected. For any vertex , the *reachable set * is a set containing and all vertices such that there is a directed path from to . The reachable set is called *maximal* if there exists a vertex , such that is the biggest reachable set in containing . A maximal reachable set is called a *reach*.

The *Kirchhoff matrix* or *directed Laplacian* of a directed graph is defined by , where is the in-degree matrix and is the adjacency matrix of the graph. The normalized directed Laplacian denoted by is obtained by dividing each row of by the corresponding diagonal element of , if it is not zero. If an element of is zero, then the corresponding row of consists of only zero elements.

Proposition 3. *Let be a graph of order and let denote its Laplacian matrix. Then, zero is an eigenvalue of and the associated eigenvector is .*

*Proof. *Since every row of sums up to zero, it follows that and is a valid solution to which proves the result.

Proposition 4 (see [25]). *Let be a directed graph, let denote its directed Laplacian matrix, and suppose that has reaches. Then, the algebraic and geometric multiplicity of the zero eigenvalue of is equal to .*

Corollary 5. *Let be a strongly connected directed graph and let denote its directed Laplacian matrix. Then, the algebraic and geometric multiplicity of the zero eigenvalue of is equal to one.*

*Proof. *Since is strongly connected, it follows that has only one reach which includes all vertices of . Now, the result is a direct consequence of Proposition 4.

#### 3. Coordination Control for Euler-Lagrange Systems

In this section, we briefly review a general framework for coordination control of a set of fully actuated Euler-Lagrange systems in pursuit of a leader [18]. We design specifically decentralized sliding mode controllers for individual agents that guarantee finite-time coordination. Consider a set of agents whose individual dynamics are given by where is the vector of generalized coordinates of the th agent, is the positive definite inertia matrix of the th agent, , is the control input for the th agent, is the vector of Coriolis, centrifugal, conservative, and nonconservative forces acting on the th agent, and represents the vector of bounded uncertainties and disturbances affecting the dynamics of the th agent. Alternatively, (4) can be written as where We associate with the network of agents, including the leader agent, the directed graph and use subscripts to refer to the agents and “L” to refer to the leader agent. Next, define the set given by to denote the set of all agents whose position and velocity vectors are available for the th agent, that is, for all . We assume that the directed graph of the ensemble of agents is such that there exists at least one directed path from the leader to any agent, which implies that is weakly connected. Note that the leader, where the information flow starts, does not sense any agent, that is, there is no directed path from any agent to the leader. Moreover, we assume that the communication links between all agents remain unchanged. Thus, the graph topology of the agent network is static. The normalized directed Laplacian matrix of the graph is given by where is the cardinality of , which is the number of elements in . Note that, since the leader does not sense any agent, the first row of the Laplacian matrix is zero. Alternatively, the Laplacian matrix (8) can be rewritten as where and , are given by (8). The next lemma presents the key feature of the matrix .

Lemma 6 (see [18]). *Let the connectivity graph have the normalized directed Laplacian matrix given by (9). Then, is invertible.*

We consider an objective where the agents whose dynamics are given by (4) are required to achieve and maintain coordinated motion with respect to the leader in *finite time*. We consider specifically a formation leader whose position and velocity profiles are known functions of time and are given by , , and , . In this case, the desired steady state value of the th agent relative position with respect to the th agent is uniquely defined by a known vector , characterizing the time varying difference between the th and the th agents' generalized position vectors. Thus, the error variable that needs to be driven to zero is given by
where is the position error of the th agent with respect to the th agent. Note that, at this point, ,, are defined regardless of whether or not. Furthermore, we introduce a generalized error state for the th agent as
Note that in contrast with (11), in (12), the generalized position , is compared to only the generalized positions , where .

Lemma 7 (see [18]). *Consider the connectivity graph with the normalized directed Laplacian matrix given by (9). Define , where is given by (12) and . Then, the following statements hold.*(i)* If , then . *(ii)* If , then .*

The generalized error dynamics are obtained by taking the second time derivative of (12) and are given by where Equations (12), (13), and (14) for individual agents can be rewritten using Kronecker algebra to represent the multiagent formation consisting of agents as follows: where

Next, we present a general framework for the sliding mode control design that guarantees finite-time coordination for the multiagent system (17). Consider a vector function given by where , , , , , , , , is the th component of , . We define the th sliding surface as the null space of , that is, As in standard sliding mode control theory, the control law is calculated by setting for the nominal system and adding a signum function to address uncertainties. Using (13) and (20) specifically, we set where , , , , , , , is the th component of , and is the set where is bounded. Define , , as where Note that vector and, consequently, are bounded in while being unbounded in the complement of . Thus, for the complement of , we design an auxiliary sliding mode controller below. First, however, we establish sufficient conditions under which is positively invariant with respect to (13).

Proposition 8 (see [18]). *Consider the error dynamics (13) with the feedback controller (22). If the sliding mode controller gains , , , satisfy
**
with
**
then the set defined by (24) is invariant with respect to (13).*

For the case when , decentralized control input (22) can be rewritten for the entire ensemble of agents as where Next, for the initial conditions , we design an auxiliary sliding surface along with the corresponding sliding mode controller. Consider specifically the vector function given by and define the sliding surface as By setting , we obtain where , with . The next result establishes that the sliding mode controllers (22) and (32) guarantee that the error states of (17) converge to the origin in finite time, thus ensuring finite-time coordination among the agents.

Theorem 9 (see [18]). *Consider the error dynamics given by (13). The sliding mode control law given by
**
where , and are given by (20) and (30), respectively, the entries of control gain matrices satisfy (26) and (27), and the entries of control gain matrices satisfy (33), guarantees finite-time convergence of the error state of (17) to the origin, and hence, the ensemble of agents and a leader reaches the desired coordination in finite time.*

Note that each decentralized controller , given by (34) uses only local information from the th agent and the neighboring agents that directly communicate their state information to the th agent. Furthermore, the earlier statement that the leader does *not* receive information from the agents is not restrictive. In fact, if the agents do communicate their state values to the leader, then as long as the leader's position and velocity are known by at least one agent, the analysis will be the same as presented above.

*Remark 10. *Sliding mode control always results in chattering around the surfaces due to the signum function in (34). In practice, the discontinuous sign function is often approximated by a continuous function such as the hyperbolic tangent or by a linear saturation function to avoid chattering.

#### 4. Finite-Time Coordination for Underactuated Systems

In this section, we extend the results of Section 3 to the case of underactuated mechanical systems. As an example system, we consider a model of a mobile robot subject to a nonholonomic constraint such as the no-slip condition in the normal direction to the motion path. The equations of motion for a mobile robot shown in Figure 1 are given by [26] where is the position of the th robot's mass center , is the th robot's orientation (see Figure 1), is the tangential component of the velocity of the robot's mass center, and are differential torques applied to each wheel, and are uncertainty functions affecting the robot dynamics, , , is the distance between the mass center and mid-axle point , is the total mass of the robot, is the moment of inertia of the robot about the axis orthogonal to the plane passing through , is the length of robot's axle, and , is the rotational inertia of the wheels about their axis of rotation, is the radius of the wheels, and is the number of mobile robots. Differentiating (35) and (36) yields where Next, using the feedback linearizing controller given by where , and , are the new feedback control inputs, (40) can be written as while (37) can be rewritten as

The objective is to coordinate the motion of a set of robots and a leader. Define the leader's position in the plane as , , and its orientation as , , and define the generalized position vector for the leader as , . Note that the leader obeys the same nonholonomic constraint as all mobile robots such as no slip in the normal direction to the path. Without loss of generality, we assume that , which physically implies that, during the motion of the leader, its mass center is always ahead of the mid-axle point . In other words, in order for the leader robot to turn around, it does not back up the wheels, but uses the differential torques applied to the wheels while keeping . As in Section 3, we define the set given by where “L” stands for the leader, to denote the set of all vehicles whose position and velocity vectors are available for the th agent. We assume that the directed graph of the ensemble of vehicles is such that there exists at least one directed path from the leader to any agent. Note that the leader does not sense any vehicle. Moreover, we assume that the graph topology of the vehicle network is time invariant. The normalized directed Laplacian matrix of the graph is defined by (8).

Next, define the position error states as where and are the steady state differences between the horizontal and vertical positions, respectively, of the th and the th robots. The position error dynamics are obtained by taking the second time derivative of (46) given by where Note that, for , leader’s position and orientation satisfy where , . Since, the dynamics of (47) conform with the structure of the error dynamics (13), it follows from Theorem 9 that the sliding mode control (34) guarantees that the solutions to (47) converge to the origin in finite time, and hence all robots reach the desired formation on the plane in finite time. After all robots reached the desired formation at the settling time , it follows from Lemma 7 that , which implies that . Thus, the orientation dynamics (37) for the th robot can be rewritten as Let , measure the orientation error between the th robot and the leader. Using (50) with , the orientation error dynamics are given by Alternatively, (51) can be rewritten as In the next proposition, we show that the zero equilibrium point of (52) is uniformly asymptotically stable with respect to .

Proposition 11. *Consider the error dynamics given by (52) and define
**
where , , and , , is an arbitrarily small constant. Then, the zero solution of (52) is uniformly asymptotically stable with respect to and with an estimate of the domain of attraction given by .*

*Proof. *Note that is the only equilibrium point of (52) in . Consider a Lyapunov function candidate given by
and note that and , . Furthermore, since , there exists , such that . Thus, the Lyapunov derivative along the trajectories of (52) satisfies
It follows from Theorem 4.1 of [27] that the zero solution to (52) is uniformly asymptotically stable with respect to and with an estimate of the domain of attraction given by . This implies that as for all .

Proposition 11 along with Theorem 9 ensures finite-time coordination of the agents’ positions and asymptotic coordination of the agents’ orientations.

#### 5. Numerical Example

In this section, we provide a numerical simulation for the case of planar coordinated motion of eight mobile robots and a leader. The desired formation and the information flow between agents are shown in Figure 2. This communication topology remains unchanged over time. For the given configuration, and matrices are given as follows:

Note that the directed graph of the formation satisfies the required property that there exits at least one directed path from the leader to any agent. Also, note that is invertible. Next, the leader is set to be moving counter-clockwise on a circular path of radius according to , , . The values of control gains are set to be and , . Finally, the matrices characterizing the design of the sliding surface for each agent are chosen to be , . In this case, , , ensure that condition (27) is satisfied.

All robots are identical with the values of the parameters set to be kg, kg/m^{2}, kg/m^{2}, m, m, and m. The above values correspond to the experimental wheeled mobile robot parameters which will be discussed in the next section.

For the initial positions and orientations of the robots given by , , , , , , , and and the initial velocities given by , Figure 3 shows the position phase portrait with robot orientations and Figure 4 shows position errors defined in (46) and orientation errors with respect to the leader for eight robots. It can be seen from Figures 3 and 4 that, with the settling time of approximately 5 seconds, the agents reach the desired formation shown in Figure 2. Furthermore, Figure 4 shows that the errors and