1,408 research outputs found
Discrete mechanics and optimal control: An analysis
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
Implicit-Explicit Runge-Kutta schemes for numerical discretization of optimal control problems
Implicit-explicit (IMEX) Runge-Kutta methods play a major rule in the
numerical treatment of differential systems governed by stiff and non-stiff
terms. This paper discusses order conditions and symplecticity properties of a
class of IMEX Runge-Kutta methods in the context of optimal control problems.
The analysis of the schemes is based on the continuous optimality system. Using
suitable transformations of the adjoint equation, order conditions up to order
three are proven as well as the relation between adjoint schemes obtained
through different transformations is investigated. Conditions for the IMEX
Runge-Kutta methods to be symplectic are also derived. A numerical example
illustrating the theoretical properties is presented
High order variational integrators in the optimal control of mechanical systems
In recent years, much effort in designing numerical methods for the
simulation and optimization of mechanical systems has been put into schemes
which are structure preserving. One particular class are variational
integrators which are momentum preserving and symplectic. In this article, we
develop two high order variational integrators which distinguish themselves in
the dimension of the underling space of approximation and we investigate their
application to finite-dimensional optimal control problems posed with
mechanical systems. The convergence of state and control variables of the
approximated problem is shown. Furthermore, by analyzing the adjoint systems of
the optimal control problem and its discretized counterpart, we prove that, for
these particular integrators, dualization and discretization commute.Comment: 25 pages, 9 figures, 1 table, submitted to DCDS-
Asymptotic Preserving time-discretization of optimal control problems for the Goldstein-Taylor model
We consider the development of implicit-explicit time integration schemes for
optimal control problems governed by the Goldstein-Taylor model. In the
diffusive scaling this model is a hyperbolic approximation to the heat
equation. We investigate the relation of time integration schemes and the
formal Chapman-Enskog type limiting procedure. For the class of stiffly
accurate implicit-explicit Runge-Kutta methods (IMEX) the discrete optimality
system also provides a stable numerical method for optimal control problems
governed by the heat equation. Numerical examples illustrate the expected
behavior
Linear multistep methods for optimal control problems and applications to hyperbolic relaxation systems
We are interested in high-order linear multistep schemes for time
discretization of adjoint equations arising within optimal control problems.
First we consider optimal control problems for ordinary differential equations
and show loss of accuracy for Adams-Moulton and Adams-Bashford methods, whereas
BDF methods preserve high--order accuracy. Subsequently we extend these results
to semi--lagrangian discretizations of hyperbolic relaxation systems.
Computational results illustrate theoretical findings
FATODE: A Library for Forward, Adjoint, and Tangent Linear Integration of ODEs
FATODE is a FORTRAN library for the integration of ordinary differential equations with direct and adjoint sensitivity analysis capabilities.
The paper describes the capabilities, implementation, code organization, and usage of this package.
FATODE implements four families of methods -- explicit Runge-Kutta for nonstiff problems and fully implicit Runge-Kutta, singly diagonally implicit Runge-Kutta, and Rosenbrock for stiff problems.
Each family contains several methods with different orders of accuracy; users can add new methods by simply providing their coefficients.
For each family the forward, adjoint, and tangent linear models are implemented.
General purpose solvers for dense and sparse linear algebra are used; users can easily incorporate problem-tailored linear algebra routines.
The performance of the package is demonstrated on several test problems.
To the best of our knowledge FATODE is the first publicly available general purpose package that offers forward and adjoint sensitivity
analysis capabilities in the context of Runge Kutta methods. A wide range of applications are expected to benefit from its use; examples include parameter estimation,
data assimilation, optimal control, and uncertainty quantification
- …