z-logo
Premium
An energy‐momentum conserving method for the optimal control of multibody dynamics
Author(s) -
Siebert Ralf,
Betsch Peter
Publication year - 2009
Publication title -
pamm
Language(s) - English
Resource type - Journals
ISSN - 1617-7061
DOI - 10.1002/pamm.200910033
Subject(s) - discretization , multibody system , mathematics , equations of motion , sequence (biology) , dimension (graph theory) , inverse dynamics , optimal control , dynamical systems theory , numerical analysis , algebraic equation , momentum (technical analysis) , control theory (sociology) , work (physics) , computer science , mathematical optimization , mathematical analysis , classical mechanics , control (management) , physics , kinematics , finance , quantum mechanics , nonlinear system , artificial intelligence , biology , pure mathematics , economics , genetics , thermodynamics
The present work deals with inverse multibody dynamics problems, more precisely with optimal control problems for dynamical systems governed by differential‐algebraic equations. The used numerical integration method relies on the Hamilton formulation of the equations of motion. We will apply an energy and momentum conserving time discretization which typically exhibits superior numerical stability properties. The rigid body equations of motion are basically formulated using the director formulation, which requires the implementation of internal constraints. To eliminate the constraints the system will be reduced to its minimal dimension by applying the discrete nullspace method [3]. For the derivation of the necessary conditions of optimality the calculus of variation is used [4]. This approach leads to an indirect transcription method. The arising algorithm yields a sequence of discrete configurations together with a sequence of actuating forces. We test the formulation with the help of representative numerical example problems. (© 2009 Wiley‐VCH Verlag GmbH & Co. KGaA, Weinheim)

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here