Abstract A novel algorithm for autonomous landing guidance computation is presented. The trajectory is expressed in polynomial form of minimum order to satisfy a set of 17 boundary constraints, depending on 2 parameters: time-of-flight and initial thrust magnitude. The consequent control acceleration is expressed in terms of differential algebraic (DA) variables, expanded around the point of the domain along the nominal trajectory followed at the retargeting epoch. The DA representation of the objective and constraints gives additional information about their sensitivity to variations of the optimization variables, which is exploited to find the desired fuel minimum solution (if existing) robustly and with a very light computational effort.
Highlights A novel algorithm for autonomous planetary powered landing guidance computation. Trajectory is expressed as minimum order polynomials to satisfy boundary constraints. Control acceleration is expressed in terms of differential algebraic variables. Differential algebra objects carry sensitivity info wrt optimization variables. Fuel minimum solution is found robustly and with a very light computational effort.
Semi-analytical adaptive guidance computation for autonomous planetary landing
Acta Astronautica ; 195 ; 265-275
2022-03-03
11 pages
Article (Journal)
Electronic Resource
English
A semi-analytical guidance algorithm for autonomous landing
Online Contents | 2015
|Autonomous navigation and guidance scheme for precise and safe planetary landing
Online Contents | 2009
Autonomous navigation and guidance scheme for precise and safe planetary landing
Emerald Group Publishing | 2009
|