Abstract

This paper presents a new algorithm for serial or parallel implementation of computer simulations of the dynamics of multi-rigid body systems subject to nonholonomic and holonomic constraints. The algorithm presents an elegant approach for eliminating the nonholonomic constraints explicitly from the equations of motion and implicitly expressing them in terms of nonlinear coupling in the operational inertias of the bodies subject to these constraints. The resulting equations are in the same form as those of a body subject to kinematic joint constraints. This enables the nonholohomic constraints to be seamlessly treated in either a (i) recursive or (ii) hierarchic assembly-disassembly process for solving the equations of motion of generalized multi-rigid body systems in serial or parallel implementations. The algorithm is non-iterative and although the nonholonomic constraints are imposed at the acceleration level, constraint satisfaction is excellent as demonstrated by the numerical test case implemented to verify the algorithm. The paper presents procedures for handling both cases where the nonholonomic constraints are imposed between terminal bodies of a system and the environment as well as when the constraints are imposed between bodies in the interior of the system topology. The algorithm uses a mixed set of coordinates and is built on the central idea of eliminating either constraint loads or relative accelerations from the equations of motion by projecting the equations of motion into the motion subspaces or their orthogonal complements.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.