Efficient Dynamic Simulation of Robotic Mechanisms: (203 The Springer International Series in Engineering and Computer Science)

"Efficient Dynamic Simulation of Robotic Mechanisms" presents computationally efficient algorithms for the dynamic simulation of closed-chain robotic systems. In particular, the simulation of single closed chains and simple closed-chain mechanisms is investigated in detail. Single closed chains are common in many applications, including industrial assembly operations, hazardous remediation, and space exploration. Simple closed-chain mechanisms include such familiar configurations as multiple manipulators moving a common load, dexterous hands and multilegged vehicles. The efficient dynamics simulation of these systems is often required for testing an advanced control scheme prior to its implementation, to aid a human operator during remote teleoperation, or to improve system performance. In conjunction with the dynamic simulation algorithms, efficient algorithms are also derived for the computation of the joint space and operational space inertia matrices of a manipulator. The manipulator inertia matrix is a significant components of any robot dynamics formulation and plays an important role in both simulation and control. The efficient computation of the inertia matrix is highly desirable for real-time implementation of robot dynamics algorithms. Several alternate formulations are provided for each inertia matrix. Computational efficiency in the algorithm is achieved by several means, including the development of recursive formulations and the use of efficient spatial transformations and mathematics. All algorithms are derived and presented in a convenient tabular format using a modified form of spatial notation, a six-dimensional vector notation which greatly simplifies the presentation and analysis of multibody dunamics. Basic definitions and fundamental principles required to use and understand this notation are provided. The implementation of the efficient spatial transformations is also discussed. As a means of evaluating effiency, the number of scalar operations (multiplications and addition) required for each algorithm is tabulated after its derivation. Specification of the computational complexity of each algorithm in this manner makes comparison with other algorithms both easy and convenient. The algorithms presented in this work are among the most efficient robot dynamics algorithms available at this time. In addition to computational efficiency,special emphasis is also placed on retaining as much physical insight as possible during algorithm derivation. The algorithms are easy to follow and understand, whether the reader is a robotics novice or a seasoned specialist.

Table of Contents:
1 Introduction.- 1.1 Scope and Contents.- 1.2 The Dynamic Simulation Problem.- 1.3 Direct Dynamics for Robotic Systems.- 1.4 Dynamics of Simple Closed-Chain Mechanisms.- 1.5 Organization and Reader’s Guide.- 2 System Modelling and Notation.- 2.1 Introduction.- 2.2 Kinematic and Dynamic Parameters of a Robotic Mechanism.- 2.3 General Joint Model.- 2.4 Summary.- 3 Alternate Formulations for the Joint Space Inertia Matrix.- 3.1 Introduction.- 3.2 Previous Work.- 3.3 Additional Notation and Background.- 3.4 The Algorithms.- 3.5 Efficient Transformation of Spatial Quantities.- 3.6 Computational Requirements.- 3.7 Summary and Conclusions.- 4 Alternate Formulations for the Operational Space Inertia Matrix.- 4.1 Introduction.- 4.2 Previous Work.- 4.3 The Operational Space Formulation.- 4.4 The Operational Space Inertia Matrix.- 4.5 The Algorithms.- 4.6 Computational Requirements.- 4.7 Summary and Conclusions.- 5 Efficient Dynamic Simulation of A Single Closed Chain.- 5.1 Introduction.- 5.2 Previous Work.- 5.3 Equations of Motion and Joint Accelerations.- 5.4 Acceleration of the End Effector.- 5.5 Tip Constraints.- 5.6 Dynamic Simulation Algorithm for a Single Closed Chain.- 5.7 Computational Requirements.- 5.8 Summary and Conclusions.- 6 Efficient Dynamic Simulation of Simple Closed-Chain Mechanisms.- 6.1 Introduction.- 6.2 Previous Work.- 6.3 System Configuration and Problem Statement.- 6.4 System Dynamic Equations.- 6.5 Dynamic Simulation Algorithm for Simple Closed-Chain Mechanisms.- 6.6 An Alternate Form of the Simulation Algorithm.- 6.7 Computational Requirements.- 6.8 Summary and Conclusions.- 6.9 A Final Note.

Review :
` The case for recommending this book is that it represents a state of development in the formulation of efficient algorithms and that it holds a record that specialists can argue over and try to beat. ' Proceedings of the Institution of Mechanical Engineers, 208