Solving Optimal Continuous Thrust Rendezvous Problems with Generating Functions
نویسندگان
چکیده
The optimal control of a spacecraft as it transitions between specified states using continuous thrust in a fixed amount of time is studied using a recently developed technique based on Hamilton–Jacobi theory. Started from the first-order necessary conditions for optimality, a Hamiltonian system is derived for the state and adjoints with split boundary conditions. Then, with recognition of the two-point boundary-value problem as a canonical transformation, generating functions are employed to find the optimal feedback control, as well as the optimal trajectory. Although the optimal control problem is formulated in the context of the necessary conditions for optimality, our closed-loop solution also formally satisfies the sufficient conditions for optimality via the fundamental connection between the optimal cost function and generating functions. A solution procedure for these generating functions is posed and numerically tested on a nonlinear optimal rendezvous problem in the vicinity of a circular orbit. Generating functions are developed as series expansions, and the optimal trajectories obtained from them are compared favorably with those of a numerical solution to the two-point boundary-value problem using a forward-shooting method.
منابع مشابه
Solving optimal control problems with integral equations or integral equations - differential with the help of cubic B-spline scaling functions and wavelets
In this paper, a numerical method based on cubic B-spline scaling functions and wavelets for solving optimal control problems with the dynamical system of the integral equation or the differential-integral equation is discussed. The Operational matrices of derivative and integration of the product of two cubic B-spline wavelet vectors, collocation method and Gauss-Legendre integration rule for ...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملA Neural Network Method Based on Mittag-Leffler Function for Solving a Class of Fractional Optimal Control Problems
In this paper, a computational intelligence method is used for the solution of fractional optimal control problems (FOCP)'s with equality and inequality constraints. According to the Ponteryagin minimum principle (PMP) for FOCP with fractional derivative in the Riemann- Liouville sense and by constructing a suitable error function, we define an unconstrained minimization problem. In the optimiz...
متن کامل(Preprint) AAS 09-392 A PEER-TO-PEER REFUELING STRATEGY USING LOW-THRUST PROPULSION
The problem of minimum-fuel, time-fixed, low-thrust rendezvous is addressed with the particular aim of developing a solver to determine optimal low-thrust Peer-to-Peer (P2P) maneuvers, which will be an integral part of distributed lowthrust servicing missions for multiple satellites. We develop the solver based on an indirect optimization technique and utilize the well-known shooting method to ...
متن کاملSolving the Goddard problem with thrust and dynamic pressure constraints using saturation functions
This paper addresses the well-known Goddard problem in the formulation of Seywald and Cliff with the objective to maximize the altitude of a vertically ascending rocket subject to dynamic pressure and thrust constraints. The Goddard problem is used to propose a new method to systematically incorporate the constraints into the system dynamics by means of saturation functions. This procedure resu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006