Exact decoupling of the force-position control using the operational space formulation

Author(s):  
B. Bona ◽  
M. Indri
2013 ◽  
Vol 765-767 ◽  
pp. 1920-1923
Author(s):  
Li Jiang ◽  
Yang Zhou ◽  
Bin Wang ◽  
Chao Yu

A novel approach to impedance control based on the object is proposed to control dual-arm systems with senseless force. Considering the motion of the object, the statics and dynamics of the dual-arm systems are modeled. Extending the dynamics of dual-arm system and the impedance of object to the operational space, impedance control with senseless force is presented. Simulations on a dual-arm system are carried out to demonstrate the performance of the proposed control scheme. Comparing with position control, results of numerical simulations show that the proposed scheme realizes suitable compliant behaviors in terms of the object, and minimizes the error of the relative position between the manipulators even without force sensors.


Author(s):  
Kishor D. Bhalerao ◽  
James Critchley ◽  
Denny Oetomo ◽  
Roy Featherstone ◽  
Oussama Khatib

This paper presents a new parallel algorithm for the operational space dynamics of unconstrained serial manipulators, which outperforms contemporary sequential and parallel algorithms in the presence of two or more processors. The method employs a hybrid divide and conquer algorithm (DCA) multibody methodology which brings together the best features of the DCA and fast sequential techniques. The method achieves a logarithmic time complexity (O(log(n)) in the number of degrees of freedom (n) for computing the operational space inertia (Λe) of a serial manipulator in presence of O(n) processors. The paper also addresses the efficient sequential and parallel computation of the dynamically consistent generalized inverse (J¯e) of the task Jacobian, the associated null space projection matrix (Ne), and the joint actuator forces (τnull) which only affect the manipulator posture. The sequential algorithms for computing J¯e, Ne, and τnull are of O(n), O(n2), and O(n) computational complexity, respectively, while the corresponding parallel algorithms are of O(log(n)), O(n), and O(log(n)) time complexity in the presence of O(n) processors.


2005 ◽  
Vol 19 (5) ◽  
pp. 613-634 ◽  
Author(s):  
Rodrigo S. Jamisola ◽  
Denny N. Oetomo ◽  
Marcelo H. Ang ◽  
Oussama Khatib ◽  
Tao Ming Lim ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document