By Topic

Computational algorithm based on state parametrization for constrained nonlinear optimal control problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
H. Jaddu ; Sch. of Inf. Sci., Japan Adv. Inst. of Sci. & Technol., Ishikawa, Japan ; E. Shimemura

An algorithm, based on quasi-linearization and state variable parametrization by using Chebyshev polynomials, is proposed to solve the nonlinear optimal control problem subject to terminal state constraints and control saturation constraints. By the virtue of the second method of quasi-linearization and state parametrization, the difficult nonlinear optimal control problem is converted into a sequence of standard quadratic programming problems. An example is given to show the effectiveness of the proposed algorithm

Published in:

Decision and Control, 1997., Proceedings of the 36th IEEE Conference on  (Volume:5 )

Date of Conference:

10-12 Dec 1997