.png){kind=icon}
.png){kind=icon}
Return
A new method for solving fractional optimal control problems
.png){kind=icon}
PRE
AI
S
S
A
K
DOI：10.1177/10775463241264329.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, we present a novel approach that utilizes the operational matrix method to solve fractional optimal control problems. We address the challenge of missing initial conditions for the co-state function by incorporating the linear shooting method. Our objective is to provide a method that not only enhances computational efficiency and reduces cost but also improves accuracy and usability. With our new approach, we can calculate the coefficients of the expansion solution without the need to solve an algebraic system. These coefficients can be generated explicitly or through an iterative process. We provide a proof of the uniform convergence of the approximate series of functions to the unique solution of the optimal control problem. To demonstrate the effectiveness of our proposed method, we solve several numerical examples and compare the results with those obtained by other researchers. Additionally, we extend the application of this new method to solve problems with multiple states, thereby expanding its scope to a wider range of problem domains. This allows us to address diverse scenarios using the same efficient and accurate approach. Through our research, we contribute to the development of a powerful and versatile method for solving fractional optimal control problems, offering significant advantages over existing techniques.
Keywords:
block pulse function
optimal control
uniformly convergence
Journal
J
IF:
2.4
Papers:
349
Citations:
8.8K
Organization
Cited Papers