Spacecraft Attitude Control with Nonconvex Constraints: An Explicit Reference Governor Approach
Marco Nicotra, Dominic Liao-McPherson, Laurent Burlion, Ilya Kolmanovsky

TL;DR
This paper presents a new spacecraft attitude control method that ensures constraint satisfaction and stability using a two-layer approach with explicit reference governor techniques, addressing actuator saturation and exclusion zones.
Contribution
It introduces an explicit reference governor approach for spacecraft attitude control that guarantees constraint satisfaction with nonconvex constraints and asymptotic stability.
Findings
Effective constraint enforcement demonstrated through numerical examples
Guarantees of stability and constraint satisfaction achieved
Applicable to systems with actuator saturation and exclusion zones
Abstract
This paper introduces a novel attitude controller for spacecraft subject to actuator saturation and multiple exclusion cone constraints. The proposed solution relies on a two-layer approach where the first layer prestabilizes the system dynamics whereas the second layer enforces constraint satisfaction by suitably manipulating the reference of the prestabilized system. In particular, constraint satisfaction is guaranteed by taking advantage of set invariance properties, whereas asymptotic convergence is achieved by implementing a non-conservative navigation field which is devoid of undesired stagnation points. Multiple numerical examples illustrate the good behavior of the proposed scheme.
Click any figure to enlarge with its caption.
Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8Peer 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.
Spacecraft Attitude Control with Nonconvex Constraints:
An Explicit Reference Governor Approach ††thanks: The authors are with the University of Michigan, Ann Arbor. Email: {mnicotra,dliaomcp,lburlion,ilya}@umich.edu. This research is supported by the National Science Foundation Award Number CMMI 1562209.
Marco M. Nicotra, Dominic Liao-McPherson, Laurent Burlion, Ilya V. Kolmanovsky
Abstract
This paper introduces a novel attitude controller for spacecraft subject to actuator saturation and multiple exclusion cone constraints. The proposed solution relies on a two-layer approach where the first layer prestabilizes the system dynamics whereas the second layer enforces constraint satisfaction by suitably manipulating the reference of the prestabilized system. In particular, constraint satisfaction is guaranteed by taking advantage of set invariance properties, whereas asymptotic convergence is achieved by implementing a non-conservative navigation field which is devoid of undesired stagnation points. Multiple numerical examples illustrate the good behavior of the proposed scheme.
I Introduction
Spacecraft must often perform large angle reorientation maneuvers to accomplish their missions (e.g. to point a camera, antenna, or telescope at a different celestial or terrestrial objects). In many cases, these maneuvers are complicated by the fact that spacecraft often carry sensitive instruments which cannot be (or must be) pointed in certain directions [1, 2]. A notable example is the Cassini spacecraft where a constraint monitoring module was used to ensure that certain sensors were never pointed towards the sun[3].
Most existing solutions for constrained reorientation with exclusion zones can be broadly divided into path planning methods, trajectory optimization methods, potential field methods, and anti-windup methods. Broadly speaking, path planning methods function by discretizing the attitude space and generating a feasible path by applying a graph search type method [4, 5, 6] or suitable random search algorithms [7, 8]. Random and graph search algorithms can be computationally expensive, and may neglect dynamics, but often have probabilistic completeness or asymptotic optimality guarantees.
Trajectory optimization methods, which include model predictive control [9] approaches, pose the constrained reorientation problem as a constrained optimal control problems. The resulting optimization problems are non-convex and can be solved by direct methods [10], indirect methods [11], global optimization techniques [12, 13, 14], or by applying convexification techniques [15, 16]. These approaches are able to achieve high performance while accounting for the system dynamics, but have the disadvantage of being computationally intensive.
Potential field methods generate a suitable control law by constructing an artificial potential field that has a minimum at the target reference and high values around the exclusion zones. This field is then used as either a Lyapunov function to which techniques from nonlinear control are applied[17, 18, 19, 20, 21, 22] or as a cost function to which techniques from optimal control[23] are applied. Potential field methods are typically computationally inexpensive, and thus suitable for onboard implementation. Under suitable assumptions they may also automatically provide stability and robustness guarantees. However, special care must be taken to prevent the spacecraft from becoming stuck in local minima or critical points of the potential function [24, 25, 26]. A variety of potential field methods have been proposed in the literature, e.g. [17, 18, 19] which use Gaussian functions, log barriers, and exponential functions, respectively, to encode forbidden and mandatory regions. However, while these papers consider the effect of stationary points induced by the artificial potential functions they do not account for actuator saturation.
Finally, anti-windup schemes can be used to augment a nominal control to deal with control saturation [27] and/or output constraints [28]. Although these methods are attractive to practitioners since they do not modify the nominal control law, addressing multiple exclusion cone constraints with this approach can be very challenging.
In this paper we propose a new method based on the Explicit Reference Governor (ERG) framework [29, 30]. An ERG is an add-on unit which manipulates the commands given to a pre-stabilized system to prevent constraint violation. The ERG consists of a navigation component, which generates a kinematically feasible path towards the target, and a dynamic safety margin mechanism, which prevents constraint violations in transients when following this path with the closed-loop dynamical system.
Compared to existing methods, the ERG developed in this paper (i) enforces control saturation and multiple exclusion cone111Although this paper focuses on the case of exclusion zone constraints, we note that it is straightforward to extend the proposed methodology to the case of inclusion cone constraints. constraints, (ii) rigorously handles stationary points of the artificial potential function using a saddle destabilization term, and (iii) is computationally inexpensive due to its closed-form formulation. The theoretical contributions of this paper are twofold. We apply the theory of ERGs to quaternion spaces by constructing an appropriate navigation field and dynamic safety margin then proving their admissibility. In addition, we introduce a novel procedure, based on Nagumo’s theorem, to construct less conservative dynamic safety margins for handling actuator saturation constraints.
II Preliminaries
This paper will employ elements belonging to the Cartesian space n, the unit vector set , and the unitary quaternion set . Given , we denote and as the real and imaginary components of , respectively. Moreover, we denote by the complex-conjugate of . With a slight abuse of notation, quaternions will sometimes be treated as elements of for the sake of using matrix multiplication, thus leading to for the scalar part of the quaternion and for its vector part. The complex conjugate of a quaternion satisfies and . Given two quaternions , the quaternion product can be computed in matrix form using
[TABLE]
where the operator is defined as
[TABLE]
Given a quaternion , the rotation matrix that transforms vector representations from the body-fixed reference frame to the inertial reference frame is given by
[TABLE]
For further details on quaternion algebra and their use in representing SO(3), the reader is referred to, e.g. [31].
III Modeling and Problem Statement
Consider a rigid body, e.g. a spacecraft, and let represent the orientation of the body reference frame with respect to an inertial reference frame. Let the angular velocities and the control torques be expressed in the body reference frame. Following from the Newton-Euler equations, the rotational dynamics of the rigid body is given by the state-space model
[TABLE]
where is the inertia matrix and
[TABLE]
is the quaternion kinematic differentiation matrix. The system (4) is subject to the following non-convex set of input and state constraints.
Actuator Saturation: The actuator saturation constraint accounts for the fact that the control input is subject to physical limitations specific to thruster-based or momentum exchange attitude control systems. These constraints can be expressed using the following element-wise inequalities,
[TABLE]
where is a vector of positive values.
Exclusion Cones: The exclusion cone constraints are introduced to prevent certain on-board instruments, e.g. high sensitivity optical sensors, from pointing to an undesired direction, e.g. the sun. To this end, let , , be a collection of unitary vectors defined in the body reference frame and let be an undesired heading defined in the inertial reference frame. Given the current spacecraft orientation , the angular distance between the undesired heading and the sensor orientation can be lower bounded by the constraint
[TABLE]
where is the minimum admissible angle, e.g. the half conic aperture of the -th sensor. To prevent overlap between any two exclusion cone constraints, the following assumption is made:
Assumption 1**.**
There exists an influence margin such that the orientations of all the onboard sensors satisfy
[TABLE]
with .
Given the influence margin , the set of unaffected orientations will be denoted by
[TABLE]
Analogously, given a static safety margin , the set of steady-state admissible orientations will be denoted by
[TABLE]
Note that, by construction, the sets (4i)-(4j) satisfy .
III-A Problem Statement
The objective of this paper is to develop a control strategy that solves the following constrained control problem:
Problem 1**.**
Let system (4) be subject to constraints (4f)-(4g). Then, given suitable initial angular velocities and a constant reference strictly satisfying (4g) with , design a control law such that:
Constraints (4f)-(4g) are always satisfied; 2. 2.
The equilibrium point is asymptotically stable and is attractive for any strictly satisfying (4g).
To meet this objective, we propose a two-step solution based on the explicit reference governor framework. The first step is pre-stabilizing the system dynamics so that its orientation asymptotically tends to an auxiliary reference . This is done using the control layer detailed in Section IV, which does not account for the system constraints. The second step consists in manipulating the dynamics of the auxiliary reference so that it asymptotically tends to , while simultaneously ensuring constraint satisfaction. This is accomplished using the navigation layer detailed in Section V.
IV Control Layer
The objective of the control layer is to pre-stabilize the system dynamics. Consequently, this section assumes, for the purpose of controller design, that the auxiliary reference is constant. The time-varying nature of will be addressed by the ERG framework detailed in Section V. The following proposition summarizes some well-known results on quaternion-based unconstrained control. For further details, the reader is referred to, e.g., [32].
Proposition 1**.**
Given system (4), let be a constant reference and let be the attitude error. Then, given the control law
[TABLE]
with , the equilibrium point of the closed-loop system is asymptotically stable and admits the set
[TABLE]
as an inner approximation of its attraction basin.
Proof.
The proof follows [33] by employing the closed-loop Lyapunov function
[TABLE]
which converges to zero along the closed-loop trajectories for any initial condition satisfying , thereby implying the result. ∎
Given the control law (4k), the actuator saturation constraints (4f) can be rewritten as the following state-space constraints,
[TABLE]
Remark 1**.**
Limiting the initial conditions to is sufficient to avoid unwinding effects [32]. Although this assumption may seem restrictive from the classic viewpoint of “global” stabilization, it is worth noting that the presence of constraints changes the nature of the problem to the extent that a global region of attraction is no longer attainable.
V Navigation Layer
The objective of the navigation layer is to augment the control layer by providing constraint handling capabilities to the closed-loop system. This will be done using the explicit reference governor, which manipulates the auxiliary reference so that the transient dynamics cannot cause constraint violation. Based on the intuition presented in [30], this paper will generate the auxiliary reference using the dynamic system
[TABLE]
where is referred to as a Dynamic Safety Margin and is referred to as a Navigation Field. A rigorous definition of these terms, as well as a formal proof of how the ERG ensures constraint satisfaction, can be found in [30]. Note that, although [30] is formulated in Cartesian space, the results stated therein can be implemented on quaternions with straightforward modifications. The chief difficulties lie in defining appropriate an dynamic safety margin and navigation field in .
The dynamic safety margin can be interpreted as the distance between the boundary of the constraints (4g), (4p) and the trajectory that the closed-loop system (4), (4k) would follow if the current reference were to remain constant. This value is thus used to quantify how safe it is to modify the current reference without causing a constraint violation at any time in the future. The navigation field can instead be interpreted as the direction in which the auxiliary reference should evolve to reach the desired reference while simultaneously remaining steady-state admissible. The following subsections will illustrate how to generate suitable and .
V-A Dynamic Safety Margin
The objective of this subsection is to obtain a Lipschitz continuous scalar function that satisfies the following properties:
Recursive Feasibility: Whenever , where and are the attitude error and the angular velocity at the current time, it is possible to guarantee constraint satisfaction at any time in the future by not changing the current value of the auxiliary reference; 2. 2.
Forward Invariance: Whenever , the closed-loop system satisfies as long as the auxiliary reference remains constant; 3. 3.
Strong Returnability: For any constant and strictly steady-state admissible reference, asymptotically tends to a value that is strictly positive.
The first step in constructing the dynamic safety margin is to separate the contributions of the various constraints by defining
[TABLE]
where is the dynamic safety margin associated to the exclusion cone constraints (4g), whereas is the dynamic safety margin associated to the actuator saturation constraint (4p).
Exclusion Cones: For what concerns the exclusion cone constraints, it is sufficient to note that, given , constraints (4g) hold true for any attitude such that , where
[TABLE]
is the minimum angular distance between and the boundary of the exclusion cone constraints. Following the general approach in [34], constraint satisfaction can thus be guaranteed by assigning the dynamic safety margin
[TABLE]
where
[TABLE]
can be interpreted as the potential energy associated to . The intuition behind this choice is that, as long as (4t) remains non-negative, the closed-loop system will never have sufficient energy to violate the exclusion cone constraints.
Remark 2**.**
An important consequence of equation (4s) is that is guaranteed to satisfy the upper bound . Since this entails , the proposed constrained control strategy has the added effect of ensuring at all times, thus preventing unwinding phenomena.
Actuator Saturation: Following the general approach outlined in [30], the actuator saturation constraint (4p) can be enforced by limiting the value of the Lyapunov function (4m) so that the corresponding level-set does not exit the plane . This can be done by solving the optimization problem
[TABLE]
and taking the minimum for . Depending on the inertia matrix and the control gains , , however, this approach may lead to an excessively conservative response. In this paper we introduce a novel method for constructing a larger level-set to improve performance. We propose the dynamic safety margin
[TABLE]
where and are given in equations (4k) and (4m), respectively, whereas is a positive scalar that can be computed by solving
[TABLE]
where denotes the ith row of a matrix, for , and taking the smallest of the three solutions. As detailed222Due to the complexity of representing and in a 2D plot, Figure 1 was obtained using analogous considerations for the second-order system with . Note that, although the numerical values are not indicative for SO(3), the overall behavior is very similar. in Figure 1, the idea behind equation (4x) is to define as the largest value of the Lyapunov function such that
[TABLE]
for . This property, combined with the time-decreasing nature of the Lyapunov function along the system trajectories, is sufficient to ensure that the set
[TABLE]
is forward invariant for any constant reference . As a result, it follows from [30] that (4w) is a dynamic safety margin since it measures the distance between the current state and the boundary of the invariant set (4z).
V-B Navigation Field
The objective of this section is to construct a vector field that, for any initial auxiliary reference , generates a steady-state admissible path that leads to the desired reference . To do so, the first step will be to account for the kinematic behavior of quaternions by defining
[TABLE]
where is defined in (4e), is an attraction term that points from to , is a repulsion term that points away from the constraints, and is a destabilization term that prevents stagnation. Each of these terms will be addressed using a step-by-step analysis based on the artificial potential field approach [36].
Attraction Term: To design the attraction term, consider the case in which the system is not subject to constraints. In this scenario, a simple choice would be , where is the reference error. For the sake of modularity, however, in this paper we propose a different choice,
[TABLE]
where is a (preferably small) smoothing angle. The advantage of (4ab) is that for all , where is the angular error between and . In the presence of exclusion cone constraints, the proposed attraction term can be combined with a repulsion term to ensure constraint satisfaction. Note that, under our assumptions, the input saturation constraints are always satisfied at steady-state, meaning that they do not require any additional terms.
Repulsion Term: The objective of the repulsion term is to ensure that does not exit the set of steady-state admissible values . By taking advantage of the fact that the attraction field satisfies , the proposed repulsion term has the form
[TABLE]
where is the minimum angular distance between and the edge of the closest exclusion cone, as detailed in (4s), and is the associated index. Indeed, (4ac) satisfies for , thus making it easier to study in relationship to . Equation (4ac) is also designed so that for . Due to Assumption 1, this ensures that the effect of a given exclusion cone is always limited to its direct influence region. For the reader’s convenience, the role of is detailed in Figure 2. The following proposition details the asymptotic behavior of the navigation field, , for the special case in which there is only one exclusion cone constraint.
Proposition 2**.**
Given a single exclusion cone constraint (4g), i.e. , let be an influence margin, let be a static safety margin, and let . Then, the system
[TABLE]
with and given in (4ab) and (4ac) is such that, for any constant reference , the following properties hold:
The set is forward-invariant; 2. 2.
The equilibrium point satisfying
[TABLE]
is asymptotically stable with respect to the manifold
[TABLE] 3. 3.
The equilibrium point is asymptotically stable and admits as a basin of attraction.
Proof.
See Appendix VIII-A. ∎
The main limitation of Proposition 2 is that, even if the reference is strictly steady-state admissible and there is only one exclusion cone constraint, the trajectories of resulting from the proposed attraction field are not guaranteed to converge to for any admissible initial condition . This is due to the presence of the saddle point which is characterized by an attraction basin of dimension zero. In the presence of multiple exclusion cones, this issue becomes even more problematic due to the well-known limitation of conservative vector fields, which always contain at least as many stagnation points as the number of holes in the domain [24]. This issue will be addressed in the following paragraph.
Saddle Destabilization Term: The objective of the destabilization term is to eliminate the presence of saddle points without penalizing the convergence properties. To do so, the proposed vector field, , must satisfy the following properties:
- •
must be non-conservative, otherwise it will be unable to overcome the intrinsic limitations of conservative vector fields;
- •
whenever . This will ensure that the effects of the destabilization field are local;
- •
, to avoid pointing away from the reference ;
- •
, to avoid pointing towards the constraints (4g).
Based on these criteria, the following is proposed:
[TABLE]
where the vector must satisfy
[TABLE]
Note that is uniquely defined everywhere except the manifold (4ah), where is parallel to . In this case, the element of the null space can be chosen randomly and leads to a discontinuous, and thus non-conservative, vector field . The following proposition states that (4ai) is successful at destabilizing the saddle points, thus making the desired reference globally asymptotically stable with respect to the domain .
Proposition 3**.**
Given a single exclusion cone constraint (4g), i.e. , let be an influence margin, let be a static safety margin, and let . Then, the system
[TABLE]
with , , and given in (4ab), (4ac), and (4ai) is such that:
The set is forward-invariant; 2. 2.
For any constant reference , the equilibrium point is globally asymptotically stable with respect to the domain .
Proof.
See Appendix VIII-B. ∎
Proposition 3 states that, in the presence of a single exclusion cone constraint, the proposed vector field results in a trajectory that asymptotically tends to for any initial condition . The following corollary extends this result to the case of multiple exclusion cone constraints.
Corollary 1**.**
Given the exclusion cone constraints (4g), let the influence margin satisfy Assumption 1, let be a static safety margin, and let . Then, the system (4ak) with , , and given in (4ab), (4ac), and (4ai) is such that:
The set is forward-invariant; 2. 2.
For any constant reference , the equilibrium point is GAS with respect to the domain .
Proof.
See Appendix VIII-C. ∎
VI Main Result
The following theorem combines all the previous results to formulate a suitable constrained control strategy.
Theorem 1**.**
Given system (4) subject to the actuator saturation (4f) and the exclusion cone constraint (4g), let (4k) with be the primary control layer, and let (4q) be the navigation layer subject to the dynamic safety margin (4r), with (4t) and (4w), and the navigation field (4ak), with (4ab), (4ac), and (4ai). Then, under Assumption 1 and for any initial condition such that there exists an auxiliary reference satisfying , the following hold:
For any reference , the system constraints are satisfied; 2. 2.
For any constant reference , the system trajectories will asymptotically converge to the equilibrium point , .
Proof.
Following from Proposition 1, the closed-loop system (4), (4k) is asymptotically stable for any and any state that satisfies the constraint defined in (4l). By construction, is sufficient to ensure as well as the satisfaction of constraints (4f)-(4g). Following from (4r), (4t)-(4u), and (4w)-(4x), the set is forward-invariant for any constant and there exists such that implies . As a result, (4r) satisfies the requirements of [30, Definition 1]. Moreover, it follows from Corollary 1 that (4ak), with (4ab), (4ac), and (4ai), satisfies the requirements of [30, Definition 2]. The remainder of the proof is therefore a direct result of [30, Theorem 1]. ∎
VII Numerical Simulations
The proposed control strategy is applied to a rigid spacecraft with the inertia matrix . The control layer is implemented with and , whereas the navigation layer is implemented with , , , and . The following subsections will address different scenarios that focus on different aspects of the constrained control problem.
VII-A Actuator Saturation Constraints
In this subsection we consider a spacecraft subject to the maximum torque and no exclusion cone constraints. Figure 3 illustrates the behavior obtained using the constrained control framework introduced in this paper. The method successfully achieves constraint satisfaction by imposing the maximum admissible torque at the very beginning and then moving at a constant angular rate before decelerating when it reaches close proximity of the desired setpoint . For comparison, it is worth noting that the response time obtained with the classic Lyapunov-based ERG that relies on the solution of (4v) is two orders of magnitude slower at reaching the same setpoint. As discussed in Subsection V-A, this is due to the fact that (4w) relies on a much larger invariant set.
VII-B Single Exclusion Cone Constraint
In this subsection we consider a satellite subject to the maximum torque as well as an exclusion cone constraint. For the sake of constructing an example with known properties, the direction of the sun in the inertial reference frame is and the sensor orientation in the body reference frame is . The half conic aperture of the sensor is . Given , it can be verified that satisfies . Figure 4 illustrates the behavior obtained with and without the destabilization term (4ai). The satisfaction of the exclusion cone constraint can be seen by the fact that, in both cases, the sensor trajectories lie outside the red circle. The black circle represents the boundary of the set , which is shown to always contain the reference trajectories. Finally, the blue circle represents the border of the influence region. As expected from Proposition 3, the destabilization term successfully prevents the ERG from converging to the undesired saddle point. Figure 5 illustrates the temporal behavior of the system state and inputs, which satisfy the imposed constraints.
VII-C Multiple Exclusion Cones
As a final simulation, we consider a spacecraft subject to the maximum torque and two sensors, with and , which must not be pointed in the direction . For ease of representation, the sensors have the same half conic aperture . As illustrated in Figure 6, the proposed method successfully generates a trajectory that orients the satellite to its desired reference while simultaneously ensuring constraint satisfaction.
VIII Conclusions
This paper has presented a novel approach to constrained spacecraft attitude control. The proposed method relies on the use of an explicit reference governor to manipulate the reference of a prestabilized system so that constraint satisfaction is guaranteed at all times. The proposed method successfully addresses actuator saturation and exclusion cone constraints in a simple and systematic manner that does not require online optimization. Numerical examples have been reported which illustrate the validity of the scheme. While guided to an extent by previous ERG theory introduced in Cartesian spaces, we note that both the construction of ERG for the quaternion-based attitude parameterization and the proofs of convergence properties are unique contributions of this paper. We have also introduced a novel procedure based on Nagumo’s theorem to construct a less conservative dynamic safety margin.
VIII-A Proof of Proposition 2
The attraction term (4ab) is a conservative vector field obtained by computing the gradient of the potential function
[TABLE]
Likewise, the repulsion term (4ac) is a conservative vector field obtained by computing the gradient of the potential function
[TABLE]
Given the combined potential function , it follows by construction that the dynamic system (4ad) is such that
[TABLE]
with
[TABLE]
By taking advantage of the monotone time-decreasing nature of , each item in the statement of Proposition 2 can be proven separately.
Point 1. The invariance of is proven by showing that, whenever , the value of cannot increase further. Following from equation (4ac), the condition entails . Since equation (4ab) ensures , it follows from equations (4ac) and (4an) that
[TABLE]
As a result, the monotone time-decreasing property of is sufficient to guarantee .
Point 2. Due to the requirement , it follows from equation (4ab) that . Likewise, it follows from equation (4aea) that . As a result, equation (4aeb) implies . This is sufficient to show that satisfying (4ae) is an equilibrium point.
To study the stability properties of , consider the case . Following from (4ah), any point belonging to the manifold is such that is parallel to . Therefore, system (4ad) will remain in the manifold and will necessarily converge to due to the time-decreasing properties of and the fact that .
Consider now the case , where the quaternion satisfying , represents an infinitesimal rotation of away from the manifold . Following from (4al), (4ae), and the condition ,
[TABLE]
where and
[TABLE]
is a strictly monotone decreasing function which is equivalent to . Likewise, it follows from (4am) that
[TABLE]
where . By combining equations (4ap), (4ar) it follows that
[TABLE]
Due to equation (4ae), implies , thus leading to for an arbitrarily small perturbation . This is sufficient to show that the equilibrium point is unstable in every direction perpendicular to . As a result, for all , system (4ad) cannot converge to .
Point 3. The asymptotic stability of the equilibrium point follows directly from the fact that , , the function is positive definite, and the trajectory of (4ad) is such that is monotonically time-decreasing. The attraction basin can thus be estimated by taking the entirety of and subtracting the attraction basin of the saddle point .
VIII-B Proof of Proposition 3
Given the potential function obtained using (4al), (4am), it follows by construction that the dynamic system (4ak) is such that
[TABLE]
with given in (4an). Due to equations (4ai)-(4aj), it follows that , thus implying that the introduction of the saddle destabilization term does not compromise the monotone time-decreasing properties of detailed in the proof of Proposition 2. Each item in the statement will thus be proven separately.
Point 1. The invariance of is proven using the same arguments as Proposition 2. In particular, it is sufficient to note that cannot cause a violation of constraints due to the fact that whenever .
Point 2. Since is perpendicular to , the destabilization term is unable to generate additional equilibria with respect to the ones identified in the proof of Proposition 2. Moreover, it follows from (4ai) that . This implies that , i.e. the saddle point of the potential function , is no longer equilibrium points for the system (4ak), which now admits as the only equilibrium point.
Since the vector field (4ak) is not Lipschitz, however, it is also necessary to show that the discontinuity found in (4ai)-(4aj) cannot cause limit cycles. To do so, let be a generic point in the influence region
[TABLE]
and let satisfying , be an infinitesimal rotation of away from the domain . Then, the value of the vector field in is . As already proven in Point 2 of Proposition 2, the vector field points away from the set . As for , it follows from (4aj) that , meaning that the destabilization terms does not point towards the set . Since the set is repulsive, it follows from [37] that there are no limit cycles associated to this discontinuity, therefore the point is the only asymptotic solution of the proposed flow field.
VIII-C Proof of Corollary 1
The proof is analogous to the one provided for Proposition 3. Indeed, the potential function is monotone time decreasing and is characterized by saddle points, each of which satisfy equations (4ae) for a different exclusion cone constraint. Given the influence regions (4at) associated to each exclusion cone constraint, it follows from Assumption 1 that , . As a result, the local properties of each saddle point are not influenced by the presence of the other exclusion cone constraints. Global Asymptotic Stability therefore follows from the fact that is the only equilibrium point in the domain , there are no limit cycles due to the discontinuities, and is a time-decreasing function.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. D. Koenig, “A novel attitude guidance algorithm for exclusion zone avoidance,” in Aerospace conference, 2009 IEEE , pp. 1–10, IEEE, 2009.
- 2[2] H. B. Hablani, “Attitude commands avoiding bright objects and maintaining communication with ground station,” Journal of Guidance, Control, and Dynamics , vol. 22, no. 6, pp. 759–767, 1999.
- 3[3] G. Singh, G. Macala, E. Wong, R. Rasmussen, G. Singh, G. Macala, E. Wong, and R. Rasmussen, “A constraint monitor algorithm for the cassini spacecraft,” in Guidance, Navigation, and Control Conference , p. 3526, 1997.
- 4[4] H. C. Kjellberg and E. G. Lightsey, “Discretized quaternion constrained attitude pathfinding,” Journal of Guidance, Control, and Dynamics , vol. 38, no. 11, pp. 713–718, 2015.
- 5[5] S. Tanygin, “Fast autonomous three-axis constrained attitude pathfinding and visualization for boresight alignment,” Journal of Guidance, Control, and Dynamics , vol. 40, no. 2, pp. 358–370, 2016.
- 6[6] A. Weiss, F. Leve, M. Baldwin, J. R. Forbes, and I. Kolmanovsky, “Spacecraft constrained attitude control using positively invariant constraint admissible sets on so (3) × \times R 3,” in American Control Conference (ACC), 2014 , pp. 4955–4960, IEEE, 2014.
- 7[7] P. Cui, W. Zhong, and H. Cui, “Onboard spacecraft slew-planning by heuristic state-space search and optimization,” in Mechatronics and Automation, 2007. ICMA 2007. International Conference on , pp. 2115–2119, IEEE, 2007.
- 8[8] E. Frazzoli, M. Dahleh, E. Feron, and R. Kornfeld, “A randomized attitude slew planning algorithm for autonomous spacecraft,” in AIAA Guidance, Navigation, and Control Conference and Exhibit, Montreal, Canada , 2001.
