An improved numerical method for constructing Halo/Lissajous orbits in a full solar system model

Qian, Ying-Jing; Yang, Xiao-Dong; Jing, Wuxing; Wei, Zhang

doi:10.1016/j.cja.2018.03.006

Cited by 21 publications

(6 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nevertheless, dynamics around these points are proven to be similar to those of the CRTBP (Hou & Liu, 2011;Jorba et al, 2020). Numerical approaches can be taken to construct the DROs and the halo orbits (including the NRHOs) in the ephemeris model (Bezrouk & Parker, 2017;Dei Tos & Topputo, 2017;Hou & Liu, 2011;Lian et al, 2013;Qian et al, 2018;Whitley et al, 2018). Again, details are omitted here.…”

Section: Realistic Modelmentioning

confidence: 99%

Comparison of Autonomous Orbit Determination for Satellite Pairs in Lunar Halo and Distant Retrograde Orbits

Gao

Hou

2022

navi

View full text Add to dashboard Cite

A comprehensive study on the autonomous orbit determination (AOD) performance of satellite pairs in halo orbits and distant retrograde orbits (DROs) is carried out. A factor called dynamic and geometric dilution of precision (DAGDOP) is proposed to simultaneously incorporate influences from the dynamics and geometry of satellite pairs. Based on the DAGDOP, the effect of different observation arcs on the AOD accuracy is investigated. Next, the AOD accuracy of three different types of satellite pairs-halo+halo, DRO+DRO, and halo+DRO-is systematically analyzed. The hybrid halo+DRO type shows the best overall accuracy. Finally, the AOD performance of the hybrid type is verified in a realistic model. Our studies find that the average AOD accuracy of the halo orbit is about 170 meters, and that of the DRO is about 190 meters. The relative time synchronization error of two satellites is less than 30 nanoseconds.

show abstract

Section: Realistic Modelmentioning

confidence: 99%

Comparison of Autonomous Orbit Determination for Satellite Pairs in Lunar Halo and Distant Retrograde Orbits

Gao

Hou

2022

navi

View full text Add to dashboard Cite

show abstract

“…The distance L is calculated with reference to the annotations in Figure 2, from the formula below. B. Waypoint generation Since the turning path tracking of the considered VTOL UAV adopts L1 [31][32][33] algorithm we need, therefore, to calculate a reasonable waypoint to ensure that the UAV can fly in the optimal path when turning. Each waypoint reached by the UAV has an acceptance radius; when considering the optimal path, the acceptance radius is equal to the turning radius.…”

Section: Path Directionmentioning

confidence: 99%

Global Optimization of UAV Area Coverage Path Planning Based on Good Point Set and Genetic Algorithm

et al. 2022

View full text Add to dashboard Cite

When performing area coverage tasks in some special scenarios, fixed-wing aircraft conventionally adopt the scan-type of path planning, where the distance between two adjacent tracks is usually less than the minimum turning radius of the aircraft. This results in increased energy consumption during turning between adjacent tracks, which means a reduced task execution efficiency. To address this problem, the current paper proposes an area coverage path planning method for a fixed-wing unmanned aerial vehicle (UAV) based on an improved genetic algorithm. The algorithm improves the primary population generation of the traditional genetic algorithm, with the help of better crossover operator and mutation operator for the genetic operation. More specifically, the good point set algorithm (GPSA) is first used to generate a primary population that has a more uniform distribution than that of the random algorithm. Then, the heuristic crossover operator and the random interval inverse mutation operator are employed to reduce the risk of local optimization. The proposed algorithm is verified in tasks with different numbers of paths. A comparison with the conventional genetic algorithm (GA) shows that our algorithm can converge to a better solution.

show abstract

“…The halo orbits of the CRTBP have been analytically computed from computer assisted implementations of Hamiltonian perturbation theory as well as from numerical methods (see for example [16,25,4,29] for the analytic methods and [8,15,12,31,30] for the numerical ones). In this paper we consider the analytic computations based on Hamiltonian perturbation theory, which allow not only to compute the halo orbits, but also the orbits in their neighbourhoods, including their stable and unstable manifolds and transit orbits.…”

Section: Introductionmentioning

confidence: 99%

On the analytical construction of halo orbits and halo tubes in the elliptic restricted three-body problem

Paez,

Guzzo

2022

Preprint

View full text Add to dashboard Cite

The halo orbits of the spatial circular restricted three-body problem are largely considered in space-flight dynamics to design low-energy transfers between celestial bodies. A very efficient analytical method for the computation of halo orbits, and the related transfers, has been obtained from the high-order resonant Birkhoff normal forms defined at the Lagrangian points L1-L2. In this paper, by implementing a non-linear Floquet-Birkhoff resonant normal form, we provide the definition of orbits, as well as their manifold tubes, which exist in a large order approximation of the elliptic three-body problem and generalize the halo orbits of the circular problem. Since the libration amplitude of such halo orbits is large (comparable to the distance of L1-L2 to the secondary body), and the Birkhoff normal forms are obtained through series expansions at the Lagrangian points, we provide also an error analysis of the method with respect to the orbits of the genuine elliptic restricted three-body problem.

show abstract

An improved numerical method for constructing Halo/Lissajous orbits in a full solar system model

Cited by 21 publications

References 30 publications

Comparison of Autonomous Orbit Determination for Satellite Pairs in Lunar Halo and Distant Retrograde Orbits

Comparison of Autonomous Orbit Determination for Satellite Pairs in Lunar Halo and Distant Retrograde Orbits

Global Optimization of UAV Area Coverage Path Planning Based on Good Point Set and Genetic Algorithm

On the analytical construction of halo orbits and halo tubes in the elliptic restricted three-body problem

Contact Info

Product

Resources

About