Skip to content

Bearing-based Formation Control [1]

1 Introduction

This section introduces the theory of bearing-based formation control, which studies how to steer a group of agents to achieve a bearing-constrained target formation using relative position measurements.

Consider a group of mobile agents, where the first nl agents are leaders and the remaining nf(nf=nnl) agents are followers. Let Vl={1,,nl} and Vf=VVl be the sets of leaders and followers, respectively. The positions of the leaders and followers are denoted as pl=[p1T,,pnlT]T and pf=[pnnlT,,pnT]T, respectively. The target formation is specified by the constant bearing constraints {gij}(i,j)ε and the leader positions {pi(t)}iVl, where gij is defined in Bearing. The control objective is to govern the positions of the followers {pi(t)}iVf such that gij(t)gij as t for all (i,j)ε. All of the bearings are expressed in a common reference frame.

Before giving the proposed controllers with convergence proofs, the following assumption is adopted.

Assumption 1

Any formation G(p) that satisfies the bearing constraints {gij}(i,j)ε is infinitesimally bearing rigid.

Assumption 1 gives 2 useful conditions.

  1. By Theorem 10 in Chapter: Bearing, the target formation specified by the bearing constraints has a unique shape.
  2. By Theorem 8 in Chapter: Bearing, a mathematical condition that rank(RB(p))=dnd1 and Null(RB(p))=span{1Id,p} where RB(p)=diag(Pgk/ek)H¯ is the bearing rigidity matrix. Since the distance term ek in RB(p) does not affect its rank or null space, the condition given by Assumption 1 actually is
Null(diag(Pgk)H¯)=span{1Id,p}.

This condition will be crucial to the following convergence analysis.

2 Single Integrators

First, consider the case where the dynamics of each mobile agent can be modeled as the single integrator

(2.1)p˙i(t)=ui(t)

where ui(t) is the velocity input to be designed.

2.1 Leaderless Case [2]

If there are no leaders, then the bearing-based formation control problem can be solved by

(2.2)p˙i(t)=jNiPgij(pi(t)pj(t)),iV

where Pgij=Idgij(gij)T. The matrix form of the control law is

(2.3)p˙(t)=LBp(t).

where LB is the bearing Laplacian of the target formation.

Convergence analysis

Since the system (2.2) is linear and time-invariant, its convergence is totally determined by the spectrum of LB. 1st,3rd point of Lemma 2 in Chapter: Bearing characterizes the rank and null space of LB. Based on it, we can analyze the convergence of system (2.3).

Since LB is symmetric, its left and right null spaces are the same. Although {1Id,p} is a basis of Null(LB), it is not an orthogonal basis in general. In order to obtain an orthogonal basis, we first define the formation centroid (denoted c(p)), normalized formation (denoted r(p)), and formation scale (denoted s(p)) as

(2.4)c(p)1pn,r(p)p1c(p),s(p)r(p).

Note r(p) is always orthogonal to 1Id. As a result, if denoting r=p1c(p), we have {1Id,r} is an orthogonal basis of Null(LB). When the context is clear, we will simply write c(p), r(p), s(p) as c, r, s.

Theorem 1: Convergence of Leaderless Control

Under Assumption 1, the trajectory of system (2.3) converges exponentially from any initial point p(0) to

p()=1c(0)+((r)rp(0))rr.

If (r)p(0)>0, the leaderless controller (2.2) successfully achieves the control objective. Furthermore, the centroid and the scale of the final formation are c()=c(0) and s()=|(r)p(0)/r|, respectively.

Proof:

Details of Proof

Denote A=[1Id,r]Rdn×(d+1). By the linear system theory, the trajectory p(t) of system (2.3) converges to the orthogonal projection of p(0) onto Range(A) :

p()=A(AA)1Ap(0)=(1Id)((1Id)(1Id))1(1Id)p(0)+r(r)(r)rp(0)=1c(0)+(r)p(0)rrr.

It is easy to verify that the centroid and the scale of the final formation are c()=c(0) and s()=|(r)p(0)/r|, respectively. The final formation p() can be obtained by translating and scaling r. Since G(r) satisfies all the bearing constraints, G(p()) also satisfies as long as the scaling factor (r)p(0)/r is positive. Q.E.D.

Several remarks regarding Theorem 1 are given here.

