Premium
Bang‐Bang solution of nonlinear time‐optimal control problems using a semi‐exhaustivesearch
Author(s) -
Gupta Yash P.
Publication year - 2001
Publication title -
the canadian journal of chemical engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.404
H-Index - 67
eISSN - 1939-019X
pISSN - 0008-4034
DOI - 10.1002/cjce.5450790127
Subject(s) - bang–bang control , convergence (economics) , optimal control , nonlinear system , mathematics , control (management) , mathematical optimization , control theory (sociology) , nonlinear programming , computer science , economics , physics , quantum mechanics , artificial intelligence , economic growth
At times, the objective is to seek a bang‐bang control policy for nonlinear time‐optimal control problems. The usefulness of iterative dynamic programming (IDP) has been shown in the literature for solving such problems. However, the convergence to the optimal solution has been obtained from about 50% of the guessed values near the optimum. In this paper, we present a semiexhaustive search method for seeking such solutions and a comparison is made with the IDP. The results show that the convergence can be obtained from a significantly higher number of guessed values chosen over a much wider region around the optimum.