Extension of the divide-and-conquer algorithm for the efficient inverse dynamics analysis of multibody systems

被引:0
|
作者
Cameron Kingsley
Mohammad Poursina
机构
[1] University of Arizona,Computational Dynamics of Complex Systems Lab, Department of Aerospace and Mechanical Engineering
来源
Multibody System Dynamics | 2018年 / 42卷
关键词
Constrained multibody system; Divide-and-conquer algorithm; Inverse dynamics; Control; Fully actuated systems; Generalized driving force;
D O I
暂无
中图分类号
学科分类号
摘要
This paper presents a new mathematical framework to extend the Generalized Divide-and-Conquer Algorithm (GDCA) for the inverse dynamics analysis of fully actuated constrained multibody systems. Inverse-GDCA (iGDCA) is a highly parallelizable method which does not create the mass and Jacobian matrices of the entire system. In this technique, generalized driving forces and constraint loads due to kinematic pairs are clearly and separately differentiated from each other in the equations of motion. As such, it can be easily used for control scheme purposes. iGDCA works based on a series of recursive assembly and disassembly passes to form and solve the equations governing the inverse dynamics of the system. Herein, the mathematical formulations to efficiently combine the dynamics of consecutive bodies in the assembly pass for the purpose of inverse dynamics analysis are presented. This is followed by generating the disassembly pass algorithm to efficiently compute generalized actuating forces. Furthermore, this paper presents necessary mathematical formulations to efficiently treat the inverse dynamics of multibody systems involving kinematic loops with various active and passive boundary conditions. This is followed by the design of a new strategy to efficiently perform the assembly–disassembly pass in these complex systems while avoiding unnecessary computations. Finally, the presented method is applied to selected open-chain and closed-chain multibody systems.
引用
收藏
页码:145 / 167
页数:22
相关论文
共 50 条
  • [41] A divide-and-conquer algorithm of Delaunay triangulation with GPGPU
    Chen, Min-Bin
    2012 FIFTH INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES, ALGORITHMS AND PROGRAMMING (PAAP), 2012, : 175 - 177
  • [42] Engineering the Divide-and-Conquer Closest Pair Algorithm
    Minghui Jiang
    Joel Gillespie
    Journal of Computer Science and Technology, 2007, 22 : 532 - 540
  • [43] Efficient divide-and-conquer multiprecision integer division
    Hart, William
    IEEE 22nd Symposium on Computer Arithmetic ARITH 22, 2015, : 90 - 95
  • [44] A divide-and-conquer algorithm for quantum state preparation
    Israel F. Araujo
    Daniel K. Park
    Francesco Petruccione
    Adenilton J. da Silva
    Scientific Reports, 11
  • [45] AN IMPLEMENTATION OF A DIVIDE-AND-CONQUER ALGORITHM FOR THE UNITARY EIGENPROBLEM
    AMMAR, GS
    REICHEL, L
    SORENSEN, DC
    ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1992, 18 (03): : 292 - 307
  • [46] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Carlos H. González
    Basilio B. Fraguela
    Cluster Computing, 2017, 20 : 2605 - 2626
  • [47] A general and efficient divide-and-conquer algorithm framework for multi-core clusters
    Gonzalez, Carlos H.
    Fraguela, Basilio B.
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2017, 20 (03): : 2605 - 2626
  • [48] A parallel processing method of divide-and-conquer and a highly efficient parallel sorting algorithm
    Huang, Minghe
    Zhong, Cuixiang
    Dai, Liping
    Lei, Gang
    DCABES 2006 Proceedings, Vols 1 and 2, 2006, : 86 - 88
  • [49] DIVIDE-AND-CONQUER METHODS FOR BLOCK TRIDIAGONAL SYSTEMS
    MEHRMANN, V
    PARALLEL COMPUTING, 1993, 19 (03) : 257 - 279
  • [50] GENERALIZED ORTHOGONAL COMPLEMENT BASED DIVIDE AND CONQUER ALGORITHM FOR CONSTRAINED MULTIBODY DYNAMICS
    Mukherjee, Rudranarayan M.
    Anderson, Kurt S.
    PROCEEDINGS OF ASME INTERNATIONAL DESIGN ENGINEERING TECHNICAL CONFERENCES AND COMPUTERS AND INFORMATION IN ENGINEERING CONFERENCE, VOL 4, PTS A-C, 2010, : 121 - 127