Abstract
This paper provides a numerical approach for solving optimal control problems governed by ordinary differential equations. Continuous extension of an explicit, fixed step-size Runge-Kutta scheme is used in order to approximate state variables; moreover, the objective function is discretized by means of Gaussian quadrature rules. The resulting scheme represents a nonlinear programming problem, which can be solved by optimization algorithms. With the aim to test the proposed method, it is applied to different problems.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bellen, A., Zennaro, M.: Numerical methods for delay differential equations. Clarendon Press, Oxford (2003)
Davis, P.J., Rabinowitz, P.: Methods of numerical integration, 2nd edn. Academic, New York (1984)
Hager, W.W.: Rates of convergence for discrete approximations to unconstrained control problems. SIAM J. Numer. Anal. 13(4), 449–472 (1976)
Lambert, J.D.: Numerical methods for ordinary differential systems. Wiley & Sons, Chichester (1997)
Nedeljkovic, N.B.: New algorithms for unconstrained nonlinear optimal control problems. IEEE Trans. Autom. Cntrl. 26(4), 868–884 (1981)
Schwartz, A.: Theory and implementation of numerical methods based on Runge- Kutta integration for solving optimal control problems. PhD Thesis, U.C. Berkeley (1996)
Zennaro, M.: Natural continuous extensions of Runge-Kutta methods. Mathematics of Computation 46(173), 119–133 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Diele, F., Marangi, C., Ragni, S. (2004). Numerical Methods Based on Gaussian Quadrature and Continuous Runge-Kutta Integration for Optimal Control Problems. In: Laganá, A., Gavrilova, M.L., Kumar, V., Mun, Y., Tan, C.J.K., Gervasi, O. (eds) Computational Science and Its Applications – ICCSA 2004. ICCSA 2004. Lecture Notes in Computer Science, vol 3044. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24709-8_102
Download citation
DOI: https://doi.org/10.1007/978-3-540-24709-8_102
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22056-5
Online ISBN: 978-3-540-24709-8
eBook Packages: Springer Book Archive