Modified Chebyshev-Picard Iteration Methods for Solution of Boundary Value Problems
Modified Chebyshev-Picard iteration methods are presented for solving boundary value problems. Chebyshev polynomials are used to approximate the state trajectory in Picard iterations, while the boundary conditions are maintained by constraining the coefficients of the Chebyshev polynomials. Using Picard iteration and Clenshaw-Curtis quadrature, the presented methods iteratively refine an orthogonal function approximation of the entire state trajectory, in contrast to step-wise, forward integration approaches, which render the methods well-suited for parallel computation because computation of force functions along each path iteration can be rigorously distributed over many parallel cores with negligible cross communication needed. The presented methods solve optimal control problems through Pontryagin’s principle without requiring shooting methods or gradient information. The methods are demonstrated to be computationally efficient and strikingly accurate when compared with Battin’s method for a classical Lambert’s problem and with a Chebyshev pseudospectral method for an optimal trajectory design problem. The reported simulation results obtained on a serial machine suggest a strong basis for optimism of using the presented methods for solving more challenging boundary value problems, especially when highly parallel architectures are fully exploited.
KeywordsOptimal Control Problem Chebyshev Polynomial Pseudospectral Method Picard Iteration Chebyshev Series
Unable to display preview. Download preview PDF.
- LEWIS, F.L. and SYRMOS, V.L. Optimal Control. Wiley-Interscience, New York, NY, 1995.Google Scholar
- BAI, X. and JUNKINS, J.L. “Solving Initial Value Problems by the Picard-Chebyshev Method with NVIDIA GPUS,” presented at 20th Spaceflight Mechanics Meeting, San Diego, CA, Feb., 2010.Google Scholar
- BAI, X. and JUNKINS, J.L. “Modified Chebyshev-Picard Iteration Methods for Solution of Initial Value Problems,” presented at Kyle T. Alfriend Astrodynamics Symposium, Monterey, CA, May, 2010.Google Scholar
- BAI, X. Modified Chebyshev-Picard Iteration Methods for Solution of Initial Value and Boundary Value Problems. Ph.D. Dissertation, Texas A&M University, College Station, TX, 2010.Google Scholar
- PICARD, E. “Sur l’Application des Methodes d’approximations successives à l’Etude de certaines Equatioins differentielles ordinaires,” Journal de Mathematiques, Vol. 9, 1893, pp. 217–271.Google Scholar
- FOX, L. and PARKER, I.B. Chebyshev Polynomials in Numerical Analysis. London, UK: Oxford University Press, 1972.Google Scholar
- FEAGIN, T. The Numerical Solution of Two Point Boundary Value Problems Using Chebyshev Series. Ph.D. Dissertation, The Universtiy of Texas at Austin, Austin, TX, 1973.Google Scholar
- INCE, E.L. Ordinary Differential Equations. Dover Publications, Inc, New York, NY, 1956.Google Scholar
- FAHROO, F. and ROSS, I.M. “A Spectral Patching Method for Direct Trajectory Optimization,” Journal of the Astronautical Sciences, Vol. 48, No. 2/3, 2000, pp. 269–286.Google Scholar
- BAI, X., TURNER, J.D., and JUNKINS, J.L. “Optimal Thrust Design of a Mission to Apophis Based on a Homotopy Method,” presented at the AAS/AIAA Spaceflight Mechanics Meeting, Savannah, GA, Feb. 2009.Google Scholar