59296 MULTIBODY DYNAMIC ANALYSIS OF OPERATING MECHANISM IN A MOBILE HARBOR CRANE(Multibody System Analysis)

2010 ◽  
Vol 2010.5 (0) ◽  
pp. _59296-1_-_59296-4_
Author(s):  
Yun-Su Jung ◽  
MIn-Seok Kim ◽  
Wan-Suk Yoo
Keyword(s):  
Dynamic Analysis ◽  
System Analysis ◽  
Multibody System ◽  
Operating Mechanism ◽  
Mobile Harbor ◽  
Multibody Dynamic

Multirate Integration for Multibody Dynamic Analysis With Decomposed Subsystems

1999 ◽  
Author(s):  
Sung-Soo Kim ◽  
Jeffrey S. Freeman
Keyword(s):  
Dynamic Analysis ◽  
Multibody System ◽  
Equations Of Motion ◽  
Low Frequency ◽  
Inertia Force ◽  
Integration Scheme ◽  
Integration Algorithm ◽  
Multibody Dynamic ◽  
Higher Order Derivative ◽  
Derivative Information

Abstract This paper details a constant stepsize, multirate integration scheme which has been proposed for multibody dynamic analysis. An Adams-Bashforth Moulton integration algorithm has been implemented, using the Nordsieck form to store internal integrator information, for multirate integration. A multibody system has been decomposed into several subsystems, treating inertia coupling effects of subsystem equations of motion as the inertia forces. To each subsystem, different rate Nordsieck form of Adams integrator has been applied to solve subsystem equations of motion. Higher order derivative information from the integrator provides approximation of inertia force computation in the decomposed subsystem equations of motion. To show the effectiveness of the scheme, simulations of a vehicle multibody system that consists of high frequency suspension motion and low frequency chassis motion have been carried out with different tire excitation forces. Efficiency of the proposed scheme has been also investigated.

Multibody system analysis based on Hamilton's weak principle

AIAA Journal ◽  
2001 ◽  
Vol 39 ◽  
pp. 2382-2388
Author(s):  
D. L. Kunz
Keyword(s):  
System Analysis ◽  
Multibody System

The Problem of Scheduling Parallel Computations of Multibody Dynamic Analysis Is NP-Hard

1996 ◽  
Author(s):  
Jin-Fan Liu ◽  
Karim A. Abdel-Malek
Keyword(s):  
Dynamic Analysis ◽  
Spanning Tree ◽  
Minimum Weight ◽  
Computational Cost ◽  
Parallel Computations ◽  
Np Hard ◽  
Multibody Dynamic ◽  
Np Hard Problem ◽  
Np Complete ◽  
Minimum Weight Spanning Tree

Abstract A formulation of a graph problem for scheduling parallel computations of multibody dynamic analysis is presented. The complexity of scheduling parallel computations for a multibody dynamic analysis is studied. The problem of finding a shortest critical branch spanning tree is described and transformed to a minimum radius spanning tree, which is solved by an algorithm of polynomial complexity. The problems of shortest critical branch minimum weight spanning tree (SCBMWST) and the minimum weight shortest critical branch spanning tree (MWSCBST) are also presented. Both problems are shown to be NP-hard by proving that the bounded critical branch bounded weight spanning tree (BCBBWST) problem is NP-complete. It is also shown that the minimum computational cost spanning tree (MCCST) is at least as hard as SCBMWST or MWSCBST problems, hence itself an NP-hard problem. A heuristic approach to solving these problems is developed and implemented, and simulation results are discussed.

Sign in / Sign up

Export Citation Format

Share Document