A simplified inverse dynamics modelling method for a novel rehabilitation exoskeleton with parallel joints and its application to trajectory tracking (Q2298451)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A simplified inverse dynamics modelling method for a novel rehabilitation exoskeleton with parallel joints and its application to trajectory tracking |
scientific article; zbMATH DE number 7170855
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A simplified inverse dynamics modelling method for a novel rehabilitation exoskeleton with parallel joints and its application to trajectory tracking |
scientific article; zbMATH DE number 7170855 |
Statements
A simplified inverse dynamics modelling method for a novel rehabilitation exoskeleton with parallel joints and its application to trajectory tracking (English)
0 references
20 February 2020
0 references
Summary: In this paper, a new modular upper limb rehabilitation exoskeleton, which is actuated by a parallel mechanical structure, is designed to help stroke patients. For analysing the relationship between motor torque and joint torque of the novel exoskeleton, a conversion algorithm mapping motor motion to joint motion is developed here. Then, to simplify the dynamics model of exoskeleton with parallel actuated joints, the serial equivalence configuration dynamics of the exoskeleton is established to be equivalent to the parallel joints dynamics. Afterwards, a torque controller used for our exoskeleton is designed based on the proposed conversion algorithm and the inverse dynamics of exoskeleton. It should be noted that the controller mentioned above combines both conversion algorithm and joint position decoupling. At last, for verifying the effectiveness of the proposed algorithms, a trajectory tracking simulation is given, and the simulated results show the proposed algorithms are valid.
0 references
0.7225414514541626
0 references
0.7088084816932678
0 references
0.6974273920059204
0 references