Abstract
In this paper, we present a new method based on the Clenshaw-Curtis formula to solve a class of fractional optimal control problems. First, we convert the fractional optimal control problem to an equivalent problem in the fractional calculus of variations. Then, by utilizing the Clenshaw-Curtis formula and the Chebyshev-Gauss-Lobatto points, we transform the problem to a discrete form. By this approach, we get a nonlinear programming problem by solving of which we can approximate the optimal solution of the main problem. We analyze the convergence of the obtained approximate solution and solve some numerical examples to show the efficiency of the method.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
