scholarly journals Tube Stochastic Optimal Control for Nonlinear Constrained Trajectory Optimization Problems

2020 ◽  
Vol 43 (4) ◽  
pp. 645-655
Author(s):  
Naoya Ozaki ◽  
Stefano Campagnola ◽  
Ryu Funase
Entropy ◽  
2020 ◽  
Vol 22 (10) ◽  
pp. 1120
Author(s):  
Tom Lefebvre ◽  
Guillaume Crevecoeur

In this article, we present a generalized view on Path Integral Control (PIC) methods. PIC refers to a particular class of policy search methods that are closely tied to the setting of Linearly Solvable Optimal Control (LSOC), a restricted subclass of nonlinear Stochastic Optimal Control (SOC) problems. This class is unique in the sense that it can be solved explicitly yielding a formal optimal state trajectory distribution. In this contribution, we first review the PIC theory and discuss related algorithms tailored to policy search in general. We are able to identify a generic design strategy that relies on the existence of an optimal state trajectory distribution and finds a parametric policy by minimizing the cross-entropy between the optimal and a state trajectory distribution parametrized by a parametric stochastic policy. Inspired by this observation, we then aim to formulate a SOC problem that shares traits with the LSOC setting yet that covers a less restrictive class of problem formulations. We refer to this SOC problem as Entropy Regularized Trajectory Optimization. The problem is closely related to the Entropy Regularized Stochastic Optimal Control setting which is often addressed lately by the Reinforcement Learning (RL) community. We analyze the theoretical convergence behavior of the theoretical state trajectory distribution sequence and draw connections with stochastic search methods tailored to classic optimization problems. Finally we derive explicit updates and compare the implied Entropy Regularized PIC with earlier work in the context of both PIC and RL for derivative-free trajectory optimization.


Author(s):  
Kai Zhang ◽  
Shuxing Yang ◽  
Fenfen Xiong

A sequential convex programming algorithm is proposed to solve the complex ascent trajectory optimization problems for guided rockets in this paper. Due to the nonlinear dynamics and constraints, especially, the nonlinear thrust terms and aerodynamic drag, ascent trajectory optimization problems for guided rockets are always difficult to be solved rapidly. In this paper, first, the complex thrust terms in the dynamic equation are approximately transformed into linear (convex) functions of the angle of attack. Secondly, the nonlinear drag coefficient is transformed into a linear (convex) function of design variables by introducing two new control variables. The relaxation technique is used to relax the constraints between the control variables to avoid non- convexity, and the accuracy of the relaxation is proved using the optimal control theory. Then, nonconvex objective functions and dynamical equations are convexified by first-order Taylor expansions. At last, a sequential convex programming iterative algorithm is proposed to solve the ascent trajectory planning problem accurately and rapidly. The ascent trajectory optimization problem for the terminal velocity maximum is simulated comparing with the general pseudospectral optimal control software method, which demonstrates the effectiveness and rapidity of the proposed method.


Aerospace ◽  
2021 ◽  
Vol 8 (3) ◽  
pp. 88
Author(s):  
David Morante ◽  
Manuel Sanjurjo Rivo ◽  
Manuel Soler

In this paper, we provide a survey on available numerical approaches for solving low-thrust trajectory optimization problems. First, a general mathematical framework based on hybrid optimal control will be presented. This formulation and their elements, namely objective function, continuous and discrete state and controls, and discrete and continuous dynamics, will serve as a basis for discussion throughout the whole manuscript. Thereafter, solution approaches for classical continuous optimal control problems will be briefly introduced and their application to low-thrust trajectory optimization will be discussed. A special emphasis will be placed on the extension of the classical techniques to solve hybrid optimal control problems. Finally, an extensive review of traditional and state-of-the art methodologies and tools will be presented. They will be categorized regarding their solution approach, the objective function, the state variables, the dynamical model, and their application to planetocentric or interplanetary transfers.


Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 336
Author(s):  
Askhat Diveev ◽  
Elizaveta Shmalko

This article presents a study devoted to the emerging method of synthesized optimal control. This is a new type of control based on changing the position of a stable equilibrium point. The object stabilization system forces the object to move towards the equilibrium point, and by changing its position over time, it is possible to bring the object to the desired terminal state with the optimal value of the quality criterion. The implementation of such control requires the construction of two control contours. The first contour ensures the stability of the control object relative to some point in the state space. Methods of symbolic regression are applied for numerical synthesis of a stabilization system. The second contour provides optimal control of the stable equilibrium point position. The present paper provides a study of various approaches to find the optimal location of equilibrium points. A new problem statement with the search of function for optimal location of the equilibrium points in the second stage of the synthesized optimal control approach is formulated. Symbolic regression methods of solving the stated problem are discussed. In the presented numerical example, a piece-wise linear function is applied to approximate the location of equilibrium points.


Sign in / Sign up

Export Citation Format

Share Document