Hostname: page-component-6766d58669-l4t7p Total loading time: 0 Render date: 2026-05-20T09:04:08.800Z Has data issue: false hasContentIssue false

Discrete mechanics and optimal control: An analysis*

Published online by Cambridge University Press:  31 March 2010

Sina Ober-Blöbaum
Affiliation:
Department of Mathematics, Faculty of Electrical Engineering, Computer Science and Mathematics, University of Paderborn, 33098 Paderborn, Germany. sinaob@math.upb.de
Oliver Junge
Affiliation:
Zentrum Mathematik, Technische Universität München, 85747 Garching, Germany. junge@ma.tum.de
Jerrold E. Marsden
Affiliation:
Control and Dynamical Systems, California Institute of Technology 107-81, Pasadena, CA 91125, USA. jmarsden@caltech.edu
Get access

Abstract

The optimal control of a mechanical system is of crucial importance in many application areas. Typical examples are the determination of a time-minimal path in vehicle dynamics, a minimal energy trajectory in space mission design, or optimal motion sequences in robotics and biomechanics. In most cases, some sort of discretization of the original, infinite-dimensional optimization problem has to be performed in order to make the problem amenable to computations. The approach proposed in this paper is to directly discretize the variational description of the system's motion. The resulting optimization algorithm lets the discrete solution directly inherit characteristic structural properties from the continuous one like symmetries and integrals of the motion. We show that the DMOC (Discrete Mechanics and Optimal Control) approach is equivalent to a finite difference discretization of Hamilton's equations by a symplectic partitioned Runge-Kutta scheme and employ this fact in order to give a proof of convergence. The numerical performance of DMOC and its relationship to other existing optimal control methods are investigated.

Information

Type
Research Article
Copyright
© EDP Sciences, SMAI, 2010

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable