Manipulation of branching graphic structures using inverse kinematics

Claim 2

A computer-implemented method of manipulating a graphic structure from an initial configuration towards a goal configuration, the graphic structure comprising a root block having a root, and at least two branch blocks each having an end effector, the method comprising: deriving, in a succession of iterations of inverse kinematics computations, an update configuration positioning the end effectors closer to corresponding goal positions than in a prior configuration; and in at least one inverse kinematics computational iteration, deriving an update configuration by reducing a computational effect of the root block on an end effector of a branch block.

Claim 3

The method of claim 1 further comprising assigning the updated configuration as the goal configuration if the updated configuration satisfies a termination criterion.

Claim 4

The method of claim 2 further comprising determining an error value for the updated configuration reflecting the difference between the updated configuration and the goal configuration, wherein the termination criterion is met if the error value of the updated configuration indicates that the difference is less than a threshold error value.

Claim 5

The method of claim 2 further comprising determining an error value for the updated configuration reflecting the difference between the updated configuration and the goal configuration, wherein the termination criterion is met if the error value of the updated configuration indicates that the difference is the minimum possible difference.

Claim 6

The method of claim 1, wherein the first inverse kinematics computational iteration derives the update configuration by reducing the computational effect of the root block on an end effector of a branch block.

Claim 7

The method of claim 1 wherein the root block and the branch blocks each comprises one or more non-branching joints.

Claim 8

The method of claim 1 wherein the graphic structure comprises a recursive branching structure having at least one additional branch block that branches from one of the other branch blocks.

Claim 9

The method of claim 7 further comprising deriving, in at least one inverse kinematics computational iteration, an update configuration for the at least one additional branch block by reducing a computational effect of an immediately preceding branch block on the at least one additional branch block.

Claim 10

A memory device storing computer-readable instructions for aiding a computer to manipulate a graphic structure from an initial configuration towards a goal configuration, the graphic structure comprising a root block having a root, and at least two branch blocks each having an end effector, the instructions comprising: instructions for deriving, in a succession of iterations of inverse kinematics computations, an update configuration positioning the end effectors closer to corresponding goal positions than in a prior configuration; and instructions for deriving, in at least one inverse kinematics computational iteration, an update configuration by reducing a computational effect of a root block on an end effector of a branch block.

Claim 11

A memory device storing computer-readable instructions for aiding a computer to manipulate a graphic structure from an initial configuration towards a goal configuration, the graphic structure comprising a root block having a root, and at least two branch blocks each having an end effector, the instructions comprising: instructions for deriving, in a succession of iterations of inverse kinematics computations, an update configuration positioning the end effectors closer to corresponding goal positions than in a prior configuration; and instructions for deriving, in at least one inverse kinematics computational iteration, an update configuration by reducing a computational effect of a root block on an end effector of a branch block.

Claim 12

The memory device of claim 9 further comprising instructions for assigning the updated configuration as the goal configuration if the updated configuration satisfies a termination criterion.

Claim 13

The memory device of claim 10 further comprising instructions for determining an error value for the updated configuration reflecting the difference between the updated configuration and the goal configuration, wherein the termination criterion is met if the error value of the updated configuration indicates that the difference is less than a threshold error value.

Claim 14

The memory device of claim 10 further comprising instructions for determining an error value for the updated configuration reflecting the difference between the updated configuration and the goal configuration, wherein the termination criterion is met if the error value of the updated configuration indicates that the difference is the minimum possible difference.

Claim 15

The memory device of claim 9, further comprising instructions for deriving, in the first inverse kinematics computational iteration, the update configuration by reducing the computational effect of a root block on an end effector of a branch block.

Claim 16

The memory device of claim 9 wherein the root block and the branch blocks each comprises one or more non-branching joints.

Claim 17

The memory device of claim 9 wherein the graphic structure comprises a recursive branching structure having at least one additional branch block that branches from one of the other branch blocks.

Claim 18

The memory device of claim 15 further comprising instructions to derive, in at least one inverse kinematics computational iteration, an update configuration for the at least one additional branch block by reducing a computational effect of an immediately preceding branch block on the at least one additional branch block.

Claim 19

A computer-implemented method of using inverse kinematics computations to manipulate a graphic structure from an initial configuration towards a coal configuration, the graphic structure comprising a root block having a root, and at least two branch blocks, the method comprising: deriving an approximation of the goal position by reducing a computational effect of the root block on a branch block, wherein the graphic structure comprises a recursive branching structure having at least one additional branch block that branches from one of the other branch blocks; and deriving, in at least one inverse kinematics computational iteration, an update configuration for the at least one additional branch block by reducing a computational effect of an immediately preceding branch block on the at least one additional branch block.

Claim 20

A computer-implemented method of using inverse kinematics computations to manipulate a graphic structure from an initial configuration towards a coal configuration, the graphic structure comprising a root block having a root, and at least two branch blocks, the method comprising: deriving an approximation of the goal position by reducing a computational effect of the root block on a branch block, wherein the graphic structure comprises a recursive branching structure having at least one additional branch block that branches from one of the other branch blocks; and deriving, in at least one inverse kinematics computational iteration, an update configuration for the at least one additional branch block by reducing a computational effect of an immediately preceding branch block on the at least one additional branch block.

Claim 21

The method of claim 17 further comprising, in a subsequent inverse kinematics computation, adjusting the approximation of the goal position by using the computational effect of the root block on the branch block.

Claim 22

The method of claim 18 further comprising repeating the adjustment until the goal configuration is achieved.

Claim 23

The method of claim 17 wherein reducing the computational effect of the root block comprises zeroing non-diagonal terms in a computational matrix.

Claim 24

The method of claim 17 wherein the root block and the branch blocks each comprises one or more non-branching joints.

Claim 25

The method of claim 17 wherein at least one of the branch blocks comprises an end effector.