Direct trajectory optimization based on a mapped Chebyshev pseudospectral method
Xiao Guo, Ming Zhu
Abstract
Open-access reader
Xiao Guo, Ming Zhu
Abstract
Open-access reader
In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral (PS) method makes the points’ accumulation near the extremities and rarefaction of nodes close to the center of interval, which causes an ill-condition of differentiation matrix and an oscillation of the optimal solution. For improvement upon the difficulties, a mapped Chebyshev pseudospectral method is proposed. A conformal map is applied to Chebyshev points to move the points closer to equidistant nodes. Condition number and spectral radius of differentiation matrices from both methods are presented to show the improvement. Furthermore, the modification keeps the Chebyshev pseudospectral method’s advantage, the spectral convergence rate. Based on three numerical examples, a comparison of the execution time, convergence and accuracy is presented among the standard Chebyshev pseudospectral method, other collocation methods and the proposed one. In one example, the error of results from mapped Chebyshev pseudospectral method is reduced to 5% of that from standard Chebyshev pseudospectral method.
OpenAlex reports 53 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In view of generating optimal trajectories of Bolza problems, standard Chebyshev pseudospectral (PS) method makes the points’ accumulation near the extremities and rarefaction of nodes close to the center of interval, which causes an ill-condition of differentiation matrix and an oscillation of the optimal solution. For improvement upon the difficulties, a mapped Chebyshev pseudospectral method is proposed. A conformal map is applied to Chebyshev points to move the points closer to equidistant nodes. Condition number and spectral radius of differentiation matrices from both methods are presented to show the improvement. Furthermore, the modification keeps the Chebyshev pseudospectral method’s advantage, the spectral convergence rate. Based on three numerical examples, a comparison of the execution time, convergence and accuracy is presented among the standard Chebyshev pseudospectral method, other collocation methods and the proposed one. In one example, the error of results from mapped Chebyshev pseudospectral method is reduced to 5% of that from standard Chebyshev pseudospectral method.
Key concepts: Chebyshev pseudospectral method, Pseudospectral optimal control, Gauss pseudospectral method, Pseudo-spectral method, Chebyshev filter, Mathematics, Chebyshev iteration, Chebyshev nodes