Numerical computational method using genetic algorithm for the optimal control problem with terminal constraints and free parameters

1997 ◽  
Vol 30 (4) ◽  
pp. 2285-2290 ◽  
Author(s):  
Yuh Yamashita ◽  
Masasuke Shima
Author(s):  
K. L. Teo ◽  
K. H. Wong ◽  
Z. S. Wu

A class of convex optimal control problems involving linear hereditary systems with linear control constraints and nonlinear terminal constraints is considered. A result on the existence of an optimal control is proved and a necessary condition for optimality is given. An iterative algorithm is presented for solving the optimal control problem under consideration. The convergence property of the algorithm is also investigated. To test the algorithm, an example is solved.


2021 ◽  
Vol 2 (2) ◽  
pp. 68-78
Author(s):  
Anam Alwan Salih ◽  
Suha SHIHAB

The purpose of this paper is to introduce interesting modified Chebyshev orthogonal polynomial. Then, their new operational matrices of derivative and integration or modified Chebyshev polynomials of the first kind are introduced with explicit formulas. A direct computational method for solving a special class of optimal control problem, named, the quadratic optimal control problem is proposed using the obtained operational matrices. More precisely, this method is based on a state parameterization scheme, which gives an accurate approximation of the exact solution by utilizing a small number of unknown coefficients with the aid of modified Chebyshev polynomials. In addition, the constraint is reduced to some algebraic equations and the original optimal control problem reduces to optimization technique, which can be solved easily, and the approximate value of the performance index is calculated. Moreover, special attention is presented to discuss the convergence analysis and an upper bound of the error for the presented approximate solution is derived. Finally, some important illustrative examples of obtained results are shown and proved that powerful method in a simple way to get an optimal control of the considered.


2016 ◽  
Vol 57 (4) ◽  
pp. 461-481
Author(s):  
MARZIYEH MORTEZAEE ◽  
ALIREZA NAZEMI

We consider an approximation scheme using Haar wavelets for solving optimal path planning problems. The problem is first expressed as an optimal control problem. A computational method based on Haar wavelets in the time domain is then proposed for solving the obtained optimal control problem. A Haar wavelets integral operational matrix and a direct collocation method are used to find an approximate optimal trajectory of the original problem. Numerical results are also presented for several examples to demonstrate the applicability and efficiency of the proposed method.


2012 ◽  
Vol 53 (4) ◽  
pp. 292-307 ◽  
Author(s):  
K. H. WONG ◽  
W. M. TANG

AbstractWe develop a computational method for solving an optimal control problem governed by a switched impulsive dynamical system with time delay. At each time instant, only one subsystem is active. We propose a computational method for solving this optimal control problem where the time spent by the state in each subsystem is treated as a new parameter. These parameters and the jump strengths of the impulses are decision parameters to be optimized. The gradient formula of the cost function is derived in terms of solving a number of delay differential equations forward in time. Based on this, the optimal control problem can be solved as an optimization problem.


Sign in / Sign up

Export Citation Format

Share Document