Configuration control of seven-degree-of-freedom arms

A seven degree of freedom robot arm with a six degree of freedom end effector is controlled by a processor employing a 6 by 7 Jacobian matrix for defining location and orientation of the end effector in terms of the rotation angles of the joints, a 1 (or more) by 7 Jacobian matrix for defining 1 (or more) user specified kinematic functions constraining location or movement of selected portions of the arm in terms of the joint angles, the processor combining the two Jacobian matrices to produce an augmented 7 (or more) by 7 Jacobian matrix, the processor effecting control by computing in accordance with forward kinematics from the augmented 7 by 7 Jacobian matrix and from the seven joint angles of the arm a set of seven desired joint angles for transmittal to the joint servo loops of the arm. One of the kinematic functions constraints the orientation of the elbow plane of the arm. Another one of the kinematic functions minimizes a sum of gravitational torques on the joints. Still another kinematic function constrains the location of the arm to perform collision avoidance. Generically, one kinematic function minimizes a sum of selected mechanical parameters of at least some of the joints associated with weighting coefficients which may be changed during arm movement. The mechanical parameters may be velocity errors or gravity torques associated with individual joints

An on-line path planner for industrial manipulators

In this paper, an on-line path planner for an industrial manipulator is presented. The proposed control architecture is capable of driving the manipulator in its environment while avoiding collisions. Potential fields are used in order to control the joint velocities in such a way that the robot avoids the obstacles. We also propose a new weighted pseudoinverse matrix that improves the manipulator capability of finding feasible paths to move around obstacles and pass through narrow corridors without relying on the manipulator dynamic model. The proposed technique fits to both redundant and non-redundant manipulators. Experimental results show the effectiveness of the proposed solution

Efficient Sub-Optimal Inverse Kinematic Solution for Redundant Manipulators

Master'sMASTER OF ENGINEERIN

Dynamic Active Constraints for Surgical Robots using Vector Field Inequalities

Robotic assistance allows surgeons to perform dexterous and tremor-free procedures, but robotic aid is still underrepresented in procedures with constrained workspaces, such as deep brain neurosurgery and endonasal surgery. In these procedures, surgeons have restricted vision to areas near the surgical tooltips, which increases the risk of unexpected collisions between the shafts of the instruments and their surroundings. In this work, our vector-field-inequalities method is extended to provide dynamic active-constraints to any number of robots and moving objects sharing the same workspace. The method is evaluated with experiments and simulations in which robot tools have to avoid collisions autonomously and in real-time, in a constrained endonasal surgical environment. Simulations show that with our method the combined trajectory error of two robotic systems is optimal. Experiments using a real robotic system show that the method can autonomously prevent collisions between the moving robots themselves and between the robots and the environment. Moreover, the framework is also successfully verified under teleoperation with tool-tissue interactions.Comment: Accepted on T-RO 2019, 19 Page

Collision-free path planning for robots using B-splines and simulated annealing

This thesis describes a technique to obtain an optimal collision-free path for an automated guided vehicle (AGV) and/or robot in two and three dimensions by synthesizing a B-spline curve under geometric and intrinsic constraints. The problem is formulated as a combinatorial optimization problem and solved by using simulated annealing. A two-link planar manipulator is included to show that the B-spline curve can also be synthesized by adding kinematic characteristics of the robot. A cost function, which includes obstacle proximity, excessive arc length, uneven parametric distribution and, possibly, link proximity costs, is developed for the simulated annealing algorithm. Three possible cases for the orientation of the moving object are explored: (a) fixed orientation, (b) orientation as another independent variable, and (c) orientation given by the slope of the curve. To demonstrate the robustness of the technique, several examples are presented. Objects are modeled as ellipsoid type shapes. The procedure to obtain the describing parameters of the ellipsoid is also presented