Remark 1

  1. When (r)p(0)<0, the formation converges to a final formation with the bearings as gij=gij,(i,j)E instead of gij=gij,(i,j)E. In this case, although the final formation has the opposite bearings as desired, it can be viewed as a point reflection of the target formation and has the same shape.
  2. The centroid of the final formation is the same as that of the initial formation. In fact, it follows from (1Id)p˙=0 that the centroid of the formation is invariant under controller (2.2).
  3. Although the centroid is invariant, the scale of the formation is changed under controller (2.2). Specifically, the scale of the final formation satisfies
0s()s(0)

The scale of the final formation is no larger than that of the initial formation. It is clear that the lower bound of s() is achieved when (r)p(0)=0. In this case, the formation will finally reach rendezvous (i.e., consensus in terms of position). In order to obtain the upper bound, rewrite (r)p(0)=(r)[p(0)1c(p(0))]=(r)r(0). Then s()=|(r)r(0)/r|r(0)=s(0). As a result, the upper bound of s() is achieved when r is parallel to p(0) or r(0).

Example
Figure 2.1: The simplest example to demonstrate the geometric interpretation of the leaderless controller (2.2). Initial formation: gray; target/final formation: blue; agent trajectory: dotted line.

Figure 2.1 shows the simplest example to demonstrate controller (2.2). In this example, the target formation is vertical. The final position of each agent is the orthogonal projection of its initial position to the target bearing. Moreover, the centroid of the formation is invariant but the scale is changed. It is intuitively obvious that if the initial formation is horizontal, the two agents will reach rendezvous.

Although the controller (2.2) is able to achieve the control objective without leader, the centroid and the scale of the finally converged formation are determined by the initial formation, which is usually undesired in practice.

2.2 Stationary Leaders [2]

If the leaders are stationary, then the bearing-based formation control problem can be also solved by (2.5) for the follower case. Specifically,

