arXiv subjects

Max Cerf

Publications and source records attributed to Max Cerf.

11 recordsLinked to original sources

arXiv2018

Multiple Object Trajectography Using Particle Swarm Optimization Combined to Hungarian Method

The problem of simultaneous trajectography of several dynamical objects is formulated as an optimization problem. The available observations consist in a series of photographs showing undiscriminated objects. The goal is to find the object initial states so that the resulting trajectories match as well as possible the set of observations. An assignment problem is solved at each observation date by the Hungarian method, yielding a deviation cost between the simulated trajectories and the measurements. A fitness function summing the deviation costs is minimized by a particle swarm algorithm. The method is illustrated on a space orbitography application.

math.OC↗

arXiv2018

Coplanar Low-Thrust Transfer with Eclipses Using Analytical Costate Guess

Low-thrust orbital transfers are difficult to optimize by indirect methods. The main issues come from the costate guess and from the numerical propagation accuracy required by the shooting method. In the case of a coplanar minimum-time low-thrust transfer with eclipses, an analytical costate guess is proposed. The optimal control problem reduces to an unconstrained minimization problem with two unknowns. A derivative-free algorithm yields a quasi-optimal solution from scratch in a few minutes. No specific guess is necessary and the algorithm properties ensure finding the global minimum of the unconstrained problem. The method is applicable to thrust levels from large to very low and to any eclipse configuration, as exemplified on a transfer towards the geostationary orbit.

math.OC↗

arXiv2017

Why do launch trajectories end downwards

The problem of finding the optimal thrust profile of a launcher upper stage is analyzed. The engine is assumed to be continuously thrusting, following either a linear or a bilevel parametric profile, until reaching the targeted coplanar orbit. The minimum-fuel problem is analytically solved using the maximum principle. A closed-loop solution for the thrust direction is derived and the final point is found to be necessarily at an apside, reached downwards in the case of a perigee injection. The optimal control problem reduces to a nonlinear problem with only the thrust profile parameters as unknowns. An application case targeting a geostationary transfer orbit illustrates the solution method.

math.OC↗

arXiv2017

Geometric Optimal Control and Applications to Aerospace

This survey article deals with applications of optimal control to aerospace problems with a focus on modern geometric optimal control tools and numerical continuation techniques. Geometric optimal control is a theory combining optimal control with various concepts of differential geometry. The ultimate objective is to derive optimal synthesis results for general classes of control systems. Continuation or homotopy methods consist in solving a series of parameterized problems, starting from a simple one to end up by continuous deformation with the initial problem. They help overcoming the difficult initialization issues of the shooting method. The combination of geometric control and homotopy methods improves the traditional techniques of optimal control theory. A nonacademic example of optimal attitude-trajectory control of (classical and airborne) launch vehicles, treated in details, illustrates how geometric optimal control can be used to analyze finely the structure of the extremals. This theoretical analysis helps building an efficient numerical solution procedure combining shooting methods and numerical continuation. Chattering is also analyzed and it is shown how to deal with this issue in practice.

math.OC↗

arXiv2016

Optimal Thrust Level for Orbit Insertion

The minimum-fuel orbital transfer is analyzed in the case of a launcher upper stage using a constantly thrusting engine. The thrust level is assumed to be constant and its value is optimized together with the thrust direction. A closed-loop solution for the thrust direction is derived from the extremal analysis for a planar orbital transfer. The optimal control problem reduces to two unknowns, namely the thrust level and the final time. Guessing and propagating the costates is no longer necessary and the optimal trajectory is easily found from a rough initialization. On the other hand the initial costates are assessed analytically from the initial conditions and they can be used as initial guess for transfers at different thrust levels. The method is exemplified on a launcher upper stage targeting a geostationary transfer orbit.

math.OC↗

arXiv2015

Coupled attitude and trajectory optimization for a launcher tilting maneuver

We study the minimum time control problem of the launchers. The optimal trajectories of the problem may contain singular arcs, and thus chattering arcs. The motion of the launcher is described by its attitude kinematics and dynamics and also by its trajectory dynamics. Based on the nature of the system, we implement an efficient indirect numerical method, combined with numerical continuation, to compute numerically the optimal solutions of the problem. Numerical experiments show the efficiency and the robustness of the proposed method.

math.OC↗

arXiv2015

Minimum time control of the rocket attitude reorientation associated with orbit dynamics

