PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

Distance between two Keplerian orbits

Treść / Zawartość
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
In this paper, constrained minimization for the point of closest approach of two conic sections is developed. For this development, we considered the nine cases of possible conics, namely, (elliptic-elliptic), (elliptic-parabolic), (elliptic–hyperbolic), (paraboli-elliptic), (paraboli-parabolic), (parabolic–hyperbolic), (hyperbolic-elliptic), (hyperbolic-parabolic), and (hyperbolic–hyperbolic). The developments are considered from two points of view, namely, analytical and computational. For the analytical developments, the literal expression of the minimum distance equation (S) and the constraint equation (G), including the first and second derivatives for each case, are established. For the computational developments, we construct an efficient algorithm for calculating the minimum distance by using the Lagrange multiplier method under the constraint on time. Finally, we compute the closest distance S between two conics for some orbits. The accuracy of the solutions was checked under the conditions that L|solution ≤ε1G||solution ≤ε2, where ε1,2 < 10 -10. For the cases of (paraboli-parabolic), (paraboli-hyperbolic), and (hyperbolic-hyperbolic), we studied thousands of comets, but the condition of the closest approach was not met.
Rocznik
Strony
57--77
Opis fizyczny
Bibliogr. 13 poz., rys., tab.
Twórcy
  • Egyptian Space Agency, Cairo, Egypt
  • Department of Astronomy, Space Science, and Meteorology, Faculty of Science, Cairo University, Cairo, Egypt
autor
  • Astronomy and Meteorology Department, Faculty of Science, Al-Azhar University, Cairo, Egypt
  • Astronomy and Meteorology Department, Faculty of Science, Al-Azhar University, Cairo, Egypt
  • Egyptian Space Agency, Cairo, Egypt
Bibliografia
  • Alfano S. (1994) Determining satellite close approaches, part 2, JANSC, Vol. 42, No. 2, 143-152. Available from: https://ssd.jpl.nasa.gov/?sb_elem#legend.
  • Baluyev R.V., Kholshevnikov, K.V. (2005). Distance between two arbitrary unperturbed orbits, Celestial Mechanics and Dynamical Astronomy, Vol. 91, No. 3-4, 287-300.
  • Brown. D.C. (2004) Spacecraft mision desing, American Institute of Aeronautics and Astronauies, Inc, Washinglon DC, U.S.A. 20024-2.'iIR.
  • Denenberg E., Gurfil, P. (2016) Improvements to time of closest approach calculation. Journal of Guidance, Control, and Dynamics, Vol. 39, No. 9, 1967-1979.
  • Escobal P.R. (1965) Methods of orbit determination, John Wiley.
  • Hoots F.R., Crawford L.L., Roehrich R.L. (1984) An analytic method to determine future close approaches between satellites, Celestial Mechanics, Vol. 33, No. 2, 143-158.
  • Junkins J.L. (2004) Optimal estimation of dynamic systems, CRC Press LLC, London, New York, Washington, D.C.
  • Kholshevnikov K.V., Vassiliev N.N. (1999) On the distance function between two Keplerian elliptic orbits, Celestial Mechanics and Dynamical Astronomy, Vol. 75, No. 2, 75-83.
  • Liu J., Wang R.L., Zhang H.B., Xiao Z. (2004) Space debris collision prediction research, Chinese Journal of Space Science, Vol. 24, No. 6), 462-469.
  • Moulton F.R. (1960) An introduction celestial mechanics, New York.
  • Sharaf M.A., Sharaf, A.A. (1997) Closest approach in universal variables, Celestial Mechanics and Dynamical Astronomy, Vol. 69, No. 4, 331-346.
  • Vallado D.A. (2013) Fundamentals of astrodynamics and applications, Microcosm Press, Hawthorne, CA, USA.
  • Zheng Q.Y., Wu L.D. (2004) A computation method to warn the collision event between space probe and debris, Acta Astronomica Sinic, Vol. 45, No. 4, 422-427.
Uwagi
Opracowanie rekordu ze środków MEiN, umowa nr SONP/SP/546092/2022 w ramach programu "Społeczna odpowiedzialność nauki" - moduł: Popularyzacja nauki i promocja sportu (2022-2023).
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-ff056d20-f581-46ad-be0b-762d29233c35
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.