Robust Algorithms for Formation Flying Reconfiguration

Table of contents

1. Robust Algorithms for Formation Flying Reconfiguration

Gianmarco Radice , Tao Yang , Weihua Zhang A Abstract -Over the last 20 years spacecraft formation flying has been the subject of numerous research activities due to the advantages offered when compared with large, complex, single purpose satellites. With the obvious advantages of increased functionality and enhanced reliability, come however, also substantial challenges in the maintenance and reconfiguration of the spacecraft formation. The present paper addresses these problems by proposing two approaches that can be mathematically validated thus making it attractive for safety critical applications such as proximity operations. The first approach hinges on the implementation of pursuit algorithms first studied by French scientist Pierre Bouguer in the 18th century. The proposed approach separates the control law into two distinct stages: planar movement control and orthogonal displacement suppression. The second approach relies on the use of motion camouflage which is a hunting technique widely used in the natural world that allows a predator to approach a prey while appearing to remain stationary. A number of different scenarios are presented and the two approaches implemented within them. Numerical results shows that both methods are robust to dynamical uncertainties and do ensure the correct reconfiguration manoeuvres.

I.

2. INTRODUCTION

n recent years, the idea of distributing the functionality of large satellites among smaller has become increasingly popular as a traditional, large single spacecraft may not be sufficient to meet mission requirements [1]. Several scenarios entailing cooperative satellites have been considered for numerous space missions. To this end spacecraft formation flying has become a promising means of reducing operational costs and increase mission flexibility and functionality [2][3][4][5][6]. Due to the often precise navigation and positioning requirements of these missions, the spacecraft station keeping and orbit and increase mission flexibility and functionality [2][3][4][5][6]. Due to the often precise navigation and positioning requirements of these missions, the spacecraft station keeping and orbit control become crucial for mission success. Different approaches exist and have been proposed in literature to tackle these challenging problems [7][8][9][10][11][12]. The main drawback of these approaches is that they generally require costly computational resources making them thus unsuitable for on-board scheduling. The development of autonomy technologies is the key to three vastly important strategic technical challenges facing future spacecraft missions. The reduction of mission operation costs, the continuing return of quality science products through increasingly limited communications bandwidth and the launching of a new era of solar system exploration, characterised by sustained presence and in depth scientific studies. Spacecraft autonomy will bring significant advantages by improving resource management, increasing fault tolerance and simplifying payload operations. Also, when considering the communication delays in deep space missions, the requirement for autonomy becomes clear. Ground stations and controllers will not be able to communicate and control distant spacecraft in real-time to guarantee pointing precision and safety. As the number of satellites within the formation and the distance of the operational orbit from the Earth increase, conventional methods show their limits and become less practical. New control methods are therefore required; approaches that enhance the automation of the system, enabling the formation to perform deployment, maintenance and reconfiguration manoeuvres autonomously.

3. a) Pursuit Algorithms

An interesting line of research, inspired by pursuit algorithms, was first studied by French scientist Pierre Bouguer in the 18th century. Simply put, if a point A in space moves along a known curve, then another point P describes a pursuit curve if its motion is always directed towards A and the two points move with equal speeds. More than a century later, scholars found that if three agents, initially placed at the vertices of an equilateral triangle, were to run one after the other, then their pursuit curves would be a logarithmic spiral and they would eventually meet at a common point, known now as the Brocard point of a triangle as shown in

4. b) Motion Camouflage

Motion camouflage is a stealth technique that allows a predator to approach a moving target (e.g. the prey) whilst appearing to remain stationary. To achieve this, the predator follows a path such that it always lies on the line connecting the predator and a fixed point (knowas the camouflage background) as shown in Figure 2. Biologists have used stereo cameras to reconstruct the movements in three dimensions of dragonflies, and verify that these insects successfully use motion camouflage to disguise themselves as stationary during aerial maneuvers. A more elaborate behavior is performed by the male dragonflies that periodically appear to switch fixed point locations, sometimes to nearby points, sometimes to points at infinity [14]. The only visual cue to the predator's approach is its graduallooming. In a psychophysical experiment based on a 3D computergame, humans became prey, defending themselves against attacks from motion camouflaged missiles. Alternative missile approach Strategies included a homing approach and direct interception approach. The experimental results demonstrated that motioncamouflaged missiles were in general able to get closer to the object before being shot than the alternative strategies.

5. II.

6. CONTROL ALGORITHMS

We assume that the formation is orbiting the Earth at an altitude which is much larger than the relative distance between the satellites. We can therefore define the equations of motion of a chaser satellite about a target satellite through the Clohessy-Wiltshire equations:

(1) Motion in the z direction and along the orbital plane is decoupled; hence if necessary the control law can be designed in two stages: planar and orthogonal control.

7. a) Pursuit Algorithms Control