(2.5){p˙i(t)=0,iVl,p˙i(t)=jNiPgij(pi(t)pj(t)),iVf

The matrix form of the control law is

(2.6)p˙f(t)=LBffpf(t)LBflpl,

where

LB=[LBllLBlfLBflLBff].

Control law (2.5) can globally stabilize a target formation if and only if the target formation is bearing localizable (that is, if LBff is nonsingular) [54].

Convergence Analysis

The centroid and the scale of the finally converged formation are determined by the initial formation in the leaderless case, while the centroid and the scale of the formation can be controlled by the leader-follower controller (2.5). We first analyze the properties of LBff in the leader-follower controller.

Lemma 1

Under Assumption 1, LBff in system (2.5) is positive definite if and only if nl2.

Proof:

Details of Proof

For any xRdnl, since LB0, we have

xLBffx=[0x][LBllLBlfLBflLBff][0x]0.

As a result, LBff is at least positive semi-definite. If there exists a nonzero vector x such that xLBffx=0, then [0,x]Null(LB)=span{1Id,r}. If there is only one leader ( nl=1 ), it is easy to see that such x exists. However, if there are more than one leaders ( nl2 ), such x does not exist because pipj for all ij. Thus, in the case of nl2,LBff is positive definite. Q.E.D.

When nl2, the positions of the leaders, pl, must be feasible such that the followers together with the leaders can possibly form a formation satisfying the bearing constraints. The following is a necessary condition for a feasible pl.

Lemma 2

Under Assumption 1, a feasible pl satisfies

(LBllLBlfLBff1LBfl)pl=0

Proof:

Details of Proof

If pl is feasible, there exists pf such that p=[pl,pf] satisfies the bearing constraints {gij}(i,j)E. By Theorem 10 in Chapter: Bearing, infinitesimal bearing rigidity can uniquely determine p up to a translation and a scaling factor. That means pspan{1Id,r}=Null(LB) and consequently

[LBllLBlfLBflLBff][plpf]=0

which implies LBllpl+LBlfpf=0 and LBflpl+LBffpf=0. The second equation implies pf=LBff1LBflpl, substituting which into the first equation completes the proof. Q.E.D.

Based on Lemmas 1 and 2, we have the following convergence result for the leader-follower formation controller.

Theorem 2: Convergence of Leader-Follower Control

Under Assumption 1, given nl2 and a feasible pl, the trajectory of system (2.6) converges exponentially fast from any initial pf(0) to

pf()=LBff1LBflpl

The finally converged formation satisfies the bearing constraints {gij}(i,j)E.

Proof:

Details of Proof

Since LBff>0 if nl2 by Lemma 1, it is obvious that the linear time-invariant system (2.6) is exponentially stable. Then the final formation (i.e., the equilibrium) satisfying p˙f=0 is pf()=LBff1LBflpl. Since pl is feasible, it follows from Lemma 2 that LBp()=0 where p()=[pl,pf()]. Therefore, G(p()) satisfies the bearing constraints. Q.E.D.

As shown in Theorem 2, the final formation pf() is a function of pl. As a result, we can control the centroid and the scale of the final formation p() by choosing appropriate positions of the leaders pl.

Note that control law (2.5) has an expression similar to the network localization protocol[1]. In fact, the bearing-based formation control problem is mathematically equivalent to the bearing-based network localization problem when the target formation is stationary and each agent is a single integrator.

2.3 Moving Leaders with constant nonzero velocities [3]

One key problem that follows the definition of the target formation (with constant nonzero velocities for leaders) is whether the target formation exists and is unique.

In fact, this problem is equivalent to the localizability problem in bearing-only network localization. A formation can be uniquely determined by the bearings and the leaders if and only if the formation is localizable.

One useful sufficient condition is that a formation would be localizable if the formation is infinitesimally bearing rigid and has at least two leaders. This sufficient condition is intuitively easy to understand. Specifically, if the formation is infinitesimally bearing rigid, then it can be uniquely determined up to a translation and a scaling factor by the bearings. The translation and scaling ambiguity can be further eliminated by the introduction of at least two leaders. Then the formation can be fully and uniquely determined. Due to space limitations, we omit the details and simply make the following stronger assumption.

Assumption 2

The target formation G(p) is infinitesimally bearing rigid and has at least two leaders.

The mathematical condition implied by Assumption 2 is Lemma 1. It is worth noting that the infinitesimal bearing rigidity is merely sufficient but not necessary to ensure the existence and uniqueness of the target formation.

If the leaders move at a constant nonzero speed, then (2.5) would yield a constant nonzero tracking error. The tracking error may be eliminated using the following proportional-integral control law (PID control)

(2.7)p˙i(t)=jNiPgij[kp(pi(t)pj(t))kI0t(pi(τ)pj(τ)) dτ]

where iVf and kp and kI are constant positive control gains. Control law (2.7) is distributed because the control of each agent only requires the relative positions of its neighbors. The control law consists of a proportional term and an integral term. When kI=0, the control law would become the one proposed in Section 2.2. If the velocities of the leaders are zero, the proportional control alone is able to stabilize the target formation. But if the velocities of the leaders are nonzero, the integral control is required to eliminate the steady state tracking error.

By defining a new state for the integral term, control law (2.7) can be rewritten as

(2.8)p˙i(t)=kPjNiPgij(pi(t)pj(t))kIξi(t),ξ˙i(t)=jNiPgij(pi(t)pj(t)),iVf.

We next derive the matrix expression of control law (2.8), which will be useful for the convergence analysis. It is straightforward to see that the matrix expression of control law (2.8) is

p˙f(t)=kP(LBffpf(t)+LBflpl(t))kIξ(t)(2.9)ξ˙(t)=LBffpf(t)+LBflpl(t)

where ξ(t)=[ξnl+1(t)T,,ξn(t)T]TRdnf.

Convergence Analysis

Define the tracking error for the followers as

(2.10)δ(t)pf(t)pf(t)

where pf(t) is the real position of the followers and pf(t) is the time-varying expected position of the followers in the target formation. The aim of the convergence analysis is to show that δ(t) converges to zero. To that end, we need to first calculate pf(t). The following two results on the bearing Laplacian are useful.

Lemma 3

Any formation G(p) that satisfies the bearing constraints {gij}(i,j)E satisfies LBp=0 and LBffpf+LBflpl=0.

Proof:

Details of Proof

Note

LBp=[LBllLBlfLBflLBff][plpf]=[jNiPgij(pipj)].

By the elementwise expression of LBp, it is obvious that LBp=0 if G(p) satisfies the bearing constraints, i.e, (pjpi)/pjpi=gij. By the partitioned block matrix expression of LBp, it can be seen that LBp=0 implies LBffpf+LBflpl=0. Q.E.D.

Since the target formation p(t) satisfies the bearing constraints, it follows from Lemma 3 that LBffpf(t)+LBflpl(t)=0. Furthermore, since LBff is positive definite by Lemma 1 under Assumption 2, we have

(2.11)pf(t)=LBff1LBflpl(t)

Substituting (2.10) and (2.11) into (2.9) yields

δ˙(t)=kPLBffδ(t)kIξ(t)+LBff1LBflvl(t)(2.12)ξ˙(t)=LBffδ(t)

The δ - and ξ-dynamics given above can be written in a compact form as

(2.13)[δ˙ξ˙]=[kPLBffkIInfLBff0]A[δξ]+[LBff1LBfl0]vl(t).

Lemma 3

The state matrix A in (2.13) is Hurwitz for any kP,kI>0.

Proof:

Details of Proof

Suppose λ is an eigenvalue of A. Then,

det(λIA)=det([λI+kPLBffkIILBffλI])=det(λ2I+kPλLBff+kILBff)=det((kPλ+kI)(λ2IkPλ+kI+LBff)).

As a result, det(λIA)=0 implies either λ=kI/kP<0 or

λ2kPλ+kI=σ,

where σ is the eigenvalue of LBff. Since LBff is symmetric positive definite, we know σ is positive and real. The solution to the above equation can be easily calculated and it can be shown that λ<kI/kP<0. Q.E.D.

Since A is Hurwitz, system (2.13) is stable. When vl(t) is time-varying, the followers are not able to perfectly track the leaders. The fundamental reason is that the followers do not have access to the time-varying velocities of the leaders. When vl(t) is constant, the tracking error will globally converge to zero due to the integral action.

Theorem 3 (Global Convergence with Constant Leader Velocities)

When vl(t)=vl is constant, δ(t) and ξ(t) exponentially and globally converges to δ()=0 and ξ()=LBff1LBflvl/kI, respectively. As a result,

pf(t)pf(t)=LBff1LBflpl(t)p˙f(t)vf=LBff1LBflvl

as t.

Proof:

Details of Proof

Since A is Hurwitz and vl is constant, δ(t) and ξ(t) globally and exponentially converge to the steady state values of δ and ξ. By letting δ˙=0 and ξ˙=0, we can easily verify that the steady state values are δ()=0 and ξ()=LBff1LBflvl/kI. It follows from δ(t)0 and δ˙(t)0 that pf(t)pf(t) and p˙f(t)p˙f(t)=vf. Q.E.D.

By substituting ξ()=LBff1LBflvl/kI back into (2.12), it can be seen that the integral term ξ finally eliminates the impact of the "disturbance" vl.

The target formation is globally stable under the action of control law (2.7) if and only if it is bearing localizable.

Centroid and Scale Dynamics

We next study how the leaders should move in order to realize the desired translational and scaling formation maneuvers under the action of the proposed control law. In order to do that, we need to first define the centroid and scale of a formation and then analyze their dynamics. Define the centroid c(p(t)) and the scale s(p(t)) of p(t) as

c(p(t))1niVpi(t)=1n(1nId)Tp(t)s(p(t))1niVpi(t)c(p)2=1np(t)1nc(p)

which is similar to that of (2.4) in the leaderless case. The following two propositions show how the leaders should move to realize the desired translational and scaling maneuvers, respectively.

Proposition 1 (Translational Maneuvering)

If the velocity of each leader is constant and satisfies

vi=vc,iVl,

where vcRd is a common velocity, then

c˙(p(t))vc,s˙(p(t))0

which means the target formation p(t) moves at the common velocity while the scale is fixed.

Proof:

Details of Proof

Since vi(t)=vc,iVl, we have vl(t)=1nlvc. It follows from LB(1nvc)=0 that LBfl(1nlvc)+LBff(1nfvc)=0. As a result,

vf=LBff1LBflvl=1nfvc

Consequently, p˙=[(vl)T,(vf)T]T=1nvc. Substituting p˙ into c˙(p) and s˙(p) gives

c˙(p)=1n(1nId)Tp˙=1n(1nId)T(1nvc)=vc,s˙(p)=1n(p1nc(p))Tp1nc(p)p˙=1n(p1nc(p))Tp1nc(p)(1nvc)=0

Q.E.D.

Proposition 2 (Scaling Maneuvering)

If the velocity of each leader is constant and satisfies

(2.14)vi=αipi(t)c(p)pi(t)c(p),iVl,

where αiR is constant and satisfies αi/pi(t)c(p)=αj/pj(t)c(p) for all i,jVl, then

c˙(p(t))0,s˙(p(t))sgn(αi)1niVαi2,

which means the scale of the target formation p(t) is continuously varying while the centroid is fixed.

Proof:

Details of Proof

Since αi/pi(t)c(p)=αj/pj(t)c(p) for all i,jVl, there exists k(t) such that

αi=k(t)pi(t)c(p)

and hence vi=k(t)(pi(t)c(p)) for all iVl. Then, vl can be expressed as vl=k(t)(p1nlc(p)). It follows from LB(p1nc(p))=0 that LBfl(pl1nlc(p))+LBff(pf1nfc(p))=0. As a result,

vf=LBff1LBflvl=k(t)(pf1nfc(p)).

Consequently, p˙=[(vl)T,(vf)T]T=k(t)(p1nc(p)). Substituting p˙ into c˙(p) and s˙(p) gives

c˙(p)=1n(1nId)Tp˙=1n(1nId)T(p1nc(p))k(t)=0,

and

s˙(p)=1n(p1nc(p))Tp1nc(p)p˙=k(t)1n(p1nc(p))Tp1nc(p)(p1nc(p))=k(t)1np1nc(p)=k(t)1niVpi(t)c(p)2=k(t)1niVαi2k2(t)=sgn(αi)1niVαi2.

Q.E.D.

In Proposition 2, if αi>0, the velocity of each agent is pointing from the fixed centroid to the agent and hence the formation scale dilates; otherwise, if αi<0 the formation scale shrinks. It should be noted that vi given in (2.14) is constant though pi(t) is time-varying.

When the velocity of the leaders is a linear combination of a translational and a scaling term, both the centroid and the scale of the formation will be time-varying. Denote c(p(t)) and s(p(t)) as the centroid and the scale of the real formation p(t), respectively. By combining Theorem 3, Proposition 1, and Proposition 2, we obtain the following theorem.

Theorem 4

Under Assumption 2, if the velocity of each leader is constant and there exist constant vcRd and αiR such that vi can be decomposed to

(2.15)vi=vc+αipi(t)c(p)pi(t)c(p),iVl,

where αi satisfies αi/pi(t)c(p)=αj/pj(t)c(p) for all i,jVl. As a result,

c˙(p(t))vc,s˙(p(t))sgn(αi)1niVαi2.

Furthermore, c˙(p(t)) and s˙(p(t)) globally converge to c˙(p(t)) and s˙(p(t)), respectively.

Proof:

Details of Proof

Since the target formation p(t) satisfies the bearing constraints, it follows from Lemma 1 that LBp(t)=0, which implies LBv(t)=0. Since the bearing constraints imply infinitesimal bearing rigidity, then Null(LB)=span{1nId,p}. As a result, if v is constant, it can always be expressed as a linear combination of 1nId and p1nc(p). Therefore, equation (2.15) holds. The rest of the theorem directly follows from Theorem 3, Proposition 1, and Proposition 2. Q.E.D.

Remarks on Theorem 4

  1. In order to achieve the desired translational or scaling maneuvering, the leaders must collaborate and share some global information like a common velocity and the centroid of the formation.
  2. vi given in (2.15) is constant because the unit vector (pi(t)c(p))/pi(t)c(p) is invariant to translational and scaling maneuvers though pi(t) is not.

2.4 Moving Leaders with time-varying velocities

If the leader velocities are time varying, then (2.7) would fail to ensure zero tracking errors. The time-varying case can be handled by the following control law that requires velocity feedback:

(2.16)p˙i(t)=Ki1jNiPgij[kp(pi(t)pj(t))p˙j(t)],iVf

where Ki=jNiPgij. The stability of (2.16) is proven next.

  1. The nonsingularity of Ki is guaranteed by the bearing localizability of the target formation with following Lemma 4.
  2. Multiplying Ki on both sides of (2.16) yields ε˙i=kpεi, where εi=ΣjNiPgij(pi(t)pj(t)) for iVf. It follows that εi0 as t for all iVf, and consequently gijgij when the network is bearing localizable.

Lemma 4 [4]

The matrix Ki is nonsingular for all iVf if the target formation is unique.

Proof:

Details of Proof

First of all, the matrix Ki is singular if and only if the bearings {gij}jNi are collinear, because for any xRd,xKix=0jNixPgijx=0Pgijx=0,jNi. Since Null(Pgij)=span{Pgij}, we know xKix=0 if and only if x and {gij}jNi are collinear. If {gij}jNi are collinear, the follower pi cannot be uniquely determined in the target formation because pi can move along gij without changing any bearings. As a result, if Ki is singular, the target formation is not unique. Q.E.D.

Under the action of (2.7) and (2.16), the formation is able to perform translational and scaling formation maneuvers. A translational maneuver means that all agents move at a common velocity, such that the formation translates as a rigid body. A scaling maneuver means that the scale of the formation, which can be described by the distance from each agent to the formation centroid, varies while the geometric pattern of the formation is preserved. To achieve the scaling maneuver, the leaders need only to adjust the distances among them. One merit of the bearing-based control laws is that the desired maneuver is known only to the leaders, and the followers are not required to access or estimate it.

3 Double Integrators

Consider the case where the dynamics of each mobile agent can be modeled as a double integrator

p˙i(t)=vi(t)(12)v˙i(t)=ui(t)

where ui(t) is the acceleration input to be designed.

3.1 Moving Leaders with constant nonzero velocities [4]

If the velocities of the leaders are constant, then the bearing-based formation control problem can be solved by

p˙i(t)=vi(t)(3.1)v˙i(t)=jNiPg˙ij[kp(pi(t)pj(t))+kv(vi(t)vj(t))]

where iVf and kp,kv are positive constant control gains. Under control law (3.1), the target formation is globally stable if it is bearing localizable.

3.2 Moving Leaders with time-varying velocities

If the velocities of the leaders are time varying, then the following control law requiring acceleration feedback can be used to track time-varying target formations:

p˙i(t)=vi(t)(14)v˙i(t)=Ki1jNiPgijy˙[kp(pi(t)pj(t))kv(vi(t)vj(t))+v˙j(t)]

where iVf and Ki=jNiPgij. The nonsingularity of Ki for any iVf is guaranteed by the bearing localizability of the target formation (Lemma 4). Under (14), the target formation is globally stable if and only if it is bearing localizable.

In practice, absolute acceleration can be measured by each agent using, for example, IMU and then transmitted to its neighbors by wireless communication. Because of measurement errors and transmission delays, the acceleration measurement is corrupted by errors. However, since the system is linear, bounded acceleration errors would cause bounded tracking errors. Bearing-based formation control in the presence of other problems (including input disturbance, input saturation, and collision avoidance) was addressed in [4]. TODO

4 Bearing-Based Formation Control of Unicycles [5]

Suppose the dynamics of agent iV can be described by the unicycle model

(4.1)x˙i=vicosθi,y˙i=visinθi,θ˙i=wi,

where pi=[xi,yi]TR2 is the coordinate of agent i,θiS1 is the heading angle, and viR and wiR are the linear and angular velocities, respectively, to be designed. Here, S1 is the 1D manifold on the unit circle. The bearing-based formation control law for unicycles is

(4.2)vi=[cosθi,sinθi]jNiPgij(pj(t)pi(t))wi=[sinθi,cosθi]jNiPgij(pj(t)pi(t))

When there are no leaders, (4.2) ensures global stability in the sense that gij(t) converges to either gij or gij as t, given any initial values of pi(0) and θi(0) if the target formation is infinitesimally bearing rigid [5]. The final value of θi is not specified in the control law.

Details from [5] can be seen in Formation Control of Mobile Agents With Motion Constraints.

5 Bearing-only Formation Control

This section introduces the theory of bearing-only formation control, which studies how to steer a group of agents to achieve a bearing-constrained target formation using bearing-only measurements. Suppose the target formation is specified by constant bearing constraints {gij}(i,j)ε, and there are no leaders. The control objective is to govern the positions of the agents {pi(t)}iV such that gij(t)gij for all (i,j)ε as t. All bearings are expressed in a common reference frame.

The following nonlinear control law, proposed in [28], can be used to solve the bearing-only formation control problem:

(5.1)p˙i(t)=jNiPgij(t)gij,iV,

where Pgij(t)=Idgij(t)gijT(t). The geometric interpretation of the control law is illustrated in Figure 5.1. Some properties of the control law are highlighted below.

  1. The control of each agent requires only bearing measurements and no distance or position estimation.
  2. The control input of (5.1) is always bounded as p˙i(t)jNiPgij(t)gij=|Ni|, since Pgij(t)=gij=1.
  3. The centroid and scale of the formation are invariant under the control law. Here, the centroid is defined as the average position of the agents, and the scale as the standard deviation of the distances from the agents to the centroid.
Law
Figure 5.1: The geometric interpretation of the bearing-only control law in [$(5.1)$](#eq-5.1). Since the control term $-P_{\boldsymbol{g}_{i j}} \boldsymbol{g}_{i j}^{*}$ is perpendicular to the bearing $\boldsymbol{g}_{i j}$. The control law aims to reduce the bearing error of $\boldsymbol{g}_{i j}(t)$ while maintaining the distance between agents $i$ and $j$.

Control law (5.1) is nonlinear and almost globally stable if the target formation is infinitesimally bearing rigid [28, Th. 11]. The term almost is due to the fact that there are two isolated equilibria of the error dynamics: desired and undesired. At the desired equilibrium, the bearings are equal to the desired values; that is, gij=gij for (i,j)ε. At the undesired equilibrium, the bearings are opposite to the desired values; that is, gij=gij for (i,j)ε. The formations at the two equilibria have the same centroid and scale but opposite bearings. The almost global stability means that the formation would converge to the desired equilibrium unless the initial formation lies exactly on the undesired equilibrium, which can be shown to be an unstable one.

Control law (5.1) is a modified gradient-descent control law. Consider the following objective function:

ϕ1=12(i,j)εgijgij2=(i,j)ε(1gijTgij).

The objective function is equal to zero if and only if gij=gij for all (i,j)ε. The corresponding gradient-descent control law is

(5.2)p˙i(t)=jNi1eij(t)Pgij(t)gijiV.

This control law requires both bearing and distance measurements. Removing the distance term eij(t) in (5.2) yields the bearing-only formation control law in (5.1).

An optimization-based approach for bearing-only formation control can be found in [10] and [65] (TODO), where a bearing-only control law is proposed as

(5.3)p˙i(t)=jNi(gij(t)gij),iV.

This is a gradient-descent control law with the corresponding objective function as

ϕ2=14(i,j)εeijgijgij2=12(i,j)εeij(1gijTgij).

Since ϕ2 contains eij,ϕ2 is zero when gij=gij or eij=0. As a result, the scale of the formation always decreases under the action of control law (5.3). Simulation shows that this control law may steer all agents to the same position, given certain initial conditions. To avoid this problem, leaders must be introduced [65].

References

  1. Shiyu Zhao and Daniel Zelazo, Bearing rigidity theory and its applications for control and estimation of framework systems: life beyond distance rigidity, IEEE Control Syst. Mag., vol. 39, no. 2, pp. 66–83, Apr. 2019: BEARING-BASED fORMATION CONTROL.
  2. Shiyu Zhao and Daniel Zelazo, Bearing-based distributed control and estimation of multi-agent systems, in 2015 European Control Conference (ECC), Jul. 2015, pp. 2202–2207: Section IV. Convergence Analysis except the Network Localization part.
  3. Shiyu Zhao and Daniel Zelazo, Bearing-based formation maneuvering, in 2015 IEEE International Symposium on Intelligent Control (ISIC), Sep. 2015, pp. 658–663: Section III & IV.
  4. Shiyu Zhao and Daniel Zelazo, Translational and Scaling Formation Maneuver Control via a Bearing-Based Approach, IEEE Trans. Control Netw. Syst., vol. 4, no. 3, pp. 429–438, Sep. 2017: Lemma 4.
  5. Shiyu Zhao, D. V. Dimarogonas, Zhiyong Sun, and D. Bauso, A General Approach to Coordination Control of Mobile Agents With Motion Constraints, IEEE Transactions on Automatic Control, vol. 63, no. 5, pp. 1509–1516, May 2018.

  1. The network localization protocol in [1] is p^˙i(t)=jNiPgij(p^i(t)p^j(t)),iVf where ()^ means the estimation of position. The objective is to drive p^i(t)pi for all iVf as t. ↩︎

Released under the MIT License.