Author:
Yechiel Crispin
Affiliation:
Embry-Riddle University, United States
Keyword(s):
Optimal Control, Rocket Dynamics, Goddard’s Problem, Evolutionary Computation, Genetic Algorithms.
Related
Ontology
Subjects/Areas/Topics:
Artificial Intelligence
;
Artificial Intelligence and Decision Support Systems
;
Computational Intelligence
;
Enterprise Information Systems
;
Evolutionary Computation and Control
;
Evolutionary Computing
;
Genetic Algorithms
;
Informatics in Control, Automation and Robotics
;
Intelligent Control Systems and Optimization
;
Optimization Algorithms
;
Soft Computing
Abstract:
Nonlinear discrete time and continuous time optimal control problems with terminal constraints are solved using a new evolutionary approach which seeks the control history directly by evolutionary computation. Unlike methods that use the first order necessary conditions to determine the optimum, the main advantage of the present method is that it does not require the development of a Hamiltonian formulation and consequently, it eliminates the requirement to solve the adjoint problem which usually leads to a difficult two-point boundary value problem. The method is verified on two benchmark problems. The first problem is the discrete time velocity direction programming problem with the effects of gravity, thrust and drag and a terminal constraint on the final vertical position. The second problem is a continuous time optimal control problem in rocket dynamics, the Goddard’s problem. The solutions of both problems compared favorably with published results based on gradient methods.