In this paper, we investigate the minimal time problem for the guidance of a rocket, whose motion is described by its attitude kinematics and dynamics but also by its orbit dynamics. Our approach is based on a refined geometric study of the extremals coming from the application of the Pontryagin maximum principle. Our analysis reveals the existence of singular arcs of higher-order in the optimal synthesis, causing the occurrence of a chattering phenomenon, i.e., of an infinite number of switchings when trying to connect bang arcs with a singular arc. We establish a general result for bi-input control-affine systems, providing sufficient conditions under which the chattering phenomenon occurs. We show how this result can be applied to the problem of the guidance of the rocket. Based on this preliminary theoretical analysis, we implement efficient direct and indirect numerical methods, combined with numerical continuation, in order to compute numerically the optimal solutions of the problem.

math.OC↗

arXiv2015

Planar tilting maneuver of a spacecraft: singular arcs in the minimum time problem and chattering

In this paper, we study the minimum time planar tilting maneuver of a spacecraft, from the theoretical as well as from the numerical point of view, with a particular focus on the chattering phenomenon. We prove that there exist optimal chattering arcs when a singular junction occurs. Our study is based on the Pontryagin Maximum Principle and on results by M.I. Zelikin and V.F. Borisov. We give sufficient conditions on the initial values under which the optimal solutions do not contain any singular arc, and are bang-bang with a finite number of switchings. Moreover, we implement sub-optimal strategies by replacing the chattering control with a fixed number of piecewise constant controls. Numerical simulations illustrate our results.

math.OC↗

arXiv2015

Low-Thrust Transfer Between Circular Orbits Using Natural Precession

The minimum-fuel low-thrust transfer between circular orbits is formulated using the Edelbaum's averaged dynamics with the addition of the nodal precession due to the first zonal term. The extremal analysis shows that an optimal transfer is composed of three sequences in the regular case. The optimal control problem is solved by a shooting method with a costate guess derived from an approximate solution.

math.OC↗

arXiv2014

Multiple Space Debris Collecting Mission -- Optimal Mission Planning

This paper addresses the problem of planning successive Space Debris Collecting missions so that they can be achieved at minimal cost by a generic vehicle. The problem mixes combinatorial optimization to select and order the debris among a list of candidates, and continuous optimization to fix the rendezvous dates and to define the minimum fuel orbital maneuvers. The solution method proposed consists in three stages. Firstly the orbital transfer problem is simplified by considering a generic transfer strategy suited either to a high thrust or a low thrust vehicle. A response surface modelling is built by solving the reduced problem for all pairs of debris and for discretized dates, and storing the results in cost matrices. Secondly a simulated annealing algorithm is applied to find the optimal mission planning. The cost function is assessed by interpolation on the response surface based on the cost matrices. This allows the convergence of the simulated algorithm in a limited computation time, yielding an optimal mission planning. Thirdly the successive missions are re-optimized in terms of transfer maneuvers and dates without changing the debris order. These continuous control problems yield a refined solution with the performance requirement for designing the future Space Debris Collecting vehicle. The method is applicable for large list of debris and for various assumptions regarding the cleaning program (number of missions, number of debris per mission, total duration, deorbitation scenario, high or low thrust vehicle). It is exemplified on an application case with 3 missions to plan, each mission visiting 5 SSO debris to be selected in a list of 21 candidates.

math.OC↗

arXiv2011

Multiple Space Debris Collecting Mission - Debris selection and Trajectory optimization

A possible mean to stabilize the LEO debris population is to remove each year 5 heavy debris like spent satellites or launchers stages from that space region. This paper investigates the DeltaV requirement for such a Space Debris Collecting mission. The optimization problem is intrinsically hard since it mixes combinatorial optimization to select the debris among a list of candidates and functional optimization to define the orbital maneuvers. The solving methodology proceeds in two steps : firstly a generic transfer strategy with impulsive maneuvers is defined so that the problem becomes of finite dimension, secondly the problem is linearized around an initial reference solution. A Branch and Bound algorithm is then applied to optimize simultaneously the debris selection and the orbital maneuvers, yielding a new reference solution. The process is iterated until the solution stabilizes on the optimal path. The trajectory controls and dates are finally re-optimized in order to refine the solution. The method is applicable whatever the numbers of debris (candidate and to deorbit) and whatever the mission duration. It is exemplified on an application case consisting in selecting 5 SSO debris among a list of 11.

eess.SY↗