Intrinsic Reduced Attitude Formation with Ring Inter-Agent Graph
Wenjun Song, Johan Markdahl, Silun Zhang, Xiaoming Hu, Yiguang Hong

TL;DR
This paper presents a novel approach for reduced attitude formation control in multi-agent systems using feedback based on relative attitudes, demonstrating convergence to specific formations depending on group size parity.
Contribution
It introduces a sign-reversal of a classic consensus protocol for formation control under various graph topologies, revealing new formation behaviors.
Findings
Convergence to antipodal points for even group sizes.
Equidistant distribution on a great circle for odd group sizes.
Almost global convergence under undirected ring topology.
Abstract
This paper investigates the reduced attitude formation control problem for a group of rigid-body agents using feedback based on relative attitude information. Under both undirected and directed cycle graph topologies, it is shown that reversing the sign of a classic consensus protocol yields asymptotical convergence to formations whose shape depends on the parity of the group size. Specifically, in the case of even parity the reduced attitudes converge asymptotically to a pair of antipodal points and distribute equidistantly on a great circle in the case of odd parity. Moreover, when the inter-agent graph is an undirected ring, the desired formation is shown to be achieved from almost all initial states.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Intrinsic Reduced Attitude Formation with Ring Inter-Agent Graph
Wenjun Song [email protected]
Johan Markdahl [email protected]
Silun Zhang [email protected]
Xiaoming Hu [email protected]
Yiguang Hong [email protected] Optimization and Systems Theory, Department of Mathematics, KTH Royal Institute of Technology, 100 44 Stockholm, Sweden
Key Laboratory of Systems and Control, Academy of Mathematics and Systems Science, Chinese Academy of Sciences, 100190 Beijing, China
Control and Simulation Center, Harbin Institute of Technology,150001 Harbin, China
Abstract
This paper investigates the reduced attitude formation control problem for a group of rigid-body agents using feedback based on relative attitude information. Under both undirected and directed cycle graph topologies, it is shown that reversing the sign of a classic consensus protocol yields asymptotical convergence to formations whose shape depends on the parity of the group size. Specifically, in the case of even parity the reduced attitudes converge asymptotically to a pair of antipodal points and distribute equidistantly on a great circle in the case of odd parity. Moreover, when the inter-agent graph is an undirected ring, the desired formation is shown to be achieved from almost all initial states.
keywords:
Attitude control; distributed control; asymptotic stability; nonlinear systems; linearization.
††thanks: This paper was not presented at any IFAC meeting.
, , , ,
1 Introduction
Multi-agent coordination [3, 8, 10, 19] has gained increasing recognition and appreciation during the last decade. Following many significant results on consensus, how to effectively generate various multi-agent formations, patterns or subgroup divisions has attracted much attention. Among the problems studied, attitude formation of multiple rigid-body agents is of key importance with wide potential applications such as formation flying [3, 23] and multi-camera surveillance [29, 31]. Attitude synchronization or consensus, a special and simple formation pattern of attitudes, has been widely studied [27, 28, 22, 25].
The (full) attitude of a rigid-body agent can be represented by a rotation matrix that evolves on the Lie group . However, many attitude control applications do not require all three degrees of freedom of the full attitude to be determined. In rigid-body pointing applications, for example a body-fixed camera, the solar panel of a satellite or an antenna need to point towards some desired direction, the rotation about the pointing axis is irrelevant since this rotation does not change the direction in which the agent points. Moreover, in under-actuated situations where the rigid-body is actuated by only two independent control torques, for example due to the failure of a third actuator, the rotation about the unactuated axis is disregarded. The reduced attitude provides the proper framework to deal with such a situation [5]. All these applications lead to a reduced attitude control problem [5, 6, 12, 15], in which the reduced attitude of two degrees of freedom is naturally identified with a point on the 2-sphere .
Consider the attitude formation problem for a system of rigid-body agents on the product manifold or under a continuous feedback control law based on relative attitude information. It can be shown that consensus states are intrinsic equilibria of the closed-loop system regardless of the topology of the inter-agent graph. The work [27] and [20] achieve this attitude synchronization for full attitudes and reduced attitudes respectively. However, due to the fact that and are compact manifolds without boundary [4], continuous time-invariant feedback control also yields some other closed-loop equilibria that vary with the graph topology. These equilibria represent different attitude configurations of the system, which may include a desired formation depending on the application. A natural and interesting question thus arises: is it possible to achieve a desired formation by imposing some suitable inter-agent graph to the system and designing a feedback control with only relative attitude information that stabilizes the formation?
It is increasingly recognized that one of the important ideas in multi-agent systems is to design simple distributed control algorithms with not only cooperative but also antagonistic interactions between neighboring agents. Modulus consensus requires the moduli of all agent states to reach a common value but the agents may be separated into several antagonistic subgroups. The simplest case concerning two antagonistic subgroups, bipartite consensus, models the inter-agent connection as a signed graph [1, 2, 30]. For a general modulus consensus case or even the extended set surrounding case, signed graphs are replaced by the graphs with complex weights expressed with complex adjacency matrices [14]. These results demonstrate that antagonistic interactions are effective to generate new coordination or formation patterns, but the considered dynamics basically evolve in Euclidean spaces. Additionally, cooperative control of motion on the circle and sphere with both attractive and repulsive couplings are studied in [18] and [13], respectively, but the inter-agent graph is required to be undirected and complete.
By extending the coordination studies with antagonistic interactions discussed in Euclidean spaces to those on compact manifolds, this paper provides a partial but affirmative answer to the aforementioned question via investigating reduced attitude formation with both undirected and directed ring inter-agent graph. In particular, we focus on the generation of attitude formation patterns using only relative attitude information of a group of rigid-body agents. Compared to the full attitude formation problem, the reduced attitude formation is more intuitive and easier to visualize.
In this paper, a simple angular velocity control for reduced attitude formation is proposed on the basis of antagonistic interactions between neighboring agents. Due to the geometry of the 2-sphere some interesting phenomena are observed: the closed-loop system behaves differently under the proposed distributed control when the parity of the total number of agents is different. Specifically, the antipodal formation is achieved when the number is even, and the cyclic formation is achieved when the number is odd. It is shown that these two reduced attitude formations are intrinsic in the sense that they result from the geometry of the 2-sphere and the topology of the inter-agent graph. It is worthwhile to mention that, in addition to the simple control structure, another strength of the proposed method is that we do not need to have the desired formation given beforehand or the formation errors in the control, in contrast to most existing methods [3, 24, 32].
Comparing the control protocol and the resulting formation in this paper with that of [2, 30] in Euclidean space, there are mainly two differences: (i) for neighboring agents with antagonistic interaction, only relative states of neighboring agents is utilized in reduced attitude control, while absolute position of neighboring agents is required in the control of [2, 30]; (ii) in the case of ring inter-agent graph, if the total number of agents is odd and all neighboring agents are antagonistic, cyclic reduced formation can be attained due to the geometry of the 2-sphere, while the positions of all agents in [2, 30] reach consensus at the origin because the graph is unbalanced.
The rest of the paper is organized as follows: in Section 2, necessary preliminaries on the reduced attitude and the 2-sphere are introduced. In Section 3, the reduced attitude formation problem with the ring inter-agent graph is formulated and a distributed angular velocity control law is proposed. The antipodal formation and cyclic formation of reduced attitudes are discussed in Section 4 and Section 5, respectively. Following that, illustrative examples are provided in Section 6, and the conclusions are given in Section 7.
2 Notations and preliminaries
This paper considers the reduced attitude control problem for a network of rigid-body agents. In this section, we give some preliminaries on the reduced attitude and the 2-sphere.
Let the index set represent the agents in the network. Denote as the attitude of agent relative to the inertial frame , where is the rotation group of . The kinematics of is governed by [16]
[TABLE]
where is the angular velocity of agent in the inertial frame , and the hat operator is defined by the equality that for any .
Suppose that is a constant pointing direction in the body-fixed frame of agent , where is the 2-sphere and is the Euclidean norm. Let denote the same pointing direction resolved in the inertial frame , then, . is referred to as the reduced attitude of agent since the rotation of agent about is ignored. In the paper, we use a parametrization of given as follows
[TABLE]
where and . In fact, when , the two angles and are the respective pitch and yaw angles of the rotation . By the kinematics (1) of the full attitude, the kinematics of is governed by [12]
[TABLE]
The tangent space of at a point is given by . Rotating about a unit axis through an arbitrary angle transforms it to another point , where is the matrix exponential. For any two reduced attitudes , define and as
[TABLE]
It holds that . Notice that the above equation for the unit axis is valid only when . When or , we stipulate that is chosen as any unit vector orthogonal to .
The geodesic distance between any two points , denoted as , is the length of the shorter arc on the great circle of joining the two points. Therefore,
[TABLE]
The following lemma gives the relationship among geodesic distances of any three points on the 2-sphere, which can be verified using spherical cosine formula. More details about the geometry of the 2-sphere can be found in [17, 26].
Lemma 1**.**
For any three points ,
[TABLE]
[TABLE]
Furthermore, lie on a great circle of if and only if , or .
Denote the state space of the system (2) as the product manifold , which is the -fold Cartesian product of with itself. We use to denote the state of the system, and use the metric in as
[TABLE]
For a set , define the distance from a point to as
[TABLE]
3 Problem formulation and control design
In this section we provide a detailed description of the system and state the problem formulation. The qualitative behaviour of the system depends on the parity of the number of agents whereby the even and odd cases are treated separately. The second half of this section concerns the control design.
3.1 Intrinsic reduced attitude formation
We model information exchange between the agents by a graph , where the vertex set is given in Section 2 and the edge set . is undirected if the node pair of each edge is unordered, otherwise it is directed. A node is said to be a neighbor of if , and is denoted as the set of neighbors of node . Throughout the paper, modulo operation is used to identify agents, for example, agent [math] is the same as agent and agent is the same as agent .
Assumption 2**.**
The inter-agent graph is either an undirected ring (or cycle), i.e., for any ; or a directed ring (or cycle), i.e., for any .
Under Assumption 2, we define as
[TABLE]
which is the minimal geodesic distance between the reduced attitudes of neighboring agents. Before giving the main description of the reduced attitude formation problem in the paper, we give the following two lemmas about the maximal value of , which result from the geometry of the 2-sphere. The proofs can be found in Appendix A.
Lemma 3**.**
Suppose is even, then
[TABLE]
Furthermore, if and only if , where
[TABLE]
Lemma 4**.**
Suppose is odd, then
[TABLE]
It holds that if and only if , where
[TABLE]
Notice that the manifold (or ) is empty when is odd (or even).
When is even and , the agents are divided into two groups indexed by and , respectively. The reduced attitudes are identical in the same group, and opposite in different groups, which is a pair of antipodal points on . Under Assumption 2, the geodesic distance between the reduced attitudes of any two neighboring agents is . We refer to this configuration for the system as an antipodal formation of reduced attitudes, a similar terminology as bipartite consensus [2] of positions and bipolar synchrony [18] on the unit circle .
When is odd and , the reduced attitudes of the system lie equidistantly on a great circle with agents indexed by on one half circle and agents indexed by on the other. The minimal geodesic distance between the reduced attitudes of any agent and every other agent is . Under Assumption 2, the geodesic distance between the reduced attitudes of any two neighboring agents is . We refer to this configuration for the system as a cyclic formation of reduced attitudes.
We are now ready to describe the reduced attitude formation problem that is addressed in this paper.
Reduced attitude formation problem: construct an angular velocity controller for each agent with such that whenever is even and whenever is odd are asymptotically stable.
Remark 5**.**
Since the coordinates of resolved in the body-frame of agent is , where is the pointing direction of agent seen from agent , it is a relative reduced attitude information.
3.2 Control design and closed-loop system
In the paper, we propose the following distributed control rule:
[TABLE]
By the reduced attitude kinematics (2), the closed-loop system can be written as
[TABLE]
The next lemma states that the form of (4) is invariant to any rotational coordinate transformation.
Lemma 6**.**
For any and , the closed-loop system (4) is invariant under the coordinate transformation
[TABLE]
i.e., the closed-loop system in terms of is
[TABLE]
Using the parametrization (2), the closed-loop system (4) can also be written in terms of as
[TABLE]
where .
Remark 7**.**
Let the local potential function for agent be
[TABLE]
The gradient of on at is given as
[TABLE]
*Therefore, the angular velocity control (3) makes the reduced attitude of agent move toward the positive gradient direction of at , which means every agent tries to keep its reduced attitude away from the reduced attitudes of its neighboring agents. *
Remark 8**.**
If we reverse the sign in (3) such that
[TABLE]
then with certain assumption on the connectivity of the inter-agent graph, reach consensus asymptotically provided that their initial values lie on the surface of an open hemisphere, which is half . Proof of this conclusion can refer to [28] for undirected graph and [25] for directed and time-varying graph. By imposing a reshaping function on the control algorithm, [27] shows that the new control rule makes the consensus manifold almost global attractive. Notice that with the control law (7), any reduced attitudes configuration that lies on a great circle (including and ) except the consensus case is unstable since this kind of configuration is on the boundary of the region of attraction of the consensus manifold.
The consensus manifold of reduced attitudes is an intrinsic equilibrium set of the closed-loop system (4), and by Remark 8, it is unstable. The next two sections will show that the antipodal formation manifold with even number of agents and the cyclic formation manifold with odd number of agents are asymptotically stable under Assumption 2. Since the desired formation is not used in the control (3), we refer to this kind of formation as intrinsic reduced attitude formation.
Remark 9**.**
Unlike the reduced attitude coordination, concerning the full attitude coordination problem with regular inter-agent graph, simulation demonstrates that a configuration of the full attitudes that lie equidistantly on a closed geodesic of is asymptotically stable by a basic synchronization control law without any need to reverse the sign [27].
In the paper, because is not differentiable in the whole state space, we take the candidate Lyapunov function as
[TABLE]
instead, where . Calculating the time derivative of along the trajectory of the closed-loop system (4) yields
[TABLE]
We denote as the upper right Dini time derivative of along the trajectory of the closed-loop system (4). (Details about Dini derivative can be found in [9, 21].) And define the set of as
[TABLE]
4 Antipodal formation
In this section, we suppose the total number of agents is even and discuss the stability of the set when is a ring. To this end, we first study a quantified relationship between the distance of the state to the antipodal formation manifold and the minimal geodesic distance of neighboring agents in Lemma 10. This relationship contribute to the proof of Lyapunov stability of in Theorem 14.
Lemma 10**.**
Suppose is even and . Then
[TABLE]
{pf}
Since there is a with for any such that , we obtain by the triangle inequality that
[TABLE]
which implies (9).
Let for any . Then .
Since , we only need to show that
Notice that . Then, for any ,
[TABLE]
Similarly, for any ,
[TABLE]
Hence, . ∎
In the next lemma, the Dini time derivative of is analyzed along the trajectory of the closed-loop system.
Lemma 11**.**
Suppose is even, Assumption 2 holds and . Then for any and . Moreover, if for some , then
[TABLE]
{pf}
Take any satisfying .
When , . By (8), their time derivative along the closed-loop system (4) is if is undirected and if is directed, then the conclusions follow consequently.
When , take any , then for any , , which implies
[TABLE]
for any . If is an undirected ring, since for any , we have
[TABLE]
Then, if is a directed ring,
[TABLE]
In both cases, . Moreover, since (12) is fulfilled for any , implies (11). ∎
Due to the fact is an equilibrium set of the closed-loop system (4), it is (positively) invariant. We are now ready to give the local stability of the invariant set .
Theorem 12**.**
Suppose is even. Then under Assumption 2, the invariant set is asymptotically stable with the region of attraction containing
[TABLE]
{pf}
In order to prove the asymptotical stability of the invariant set , both stability and atrractivity of need to be shown. We first show that is stable. For any , let . Then for any initial state satisfies , by (9). Due to the fact , by Lemma 11. Then for all and is non-increasing on . Therefore, for any , which implies for any by (10). Hence, is stable.
In the following, we use to denote the trajectory of the closed-loop system (4) starting from at .
Next we prove that is also attractive. To this end, we only need to show, for any ,
[TABLE]
First, from the above proof, we have for any . In addition, since ,
[TABLE]
Combining with and for any , we infer there is a constant
[TABLE]
such that . If , then (13) follows consequently by Lemma 3. In the following, we suppose and show this leads to a contradiction.
Since the trajectory is bounded, its positive limit set is nonempty and positively invariant. For any limit point , there exists an increasing time sequence such that as , and . By continuity of , we obtain
[TABLE]
Take any and consider another trajectory . Clearly, and for any . Define
[TABLE]
Since , . Then we claim that for any . Suppose this is not true, then there exist and such that . Hence, , and by Lemma 11 there are two cases for which are discussed as follows.
Case 1: . Since is continuous in time, there exists an such that for any . Combining with , we obtain , which contradicts .
Case 2: . Let . By Lemma 11, since , we obtain
[TABLE]
Therefore, . If , this turns to Case 1 and leads to a contradiction. Thus, . Repeating these arguments, since is a ring, we obtain
[TABLE]
This indicates that lie on a great circle whose axis is , and for any . Hence, , which is a contradiction since rotating about that is orthogonal to through an angle can not return to .
As a result, we conclude that for any . Then for any . This contradicts (14) since is positively invariant. Hence, and the conclusion follows consequently. ∎
Since is an equilibrium set of the closed-loop system (4), the above theorem ensures that the reduced attitudes of the agents with initial values in reach a static antipodal formation eventually provided that the inter-agent graph is a ring, either undirected or directed. When , has measure one and is everywhere dense, which means the domain of attraction of is almost all .
Corollary 13**.**
For the trivial case , is almost globally asymptotically stable under Assumption 2.
Because the state space is compact without boundary, there are multiple disjoint equilibrium manifolds for the closed-loop system (4). The next theorem shows that the region of attraction for the antipodal formation manifold is almost all provided that is an undirected ring.
Theorem 14**.**
Suppose is even and is an undirected ring. As time tends to infinity, every trajectory of the closed-loop system approaches one of its equilibrium manifolds, among which is the only stable one.
{pf}
By Corollary 13, we only need to consider the nontrivial case in the following proof.
First, we show every trajectory of (4) approaches the equilibrium set of the closed-loop system. Let . By (8), the time derivative of along the trajectory of the closed-loop system (4) is given as
[TABLE]
Thus, by LaSalle’s invariance principle [11], as every trajectory of (4) approaches , which is the entire equilibrium set of the closed-loop system. By Theorem 12, the equilibrium set is asymptotically stable.
Next we take any and show that is unstable by applying the Lyapunov’s indirect method. Denote as the parametrization of corresponding to (2). Due to the fact , there is a such that lie on the great circle of orthogonal to . Denote as the north pole. If , let and . Then through coordinate transformation for any , the corresponding equilibrium of the new system lie on the great circle of orthogonal to , i.e., the equator. And by Lemma 6, the stability of with respect to the original system is consistent with the stability of with respect to the new system. Therefore, without loss of generality, we assume . Then and for any .
Let . Computing the linearization of the closed-loop system (5)-(6) about yields
[TABLE]
The above linearizations for and are decoupled and we then denote the respective system matrices of (15) and (16) as , both of which are symmetric due to the fact is undirected. Let for any and . Then
[TABLE]
Due to the fact , there is an such that , which implies and has at least one positive eigenvalue, i.e., is unstable. ∎
Remark 15**.**
When is a directed ring, all trajectories of the closed-loop system (4) eventually approach an invariant set which also contains non-equilibrium points. When is an undirected ring, the Jacobian matrix of the closed-loop system (5)-(6) about any equilibrium has zero eigenvalues and negative eigenvalues. The existence of the zero eigenvalues makes the linearization fail to determine the stability of . As a fact, any eigenvector of the zero eigenvalue corresponds to a tangent vector of at . An explanation for why there are zero eigenvalues is that the invariant manifold has two degrees of freedom in the whole state space .
5 Cyclic formation
In this section, we suppose the total number of agents is odd and discuss the stability of the set when is a ring. This section will proceed similar to Section 4, however, the theoretical analysis is more complicated.
We start with a lemma to provide the upper bound of , whose proof can be found in Appendix A.
Lemma 16**.**
Suppose is odd, and
[TABLE]
If , then .
Next, in order to prove the Lyapunov stability of invariant set , the relationship between and is investigated in Lemma 17.
Lemma 17**.**
Suppose is odd and . Then
[TABLE]
If , then
[TABLE]
{pf}
The proof for (18) is similar to that of Lemma 10 and is omitted here.
Let . Then
[TABLE]
Since , we obtain
[TABLE]
Therefore, for any . Since , by Lemma 16. ∎
Lemma 18**.**
Suppose is odd, Assumption 2 holds and . Then for any and . If for some , then .
{pf}
For any such that , it holds that for any and . The remaining of the proof is similar to that of Lemma 11 and is omitted here.∎
When Assumption 2 holds, for any and by (8). Therefore, the set is (positively) invariant with respect to the closed-loop system (4). In particular, is an equilibrium set when the inter-agent graph is an undirected ring. With Lemma 17 and Lemma 18, we are ready to state the local stability of the invariant set in the next theorem.
Theorem 19**.**
Suppose is odd and Assumption 2 holds. The invariant set is asymptotically stable with the region of attraction containing
[TABLE]
{pf}
We first show that is stable. For any , let . Take any initial state satisfying . Then by (18). Since , by Lemma 18, implying for any and is non-increasing on . Hence, for any . Then due to the fact for any , for any by (19). Therefore, is stable.
Next we show that is also attractive. Denote as the trajectory of the closed-loop system (4) starting from at . Take any . By the above proof, for any . Then since
[TABLE]
and for any by Lemma 4, there is a constant
[TABLE]
such that . Similar to the proof of Theorem 12, it can be verified that , which implies by Lemma 4. The proof is completed. ∎
When the inter-agent graph is an undirected ring, since is an equilibrium set of the closed-loop system (4), the reduced attitudes of the system with initial values in the set reach a static cyclic formation eventually by Theorem 19.
When is a directed ring, a rotating cyclic reduced attitude formation is attained, where the whole formation is rotating about the axis of the great circle. Moreover, by the control law (3), the magnitude of the angular velocity of any agent equals .
The next theorem further demonstrates that the region of attraction for the cyclic formation manifold is almost all provided that is an undirected ring.
Theorem 20**.**
Suppose is odd and is an undirected ring. As time tends to infinity, every trajectory of the closed-loop system approaches one of its equilibrium manifolds, among which is the only stable one.
{pf}
Let be the entire equilibrium set of the closed-loop system (4) and take any . Similar to the proof of Theorem 14, we only need to show that is unstable. To this end, we analyze the eigenvalues of the Jacobian matrix and of the linearization system (15)-(16).
Denote as the parametrization of corresponding to (2). Without loss of generality, we assume and for any . Due to the fact , there exist and such that and for any . We group the equilibrium into two categories and discuss them as follows.
Category 1: does not hold, that is, and for some . If , let such that and other entries be [math], then . Otherwise , in this case we take such that and other entries be [math], then . Therefore, has at least one positive eigenvalue.
Category 2: for any . Then due to the fact for any , . Since , this implies
[TABLE]
Because is a circulant matrix (see [7] for details), its eigenvalues can be written explicitly as
[TABLE]
Then .
In conclusion, the system matrix of the linearization system around any has at least one positive eigenvalue, indicating that is unstable. ∎
Remark 21**.**
When the inter-agent graph is an undirected ring, the Jacobian matrix of the closed-loop system (5)-(6) about any equilibrium has zero eigenvalues and negative eigenvalues. Similar to the antipodal reduced attitude formation case, any eigenvector of the zero eigenvalue corresponds to a tangent vector of at . The difference lies in that when the number of agents is odd, the structure of has three degrees of rotational freedom in . Explicitly, rotating about any axis, which can be either orthogonal or coplanar to the great circle, through any angle will reach another point in the manifold , that is, the tangent space of any point on has three degrees of freedom.
6 Simulations
In this section, we present numerical examples that demonstrate the convergence of the proposed control law (3).
Concerning the antipodal reduced attitude formation, we consider a system of rigid-body agents. The resulting trajectories are illustrated in Fig. 1, where Fig. 1(a) and Fig. 1(b) share identical initial states but with the undirected and directed ring inter-agent graph, respectively. In both cases, the reduced attitudes converge to a pair of antipodal points on , one with oddly indexed agents and the other with evenly indexed agents.
Concerning the cyclic reduced attitude formation, we consider a system of rigid-body agents with the directed ring inter-agent graph. The reduced attitudes initially randomly distribute on as illustrated in Fig. 2(a) and converge to a great circle with equidistant distribution as shown in Fig. 2(b)-2(d). Fig. 2(e) illustrates the time response of the magnitudes of the angular velocities of the agents, which validates that the cyclic formation is rotating about the axis of the great circle with the angular velocity as (rad/s).
7 Conclusions
This paper investigates the reduced attitude formation problem for a system of rigid-body agents with the ring inter-agent graph. A distributed control law is proposed to stabilize the formation in which the reduced attitudes of any neighboring agents are at the furthest geodesic distance form one another. When the total number of agents is even, the agents are divided into two groups with antipodal reduced attitudes. When the total number of agents is odd, the reduced attitudes of the system distribute equidistantly on a great circle, and a rotating cyclic formation is achieved provided that the ring inter-agent graph is directed.
As the inter-agent topology varies from a ring, other interesting formations may arise. Our recent preliminary work shows that for a more general formation, the communication graph should be selected from the class of graphs sharing the same symmetries with the formation, which suggests that the more symmetries a formation possesses, the easier it can be achieved by our approach. Moreover, as the existence of ”intrinsic” formations is partially caused by the compactness of , more formations could be obtained in other compact spaces following this ”intrinsic” idea.
Appendix A Proofs
A.1 Proof of Lemma 3
Due to the fact for any , we only need to show if and only if .
(Sufficiency) Take any , then for any . Since is even, . Hence, for any , which implies .
(Necessity) Suppose , then for any . Hence, for any , which indicates .
A.2 Proof of Lemma 4
Take any . We first show that .
By the triangular inequality and which followed from Lemma 1, we obtain
[TABLE]
which implies .
Next we show if and only if .
(Sufficiency) Take any , then
[TABLE]
for some and . Because is odd, . Then,
[TABLE]
Hence, .
(Necessity) Suppose . Since
[TABLE]
it follows that for any . Then due to the fact , both equal signs in (A.2) and (21) hold. This implies for any and lie on a great circle of . Let . Because , lie equidistantly on the shorter arc of the great circle joining and . Therefore,
[TABLE]
holds for . Because , is the middle point of the longer arc of the great circle joining and . Therefore,
[TABLE]
holds for . As a result, for any , i.e., .
A.3 Proof of Lemma 16
Let for any . Then and we will show that .
Clearly, and
[TABLE]
To estimate the upper bound of for , we divide the remaining agents into two groups and , and then consider each group respectively. In the following, we denote and as the respective abbreviations for and .
For agent in the first group, that is, , we have that
[TABLE]
By applying Lemma 1 to the points , , , we obtain
[TABLE]
where . Then (22) can be rewritten as
[TABLE]
We next estimate a lower bound of . By Lemma 1,
[TABLE]
therefore,
Next, we discuss the lower bound of for the case when is odd and even, respectively.
If is odd, by Lemma 1 and (17),
[TABLE]
Combine this and the inequality
[TABLE]
which comes from (17). For the group , the lower bound of can be analyzed as follows.
(i) When ,
[TABLE]
(ii) When ,
by the trigonometric identity
[TABLE]
we have
[TABLE]
[TABLE]
Then by monotonicity of with respect to , and , we obtain
[TABLE]
If is even, by identity (25), we obtain
[TABLE]
Therefore, combining (23) yields
[TABLE]
which holds for any agent in the first group.
Next we consider agent in another group, that is . In this case, because , we obtain
[TABLE]
where . Then combining (24) and applying similar computations as the first group yields
[TABLE]
Notice that in the above derivation, the inequality
[TABLE]
is used. Therefore, (A.3) implies
[TABLE]
holds for any agent in the second group.
In conclusion, by (A.3), (27), (28) we obtain
[TABLE]
The proof is completed.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] A. Matveev A. Proskurnikov and C. Ming. Consensus and polarization in Altafini’s model with bidirectional time-varying network topologies. In IEEE Conference on Decision and Control (CDC) , pages 2112–2117, Dec 2014.
- 2[2] C. Altafini. Consensus problems on networks with antagonistic interactions. IEEE Transactions on Automatic Control , 58(4):935–946, 2013.
- 3[3] R. W. Beard, J. Lawton, and F. Y. Hadaegh. A coordination architecture for spacecraft formation control. IEEE Transactions on Control Systems Technology , 9(6):777–790, 2001.
- 4[4] S. P. Bhat and D. S. Bernstein. A topological obstruction to continuous global stabilization of rotational motion and the unwinding phenomenon. Systems & Control Letters , 39(1):63–70, 2000.
- 5[5] F. Bullo, R. M. Murray, and A. Sarti. Control on the sphere and reduced attitude stabilization. In IFAC Symposium on Nonlinear Control Systems , pages 495–501, Tahoe City, CA, 1995.
- 6[6] N. A. Chaturvedi, A. K. Sanyal, and N. H. Mc Clamroch. Rigid-body attitude control. IEEE Control Systems , 31(3):30–51, 2011.
- 7[7] P. J. Davis. Circulant Matrices . Chelsea, New York, 2nd edition, 1994.
- 8[8] J. A. Fax and R. M. Murray. Information flow and cooperative control of vehicle formations. IEEE Transactions on Automatic Control , 49(9):1465–1476, 2004.
