Abstract
An attitude-constrained jerk-minimizing optimal explicit terminal guidance is presented in this paper for the terminal phase of a multi-phase lunar soft-landing. An analytic expression for the acceleration vector serves as the guidance command that can be computed by low-speed onboard processors in real-time. High terminal accuracy in each phase is achieved by enforcing ‘hard terminal constraints’ on the position, velocity, and acceleration (hence attitude) of the spacecraft. The initial conditions on position, velocity and acceleration are also enforced as hard constraints to ensure a smooth handover between consecutive phases. The required time-to-go is computed to minimize the deviation of the acceleration from the average of initial and final values. This results in a very smooth variation of the acceleration vector (hence attitude as well, owing to the strap-down nature of the thruster), starting from the applicable initial value to the desired final value in the segment. Along the trajectory, compatibility of the recomputed time-to-go in the absence of additional perturbation is maintained by auto-adjusting a tuning parameter. Moreover, if necessary, the time-to-go is adjusted once again to prevent altitude excursion beyond a pre-selected safety margin. This process of careful online auto-adjustment of the time-to-go, followed by using it to recompute the guidance command, makes the guidance operate in closed-loop with significant robustness. Consequently, it enables a larger capture region and introduces the capability to recover from partial failures, which are critical requirements for such challenging missions.
Similar content being viewed by others
Data availability
All data necessary for regenerating the results of this paper have been included in the paper to the best of the knowledge of the authors.
References
Benaroya, H., Bernold, L.: Engineering of lunar bases. Acta Astronaut. 62(4–5), 277–299 (2008)
Grebow, D.J., Ozimek, M.T., Howell, K.C.: Design of optimal low-thrust lunar pole-sitter missions. J. Astronaut. Sci. 58(1), 55–79 (2011)
Taylor, L., Kulcinski, G.: Helium-3 on the moon for fusion energy: the Persian Gulf of the 21st century. Sol. Syst. Res. 33, 338–345 (1999)
Hickman, J.M., Curtis, H.B., Landis, G.A.: Design consideration for lunar based photovoltaic power systems. In: Conference Record of the Twenty First IEEE Photovoltaic Specialists Conference, pp. 1256–1262 (1990)
Lazio, T.J.W., MacDowall, R., Burns, J.O., Jones, D., Weiler, K., Demaio, L., Cohen, A., Dalal, N.P., Polisensky, E., Stewart, K., et al.: The radio observatory on the lunar surface for solar studies. Adv. Space Res. 48(12), 1942–1957 (2011)
Wang, Q., Liu, J.: A chang’e-4 mission concept and vision of future Chinese lunar exploration activities. Acta Astronaut. 127, 678–683 (2016)
Curtis, H.D.: Orbital Mechanics for Engineering Students. Butterworth-Heinemann, Oxford (2013)
Mathavaraj, S., Pandiyan, R., Padhi, R.: Constrained optimal multi-phase lunar landing trajectory with minimum fuel consumption. Adv. Space Res. 60(11), 2477–2490 (2017)
Shijie, X., Jianfeng, Z.: A new strategy for lunar soft landing. J. Astronaut. Sci. 55(3), 373–387 (2007)
Bei, C., Zhang, W.: A guidance and control solution for small lunar probe precise-landing mission. Acta Astronaut. 62(1), 44–47 (2008)
Ueno, S., Yamaguchi, Y.: 3-dimensional near-minimum fuel guidance law of a lunar landing module. In: Proceedings of Guidance, Navigation, and Control Conference and Exhibit, Portland (1999)
Cho, D.-H., Kim, D., Leeghim, H.: Optimal lunar landing trajectory design for hybrid engine. Math. Probl. Eng. 1–8 (2015)
Sostaric, R., Rea, J.: Powered descent guidance methods for the moon and mars. In: Proceedings of AIAA Guidance, Navigation, and Control Conference and Exhibit, San Francisco (2005)
Kosambe, S.: Chandrayaan-2: India’s second lunar exploration mission. J. Aircr. Spacecr. Technol. 3(1), 221–236 (2019)
Liu, X.-L., Duan, G.-R., Teo, K.-L.: Optimal soft landing control for moon lander. Automatica 44(4), 1097–1103 (2008)
Lu, P.: Propellant-optimal powered descent guidance. J. Guid. Control. Dyn. 41(4), 813–826 (2017)
Remesh, N., Ramanan, R., Lalithambika, V.: Fuel optimum lunar soft landing trajectory design using different solution schemes. Int. Rev. Aerosp. Eng. 9(5), 131–143 (2016)
Rew, D.-Y., Ju, G., Lee, S., Kim, K., Kang, S.-W., Lee, S.-R.: Control system design of the Korean lunar lander demonstrator. Acta Astronaut. 94(1), 328–337 (2014)
Ma, L., Wang, K., Xu, Z., Shao, Z., Song, Z., Biegler, L.T.: Trajectory optimization for lunar rover performing vertical takeoff vertical landing maneuvers in the presence of terrain. Acta Astronaut. 146, 289–299 (2018)
Klumpp, A.R.: Apollo lunar descent guidance. Automatica 10(2), 133–146 (1974)
Lu, P.: Augmented apollo powered descent guidance. J. Guid. Control. Dyn. 42(3), 447–457 (2018)
D Souza, C.: An optimal guidance law for planetary landing. In: Proceedings of Guidance, Navigation, and Control Conference, New Orleans, pp. 1376–1381 (1997)
Ramkiran, B., Preethi, R., Rijesh, M.P., Kumar, G.V.P.B., Philip, N.K., Natarajan, P.: Analytical optimal guidance algorithm for lunar soft landing with terminal control constraints. In: Proceedings of Indian Control Conference, Hyderabad, pp. 481–486 (2016)
Zhang, B., Tang, S., Pan, B.: Multi-constrained suboptimal powered descent guidance for lunar pinpoint soft landing. Aerosp. Sci. Technol. 48, 203–213 (2016)
Zhou, L., Xia, Y.: Improved zem/zev feedback guidance for mars powered descent phase. Adv. Space Res. 54(11), 2446–2455 (2014)
Padhi, R., Kothari, M.: Model predictive static programming: a computationally efficient technique for suboptimal control design. Int. J. Innov. Comput. Inf. Control 5(2), 399–411 (2009)
Halbe, O., Raja, R.G., Padhi, R.: Robust reentry guidance of a reusable launch vehicle using model predictive static programming. J. Guid. Control. Dyn. 37(1), 134–148 (2013)
Uchiyama, K., Shimada, Y., Ogawa, K.: Minimum-jerk guidance for lunar lander. Trans. Jpn. Soc. Aeronaut. Space Sci. 48(159), 34–39 (2005)
Banerjee, A., Padhi, R.: An optimal explicit guidance algorithm for terminal descent phase of lunar soft landing. In: AIAA Guidance, Navigation, and Control Conference, p. 1266 (2017)
Ohlmeyer, E.J., Phillips, C.A.: Generalized vector explicit guidance. J. Guid. Control. Dyn. 29(2), 261–268 (2006)
Bryson, A.E.: Applied Optimal Control: Optimization, Estimation and Control. CRC Press, Routledge (1975)
Weisstein, Eric, W.: “quartic equation.” from mathworld—a wolfram web resource. https://mathworld.wolfram.com/quarticequation.html
Banerjee, A., Padhi, R.: Multi-phase MPSP guidance for lunar soft landing. Trans. Indian Natl. Acad. Eng. 5, 61–74 (2020)
Weisstein, Eric, W.: “cubic formula.” from mathworld—a wolfram web resource. https://mathworld.wolfram.com/cubicformula.html
Acknowledgements
The authors also gracefully acknowledge the financial and technical support received from Indian Space Research Organisation (ISRO) and Indian Institute of Science (IISc) Bangalore to carry out this work.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors state that there is no conflict of interest while carrying out this research.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendices
Appendix 1: Third-Order Polynomial Guidance and Its Equivalence to Minimum-Jerk Guidance
In this guidance, following the Apollo guidance paradigm [20], to account for the boundary conditions on position, velocity, and acceleration at both initial and final times, the acceleration vector is first parameterized as a third-order polynomial function of time-to-go (as against the second-order polynomial proposed in Apollo guidance [20]). Next, by imposing boundary conditions, the coefficients are determined. Note that imposing the hard boundary condition on the acceleration at the initial time helps ensure attitude continuity at the initial time during the transition to a new phase from the previous phase.
In this guidance design, the acceleration vector \(\varvec{a}(t_{go}) \in {\mathbb {R}}^3\) is written as
where, the initial conditions are
and the final conditions are
where, \(\varvec{k}_0,\ \varvec{k}_1,\ \varvec{k}_2,\ \varvec{k}_3 \in {\mathbb {R}}^3\) are the coefficients of the polynomial. Utilizing the system dynamics in Eq. (8) and successively integrating the acceleration expression with respect to \(t_{go}\), the spacecraft velocity and position are obtained as follows
where \(\varvec{k}_4,\ \varvec{k}_5 \in {\mathbb {R}}^3\) are integration constants. Applying the boundary conditions at \(t_{go} = 0\) and \(t_{go} = t_{{go}_0}\), as given in Eqs. (60) and (61), the coefficients of the polynomial are obtained as follows
where,
Finally, substituting the coefficients from Eqs. (64) and (65) into Eq. (59) the third-order polynomial guidance command is generated.
On the other hand, one can observe from Eq. (23) in Sect. 3, that the minimum jerk guidance law is given by
where \(\varvec{c}_{\varvec{1}},\varvec{c}_{\varvec{2}}\) and \(\varvec{c}_{\varvec{3}}\) are given as
By comparing the third-order polynomial guidance in Eq. (59) and the minimum jerk guidance in Eq. (67), one can easily see that
Hence, the expression for \({\varvec{a}}({{t}_{go}})\) in Eqs. (59) and (67) are identical as long as the initial time-to-go \(t_{{go}_0}\) remains the same. In other words, subject to identical boundary conditions on the initial and final position, velocity, and acceleration along with the reduced case of identical time-to-go, the minimum jerk guidance and modified Apollo guidance with third-order polynomial turn out to be the same.
Note that the major difference here is the fact that the Apollo guidance does not provide any specific instructions to choose \(t_{{go}_0}\). It simply designates it as a “tuning parameter”. In the minimum jerk guidance proposed in this paper, it is systematically computed by solving a fourth-order algebraic equation, as discussed in Sect. 4. The advantages of adopting this approach include (i) deriving time-to-go from a meaningful process (i.e. minimizing the deviation of acceleration from the average of the initial and final values), (ii) minimal tuning requirements, (iii) the ability to re-compute time-to-go, allowing for recovery from path perturbations. In addition to this, this paper also proposes a method for auto-adjusting time-to-go to prevent altitude excursion.
Appendix 2: Analytic Solution of a Quartic Equation
It is clear from the discussion in this paper that the roots of a quartic equation is of frequent interest. Section 4 describes a process for finding the \(t_{go_0}\), which is nothing but the smallest real positive root of a quartic polynomial given in Eq. (34). Also, the roots of another quartic polynomial given in Eq. (46) are used to determine the time at which the minimum of an altitude profile occurs. Furthermore, a quartic polynomial in Eq. (53) is used to find the modified time-to-go \(t^*_{go_0}\) for preventing altitude excursion. Therefore, for all the above scenarios, an analytical solution for finding the roots of a quartic polynomial is necessary for real-time computation. An interested reader can refer to [32] for the solution of this quartic polynomial. For completeness, however, the relevant steps with appropriate explanation for analytically finding the roots of a quartic polynomial is summarized here. Note that this procedure demands the solution of a cubic expression in an intermediate step. Hence, an approach for finding the roots of a cubic polynomial is also included.
1.1 Analytic Solution to a Quartic Expression
Consider a quartic polynomial with constant coefficients \(p_4, p_3, p_2, p_1\) and \(p_0\) of the following form
The first step is to eliminate the cubic term in the Eq. (72). In order to do that, the equation is divided by \(p_{4}\) (\(p_{4}\ne 0\)) and is rewritten in the terms of new coefficients as follows
where, \(a_3 = {p_3}/{p_4}, \ a_2 = {p_2}/{p_4}, \ a_1 = {p_1}/{p_4}, \ a_0 = {p_0}/{p_4}\). Then the Eq. (73) is transformed using \(x=z-{a_{3}}/{4}\). The equation then takes the form of the following depressed quartic polynomial.
where,
The next step is to write the Eq. (74) in an algebraically factorable form, such as the difference of two squared terms. To achieve this, the terms \(u z^{2}\) and \({u^{2}}/{4}\) are added and subtracted respectively, followed by carrying out the relevant algebra as follows
which can be written as
where,
Here, the first term \(P^2\) is a perfect square, and u can be chosen such that the second term \(Q^2\) is a perfect square too. With this in mind, the second term can be rewritten as
where,
Comparing the expression for \(B^2\) in Eqs. (85) and (86), we obtain the following relation for u
which, after the necessary simplification, leads to
It is obvious now that the solution of u is obtained as the roots of the cubic expression in Eq. (88). The analytic solution for finding the roots of a cubic expression can be found by following the procedure discussed separately later in this appendix. Since there is a chance of obtaining multiple roots, a detailed procedure for choosing the best possible root is also discussed.
One can also notice that Q can be written as
Next, using \(\left( {P}^{2}-{Q}^{2}\right) = ({P}+{Q})({P}-{Q})\), and assuming that the value of u is available, the quartic polynomial in Eq. (80) can be factorized into two quadratic expressions
Solving the two quadratic expressions given in Eq. (90), four solutions for z are obtained. Subsequently, using the relation \(x=z-{a_{3}}/{4}\), and carrying out the necessary algebra [32], the four solutions of the quartic polynomial given in Eq. (72) are obtained, as follows
where,
1.2 Analytic Solution of a Cubic Equation
As discussed in the previous section, the solution of the quartic polynomial assumes the solution of a cubic polynomial in Eq. (88). Hence, the solution process of a cubic polynomial is described in this section.
Consider the following cubic polynomial with constant coefficients \(q_3, q_2, q_1\) and \(q_0\)
Similar to the procedure followed in a solution of the quartic expression given in Appendix section “Analytic Solution to a Quartic Expression”, the quadratic term in Eq. (98) is eliminated first. For this, Eq. (98) is divided by \(q_{3}\) (\(q_{3}\ne 0\)) and rewritten in terms of the new coefficients as follows
where, \(b_2 = {q_2}/{q_3}, b_1 = {q_1}/{q_3}, b_0 = {q_0}/{q_3}\). Next, the transformation, \(x=y-{b_2}/{3}\) is used to transform the Eq. (99) to a depressed cubic form as shown in Eq. (100).
where,
This depressed cubic expression is written in an algebraically factorable form. To achieve this \(y=w-v\) (where, \(w \ne v\)) is substituted in Eq. (100) to rewrite it as
The solution for the Eq. (104) can be obtained by taking \(d=v^{3}-w^{3}\) and \(c=3 w v\). Solving these two expressions, one gets a quadratic polynomial in \(w^3\), as follows
This quadratic equation is solved to obtain the values for w and v as shown in Eq. (106)
where, \(\Delta ={d^{2}}/{4}+{c^{3}}/{27}\) is the discriminant. Using the relations used earlier, i.e. \(y = (w-v)\) and \(x=y-{b_2}/{3}\), the solution for the cubic polynomial is obtained. Note that, since the complex roots of a polynomial always occur in pairs, the cubic polynomial will have either one real root or three real roots.
If \(\Delta >0\), only one real solution for the cubic expression exists, which then leads to the following solution
If \(\Delta \le 0\), three roots exist for the cubic expression exists, which is given as follows
For details of this analysis and the associated solution, one can refer to [34].
1.3 Selection of Root of Cubic Expression for Evaluating the Quartic Expression
The solution of the quartic polynomial presented in Appendix 2.1 requires the computation of the cubic polynomial described in Eq. (88). If the cubic polynomial has multiple real roots, then a systematic methodology for selecting the most suitable root is provided here.
Let \({\bar{u}}\) denote a root of the polynomial in Eq. (88). By substituting this root into Eq. (90), we effectively reconstruct the quartic equation as follows
This equation is compared to the original quartic equation presented in Eq. (74). It is observed that all the coefficients are the same except for the constant term. The purpose here is to identify the root that, when utilized to reconstruct a quartic polynomial, provides an expression that closely resembles the original polynomial. To achieve this, the residue is calculated, which represents the absolute difference in the constant term of both polynomials which is described as follows
This residue is found for all three roots. The root corresponding to the smallest residue is chosen as the potential solution. This choice is made because the reconstructed quartic polynomial, as defined in Eq. (111), is closer to the original quartic polynomial stated in Eq. (74). Furthermore, as a final quality check, the cubic root is selected only if its corresponding residue is close to zero, specifically, if it is less than \(10^{-3}\) for computational purposes.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Padhi, R., Banerjee, A., Sai Kumar, P.S.V.S. et al. Attitude Constrained Robust Explicit Guidance for Terminal Phase of Autonomous Lunar Soft-Landing. J Astronaut Sci 71, 20 (2024). https://doi.org/10.1007/s40295-024-00437-8
Accepted:
Published:
DOI: https://doi.org/10.1007/s40295-024-00437-8