An Iterative Technique for Solving a Class of Nonlinear Quadratic Optimal Control Problems Using Chebyshev Polynomials | Zendy

Hussein Jaddu | Zendy; Amjad Majdalawi | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

An Iterative Technique for Solving a Class of Nonlinear Quadratic Optimal Control Problems Using Chebyshev Polynomials

Author(s) -

Hussein Jaddu,

Amjad Majdalawi

Publication year - 2014

Publication title -

international journal of intelligent systems and applications

Language(s) - English

Resource type - Journals

eISSN - 2074-9058

pISSN - 2074-904X

DOI - 10.5815/ijisa.2014.06.06

Subject(s) - chebyshev polynomials , computer science , chebyshev filter , class (philosophy) , quadratic equation , nonlinear system , mathematical optimization , chebyshev pseudospectral method , chebyshev nodes , control (management) , iterative method , chebyshev equation , mathematics , chebyshev iteration , control theory (sociology) , algorithm , orthogonal polynomials , mathematical analysis , classical orthogonal polynomials , artificial intelligence , physics , geometry , quantum mechanics , computer vision

In this paper, a method for solving a class of nonlinear optimal control problems is presented. The method is based on replacing the dynamic nonlinear optimal control problem by a sequence of quadratic programming problems. To this end, the iterative technique developed by Banks is used to replace the original nonlinear dynamic system by a sequence of linear time-varying dynamic systems, then each of the new problems is converted to quadratic programming problem by parameterizing the state variables by a finite length Chebyshev series with unknown parameters. To show the effectiveness of the proposed method, simulation results of a nonlinear optimal control problem are presented

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research