If the satellite lies on the reference centre, then under cyclic pursuit it will remain stationary. Generally the initial position of the agentis however not superposed to the reference centre, thus it is necessary to combine this with beacon's guidance to achieve reorientation. Suppose the reference centre to be a virtual beacon, together with angular rotation control of , another control denoted as would be required to maintain the relative distance maintenance with respect to the beacon. This linear control is expressed as:

i i i i u ( ( )) ( ( )) ( ) 0 ( ) 0 () 0 b b b k g t t if t u t if t ( 1) ( ) ln b e b b e c g c 0 3 /2 ( ) 2 3 /2 2 b if if 0 /2 ( ) 2 /2 2 b if if (2d)

Where, is the distance between the vehicle and the beacon represents the angular distance between the heading of the vehicle and the position vector of the beacon Note that Eq. 2c valid in the case of counterclock wise equilibrium and Eq. 2d valid in the case of clockwise equilibrium. A combined control law for multi-agent motion would then be:

(3) [0, 2 ) 0 for 0 for i i i b i b b i i i i i i k g k k t u

In the orthogonal direction, a linear feedback control is designed.

To suppress possible oscillations, the velocity value is taken into account. Here the parameters are adjusted to be: (4) This provides the control in the out of plane direction.

0.0002, 0.0002

z v k k . z k z k u v z z b) Motion Camouflage Control

The ideal motion camouflage equations are built on the assumption that the position of the target is given in advance. Let us assume that the position of the target is and that of the predator is , both of which lie either in a plane or three-dimensional Euclidean space.

8. () zt () rt

If the predator uses motion camouflage, then lies on the line connecting the target and some fixed reference point . This means that:

(5)

Where is the position ratio of To perform the formation control we assume impulsive manoeuvres such that the velocity vector changes instantaneously. The chaser transfers from state of Superscripts of "and " + " refer to the state of before and after an impulse respectively. Defining The transition matrix becomes: ( 6) with (7) and impulse vectors of (8) Integrating all the velocity changes provides the fuel mass required for the manoeuvre through the rocket equation.

9. III. NUMERICAL RESULTS -PURSUIT ALGORITHMS

To simplify the stability analysis, a formation of only two satellites is investigated at first. We consider two reconfiguration manoeuvres: separation increase and phase angle adjustment. In this task for the reason of initial symmetric states, cyclic pursuit is sufficient to achieve radius enlargement. Applying cyclic pursuit control to this scenario requires the linear velocity to be constant. Whereas to keep the periodicity invariant to the reference centre under orbital dynamics, the velocity value relative to the reference centre should change as well. Then the cyclic pursuit in the orbit direction and the feedback control in the orthogonal direction are applied. ( , ) ( )

