US5159249A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for controlling robot motion at and near singularities and for robot mechanical design
Assignee: Individual
•
Filing: 1990-03-21
•
Granted: 1992-10-27
•
Expires: 2010-03-21
Abstract
Abstract This invention relates to the field of computer controlled robotics. More specifically, it relates to a novel method and algorithm to symbolically decompose the robot jacobian matrix, in such a way that the robot jacobian Moore-Penrose pseudo-inverse is obtained symbolically even when the robot jacobian is ill conditioned or rank deficient, and to a general purpose computer and method to perform the symbolic steps. The resulting symbolic pseudo-inverse, after symbolic reduction techniques, is not only efficient from the point of view of number of floating point operations, but is also accurate (exact) and stable. It removes the restrictions imposed by the computational complexity of the jacobian pseudo-inverse, especially when the robot jacobian is ill conditioned (robot near/at singularities). This method is sufficiently fast to allow real time control of the robot and is sufficiently stable to allow good robot performance near singularities. In addition, the method presented in this invention is of special importance for the future design of prototypes of robot manipulators, as well as for robot trajectory planning.
Inventors
- 👤 Dalila Megherbi
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-03 13:26
CPC Classifications
B; B25; B25J; B25J9/00; B25J9/16; B25J9/1656; B25J9/1664; B25J9/1602; B25J9/1607
Claims Analysis
Total Claims: 14
Claim 1
Independent Claim
168 words
A method for controlling motion of a robot which is capable of moving through and near singularities, given a corresponding robot Jacobian matrix, comprising the method steps: symbolically computing a robot Jacobian pseudo-inverse matrix for the robot Jacobian matrix, even when the Jacobian is rank deficient; sensing a set of data representative of a current joint configuration of the robot; computing a set of MMD (Megherbi Matrix Decomposition) diagonal values from the Jacobian pseudo-inverse matrix, based upon the sensed set of data, determining, from the sensed set of data, a minimum allowable MMD diagonal value, for each of said MMD diagonal value which is less than the determined minimum MMD diagonal value, substituting zero for the reciprocal of each such value occurring in the robot Jacobian pseudo-inverse matrix, thereby permitting robot motion only in allowable physical directions; computing a set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot; and moving the robot in response to the set of control signals.
Claim 2
Independent Claim
168 words
A method for controlling motion of a robot which is capable of moving through and near singularities, given a corresponding robot Jacobian matrix, comprising the method steps: symbolically computing a robot Jacobian pseudo-inverse matrix for the robot Jacobian matrix, even when the Jacobian is rank deficient; sensing a set of data representative of a current joint configuration of the robot; computing a set of MMD (Megherbi Matrix Decomposition) diagonal values from the Jacobian pseudo-inverse matrix, based upon the sensed set of data, determining, from the sensed set of data, a minimum allowable MMD diagonal value, for each of said MMD diagonal value which is less than the determined minimum MMD diagonal value, substituting zero for the reciprocal of each such value occurring in the robot Jacobian pseudo-inverse matrix, thereby permitting robot motion only in allowable physical directions; computing a set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot; and moving the robot in response to the set of control signals.
Claim 3
Dependent Claim
69 words
The method for controlling motion of a robot according to claim 1, wherein the step of computing the set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot further includes determining a Cartesian speed at which the robot is to be moved at each point of its motion such that a maximum joint velocity physically realizable by the robot is not exceeded.
Claim 4
Dependent Claim
57 words
The method for controlling motion of a robot according to claim 1, wherein the step of computing the set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot further includes determining a maximum Cartesian speed at which the robot is to be moved for a given constant robot joint velocity.
Claim 5
Dependent Claim
67 words
The method for controlling motion of a robot according to claim 1, wherein the step of computing the set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot further includes determining a maximum Cartesian acceleration at which the robot is to be moved at each point of its motion such that a maximum joint actuator torque limit is not exceeded.
Claim 6
Dependent Claim
71 words
The method for controlling motion of a robot according to claim 1, wherein the step of computing the set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot further includes damping and reducing robot joint velocities such that maximum joint velocities physically realizable by the robot are not exceeded, without decreasing a rate of convergence of the method of controlling robot motion near singularities.
Claim 7
Dependent Claim
68 words
The method for controlling motion of a robot according to claim 1, wherein the step of computing the set of control signals from the robot Jacobian pseudo-inverse matrix for controlling further motion of the robot further includes damping and reducing robot joint velocities such that maximum joint actuator torque limits are not exceeded, without decreasing a rate of convergence of the method of controlling robot motion near singularities.
Claim 8
Dependent Claim
186 words
A robot which is capable of moving through and near singularities, given a corresponding robot Jacobian matrix, comprising: sensing means for sensing a set of data representative of a current joint configuration of the robot; processing means for providing a set of control signals for controlling motion of the robot comprising: memory means for storing a symbolically computed robot Jacobian pseud-inverse matrix for the robot Jacobian matrix, even when the Jacobian is rank deficient; computing means responsive to the sensing means and memory means for computing a set of MMD (Megherbi Matrix Decomposition) diagonal values from the Jacobian pseudo-inverse matrix; determining means responsive to the sensing means for determining a minimum allowable MMD diagonal value; substituting means for substituting zero for the reciprocal of each of said MMD diagonal value occurring in the robot Jacobian pseudo-inverse matrix which is less than the determined minimum MMD diagonal value, thereby permitting robot motion only in allowable physical directions; and control means for computing the set of control signals from the robot Jacobian pseudo-inverse matrix; and means for moving the robot in response to the set of control signals.
Claim 9
Dependent Claim
186 words
A robot which is capable of moving through and near singularities, given a corresponding robot Jacobian matrix, comprising: sensing means for sensing a set of data representative of a current joint configuration of the robot; processing means for providing a set of control signals for controlling motion of the robot comprising: memory means for storing a symbolically computed robot Jacobian pseud-inverse matrix for the robot Jacobian matrix, even when the Jacobian is rank deficient; computing means responsive to the sensing means and memory means for computing a set of MMD (Megherbi Matrix Decomposition) diagonal values from the Jacobian pseudo-inverse matrix; determining means responsive to the sensing means for determining a minimum allowable MMD diagonal value; substituting means for substituting zero for the reciprocal of each of said MMD diagonal value occurring in the robot Jacobian pseudo-inverse matrix which is less than the determined minimum MMD diagonal value, thereby permitting robot motion only in allowable physical directions; and control means for computing the set of control signals from the robot Jacobian pseudo-inverse matrix; and means for moving the robot in response to the set of control signals.
Claim 10
Dependent Claim
46 words
A robot according to claim 7, wherein the control means further comprises means for determining a Cartesian speed at which the robot is to be moved at each point of its motion such that a maximum joint velocity physically realizable by the robot is not exceeded.
Claim 11
Dependent Claim
34 words
A robot according to claim 7, wherein the control means further comprises means for determining a maximum Cartesian speed at which the robot is to be moved for a given constant robot joint velocity.
Claim 12
Dependent Claim
44 words
A robot according to claim 7, wherein the control means further comprises means for determining a maximum Cartesian acceleration at which the robot is to be moved at each point of its motion such that a maximum joint actuator torque limit is not exceeded.
Claim 13
Dependent Claim
58 words
A robot according to claim 7, wherein the processing means further comprises means for damping and reducing robot joint velocities such that maximum joint velocities physically realizable by the robot are not exceeded, without decreasing a rate of convergence of the processing means for providing the set of control signals for controlling motion of the robot near singularities.
Claim 14
Dependent Claim
55 words
A robot according to claim 7, wherein the processing means further comprises means for damping and reducing robot joint velocities such that maximum joint actuator torque limits are not exceeded, without decreasing a rate of convergence of the processing means for providing the set of control signals for controlling motion of the robot near singularities.
References Cited (Backward Citations)
US4362977A
Cited
US4594671A
Cited
US4604716A
Cited
US4794547A
Cited
US4680519A
Cited
US4823279A
Cited
US4763276A
Cited
US4853874A
Cited
US4860215A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1995-10-27 | 1996-04-27 | 1996-10-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1999-10-27 | 2000-04-27 | 2000-10-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2003-10-27 | 2004-04-27 | 2004-10-27 | $7700.00 | Window Closed / Lapsed |