Orthogonal Complement Based Divide-and-Conquer Algorithm for constrained multibody systems
- First Online:
- Cite this article as:
- Mukherjee, R.M. & Anderson, K.S. Nonlinear Dyn (2007) 48: 199. doi:10.1007/s11071-006-9083-3
A new algorithm, Orthogonal Complement based Divide-and-Conquer Algorithm (O-DCA), is presented in this paper for calculating the forward dynamics of constrained multi-rigid bodies including topologies involving single or coupled closed kinematic loops. The algorithm is exact and noniterative. The constraints are imposed at the acceleration level by utilizing a kinematic relation between the joint motion subspace (or partial velocities) and its orthogonal complement. Sample test cases indicate excellent constraint satisfaction and robust handling of singular configurations. Since the present algorithm does not use either a reduction or augmentation approach in the traditional sense for imposing the constraints, it does not suffer from the associated problems for systems passing through singular configurations. The computational complexity of the algorithm is expected to be O(n+m) and O(log(n+m)) for serial and parallel implementation, respectively, where n is the number of generalized coordinates and m is the number of independent algebraic constraints.
KeywordsClosed kinematic loops Orthogonal complement Singular configurations Logarithmic computational complexity Divide-and-Conquer
Unable to display preview. Download preview PDF.