{'fraction_non_alphanumeric': 0.026200873362445413, 'fraction_numerical': 0.01222707423580786, 'mean_word_length': 5.262295081967213, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 1, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Recursive Multibody Dynamics and Sensitivity Algorithm for Branched Kinematic Chains

In this work an efficient dynamics algorithm is developed, which is applicable to a wide range of multibody systems, including underactuated systems, branched or tree-topology systems, robots, and walking machines. The dynamics algorithm is differentiated with respect to the input parameters in order to form sensitivity equations. The algorithm makes use of techniques and notation from the theory of Lie groups and Lie algebras, which is reviewed briefly. One of the strengths of our formulation is the ability to easily differentiate the dynamics algorithm with respect to parameters of interest. We demonstrate one important use of our dynamics and sensitivity algorithms by using them to solve difficult optimal control problems for underactuated systems. The algorithms in this paper have been implemented in a software package named Cstorm (Computer simulation tool for the optimization of robot manipulators), which runs from within Matlab and Simulink. It can be downloaded from the website http://www.eng.uci.edu/ bobrow/ @DOI: 10.1115/1.1376121#