4 3 0 0 / 2(1 ) / 0 6( ) 1 0 2(1 ) / (4 3 ) / 0 0 0 0 0 / 3 0 0 2 0 6 ( 1) 0 0 2 4 3 0 0 0 0 0 t t t c sn c n s c n s n c s n ns c s n c s c ns c 1 1 2 1 2 1 1 ( ) ) 2 2 2 2 1 ) 1 1 1 1 1 (1 1 ( 1 ( ( ) 2 1

) The eigenvalues of this system are through coordinate constraints, leaves the remaining with negative real parts. Hence the planar movement is stable. Figure 4 shows the radius of this formation increases while maintaining a constant phase angle. The radius increase following the velocity increase is rapid, but it still takes a relatively long time to finally reach the desired orbital configuration. In the first phase, a higher thrust is required to increase the relative distance. In the second phase, the thrust should be reduced to avoid overshooting the desired relative distance. If the thrust is maintained to the initial level throughout the manoeuvre then, the convergence rate is very slow.

1 1 1 1 1 1 2 2 2 v v 1 1 1 1 2 2 2 2 i 2 / ,

In the second scenario want to modify the relative phase angle between the satellites. Applying control law to planar movement with parameters Initial spacecraft mass are the same as before while the propulsion system employs SMART-1 Hall Effect Thrusters with Figure 5 shows that the two satellites gradually evolve to the new required angular phase distance. If an impulsive propulsion system is used, the relative distance between the satellites would oscillate slightly before reaching the required phase angle separation as shown in Figure 6. It can be seen that the manoeuvre takes more than twice the time than using a low thrust propulsion system, as shown in Figure 7. IV.

10. NUMERICAL RESULTS -MOTION CAMOUFLAGE

To simplify the preliminary analysis, let us assume the target is circling around a spacecraft with parameters of:

The target's motion can be as We assume the chaser initiates its trajectory takes from the centre of the reference frame. When the parameters, and are defined the trajectory shown in Figure 8 with velocity consumption of is followed. time. This phenomenon would probably result in the failure of a possible stealthy approach. To address this failing more frequent impulses need to be applied as shown in Figure 9. This however comes at the expense of a more costly manoeuvre with a

11. CONCLUSIONS

This paper presented two different methodologies for group coordination and cooperative control of n satellites to achieve formation reconfiguration and phase angle adjustment. The first approach is based on pursuit algorithms while the second takes inspiration from motion camouflage. To validate the methodologies different scenarios are presented: a formation reconfiguration, an angular phase shift and a rendezvous manoeuvre. In summary, it has been shown that the control schemes proposed in this paper may have some potential for implementation in space missions, particularly since these approaches can be validated analytically. Future work would be the application of these control schemes in various scenarios while optimizing fuel consumption.

Figure 1. Figure1FFigure 1 :
1Figure 1: Pursuit curve pattern for an equilateral triangle.
Figure 2. Figure 2 :
2Figure 2 : A predator motion camouflage trajectory
Figure 3.
Setting as control input, Where is the expected angular rotation rate, Assuming the satellites has same mass and electric thrusters with Robust Algorithms for Formation Flying Reconfiguration Global Journal of Researches in Engineering Volume XII Issue v v v v I Version I
Figure 4.
Is used in the first phase of about 20 minutes after which it is decreased to 3.67e-5kN. These correspond to the values of the centripetal forces in initial and target positions respectively. The results are shown in
Figure 5. Figure 3 :
3Figure 3 : Propagation of radius enlargement.
Figure 6. Figure 4 :
4Figure 4 : Spacecraft relative distance
Figure 7. Figure 5 :
5Figure 5 : Propagation of the phase angle adjustment.
Figure 8. Figure 6 :
6Figure 6 : Spacecraft relative distance.
Figure 9. Figure 7 :
7Figure 7 : Spacecraft relative distance.
Figure 10. Figure 8 :
8Figure 8 : Motion camouflage trajectoryIn between impulsive intervals, the chaser will not be precisely located on the constraint lines all the
Figure 11. Figure 9 :
9Figure 9 : Motion camouflage trajectory
1

Appendix A

Appendix A.1

Appendix B

  1. State Feedback Control, 2009. 65 p. .
  2. A Bernhart . Polygons of Pursuit. Scripta Mathematica, 1959.
  3. Motion Camouflage in Dragonflies. A Mizutani , J S Chahl , M V Srinivasan . Nature 2003. 604 (423) .
  4. Differential Drag as a Means of Spacecraft Formation Control. B S Kumar , A Hg , K Yoshihara , A De Ruiter . IEEE Transactions on Aerospace and Electronic Systems 2011. 47 (2) p. .
  5. Satellite Formation Flying Design and Evolution. C Sabol , R Burns , C A Mclaughlin . Journal of Spacecraft and Rockets 2001. 38 (2) p. .
  6. Formation Flying to Enhance the QB50 Space Network. E Gill , P Sundaramoorthy , J Bouwmeester , B Sanders . Small Satellites and Services Symposium, (Funchal, Portugal
    ) 2010.
  7. Nonlinear Relative Position control of Precise Formation Flying Using Polynomial Eigenstructure Assignment. F Wang , Z Chen , A Tsourdos , B A White , Y Wu . Acta Astronautica 2011. 68 (11) p. .
  8. G Krieger , A Moreira , H Fiedler , I Hajnsek , M Werner , M Younis , M Zink . TanDEM-X: a Satellite Formation for High Resolution SAR Interferometry, 2007. 45 p. .
  9. Trajecotrykeeping in Satellite Fomation Flying via Robust Periodic Learning Control. H S Ahn , K L Moore , Y Q Chen . International Journal of Robust and Nonlinear Control 2010. 20 (14) p. .
  10. Decentralized Coordinated Attitude Control for Satellite Formation Flying via the State Dependent Riccati equation Technique. I Chang , S Y Park , K H Choi . International Journal of Non-Linear Mechanics 2009. 44 (8) p. .
  11. New Perspectives in Solar Coronography Offered by Formation Flying: From Proba-3 to Cosmic Vision. P Lamy , S Vives , L Dame , S Koutchmy . Space Telescopes and Instrumentation, (Marseilles, France
    ) 2008.
  12. R Kristiansen , P J Nicklasson . Spacecraft Formation Flying: a Review and New results on,
  13. Status and Trends of Small Satellite Missions for Earth Observation. R Sandau . Acta Astronautica 2010. 66 (2) p. .
  14. Formation Control at the Sun-Earth L2 Libration point Using Solar Radiation Pressure. S Kamran , K D Kumar . Journal of Spacecraft and Rockets 2010. 47 (4) p. .
  15. PRISMA -A Formation Flying Project in Implementation Phase. S Persson , S Veldman , P Bodin . Acta Astronautica 2009. 65 (9) p. .
Notes
1
© 2012 Global Journals Inc. (US)
Date: 2012-01-15