Closed-form kinematics

• US 5,043,929 A
• Filed: 06/13/1989
• Issued: 08/27/1991
• Est. Priority Date: 06/13/1989
• Status: Expired due to Fees

• Current Assignee: Schlumberger Technologies Incorporated (Schlumberger NV)
• Original Assignee: Schlumberger Technologies Incorporated (Schlumberger NV)
• Inventors: Agre, Philip E., Kramer, Glenn A., Barrow, Harry G.
• Primary Examiner(s): Lall, Parshotam S.
• Assistant Examiner(s): Ramirez, Ellis B.
• Application Number:
  US07/365,627
• Time in Patent Office: 805 Days
• Field of Search: 364/578, 364/200, 364/900, 364/300, 364/513, 364/191, 364/512, 364/474.24
• US Class Current: 703/1
• CPC Class Codes: G06F 30/17 Mechanical parametric or variational design

Abstract

A method and apparatus for performing kinematic analysis of linkages is disclosed. Generalized mechanisms are selected from a catalog of mechanisms. From an initial selection of mechanisms, the one most closely matching a desired behavior is chosen and an optimization procedure is conducted. The method may be preceded by a qualitative kinematic analysis or the qualitative analysis may be used in lieu of a catalog selection. An improved optimization technique is disclosed, along with a closed form kinematic analysis method.

Claims

1. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information, said topological and geometric information further comprising a plurality of kinematic constraints;

b) using said stored information to generate an assembly procedure for at least partially assembly a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, said computer representations simulating position and orientation of parts of said linkage during motion of said linkage.

2. The method as recited in claim 1, wherein the method uses single precision arithmetic.

3. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said topological stored information further comprises joint type, link length, link shape, and location of joints on links.

4. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said geometric information further comprises a series of generalized rules.

5. The method as recited in claim 4, wherein said generalized rules are selected from the group rules for inferring marker constraints, rules for constructing displaced marker constraints, rules for intersecting and reducing constrained markers, rules for propagating constraints across joints, rules for inferring that a link is known, rules for moving links to satisfy new constraints while preserving existing constraints, and combinations thereof.

6. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembly a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure;

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input; and

e) supplying a binary configuration parameter, said binary configuration parameter resolving an ambiguity in assembly of at least one pair of links.

7. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure;

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input; and

e) supplying a vector of binary configuration parameters, said vector resolving ambiguities in assembly of the linkage.

8. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein the step of iteratively using said assembly procedure is used to evaluate an error function, said error function representing a departure from a desired behavior of the linkage.

9. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein the error function is used to substantially optimize said linkage.

10. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said digital computer is programmed in a LISP language.

11. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said stored information is in the form of a database, said database comprising a set of propositions said propositions defining at least markers associated with links of said linkage.

12. The method as recited in claim 11, wherein said propositions are generated by said generalized rules.

13. The method as recited in claim 11, wherein said propositions comprise open and closed predicates, said closed predicates remaining constant during said step of generating, said open predicates encoding items of partial knowledge that is being incrementally inferred.

18. The method as recited in claim 11, wherein said propositions may only be asserted into a database during generation of said assembly procedure.

19. The method as recited in claim 11, wherein a pattern matcher determines if a generalized rule matches an entry in a database during generation of said assembly procedure, said database comprising a set of propositions, said propositions defining at least markers associated with links of said linkage, said pattern matcher matching propositions which share predicates.

20. The method as recited in claim 19, wherein said generalized rules are preferentially applied when a predicate on which they depend has been previously asserted into said database.

14. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure;

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input;

e) storing location constraints of at least two markers; and

f) intersecting said constraints in said assembly procedure.

15. The method as recited in claim 14, wherein the step of intersecting is a step of intersecting a member of the group circles, spheres, planes, cylinders, ellipses, helixes, cycloids, and lines with a member of the group circles, spheres, planes, cylinders, ellipses, helixes, cycloids, and lines.

16. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteriatively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein a link is assumed to be known when the position of three markers on a link are known;

when the position, alignment, and orientation of one marker on a link are known;

when the position of one marker is known and the position and alignment of another marker is known;

when the position and alignment of one marker are known and the alignment of a second marker is known;

or where the position of two non-alignable markers are known and there is no third marker.

43. The method as recited in claim 16, wherein the linkage compiler terminates when all of the links in said linkage are assumed to be known.

17. In a digital computer, a method of performing a kinematic analysis of a linkage comprising the steps of:

a) storing linkage information for members of a linkage said information comprising topological and geometric information;

b) using said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively using said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein a pattern matcher determines if a generalized rule matches an entry in a database.

21. Apparatus for simulating kinematic behavior of a linkage comprising:

a) a digital computer programmed to;

i) store linkage information for members of a linkage, said information comprising topological and geometric information, said topological and geometric information further comprising a plurality of kinematic constraints;

ii) process said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage;

iii) store said assembly procedure; and

iv) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, said computer representations simulating position and orientation of parts of said linkage during motion of said linkage; and

b) means for displaying said linkage using at least one of said computer representations.

22. Apparatus as recited in claim 21, wherein said digital computer operates in a single precision mode.

23. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information, said topological and geometric information further comprising a plurality of kinematic constraints;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, said computer representations simulating position and orientation of parts of said linkage during motion of said linkage.

24. The computer as recited in claim 23, wherein the computer uses single precision arithmetic.

38. The computer as recited in claim 23 wherein said assembly procedure terminates when the position of three markers on a link are known;

when the position, alignment, and orientation of one marker on a link are known;

when the position of one marker is known and the position and alignment of another marker is known;

when the position and alignment of one marker are known and the alignment of a second marker is known;

or where the position of two non-alignable markers are known and there is no third marker.

39. The computer as recited in claim 23, further comprising a pattern matcher to determine if a generalized rule matches an entry in a database.

25. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said topological stored information further comprises joint type, link length, link shape, and location of joints on links.

26. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said geometric information further comprises a series of generalized rules.

27. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said generalized rules are selected from the group rules for inferring marker constraints, rules for constructing displaced marker constraints, rules for intersecting and reducing constrained markers, rules for propagating constraints across joints, rules for inferring that a link is known, rules for moving links to satisfy new constraints while preserving existing constraints, and combinations thereof.

28. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said computer is further programmed to input binary configuration parameter, said binary configuration parameter resolving an ambiguity in assembly of at least one pair of links.

29. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said computer is further programmed to supply a vector of binary configuration parameters, said vector resolving ambiguities in assembly of the linkage.

30. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said computer is further programmed to iteratively use said assembly procedure to evaluate an error function, said error function representing a departure from a desired behavior of the linkage.

31. The computer as recited in claim 30 wherein the error function is used to substantially optimize said linkage.

32. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said computer is programmed in a LISP language.

33. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said stored information is in the form of a database, said database comprising a set of propositions said propositions defining at least markers associated with links of said linkage.

40. The computer as recited in claim 33, wherein said propositions may only be asserted into a database during generation of said assembly procedure.

41. The computer as recited in claim 33, wherein a pattern matcher determines if a generalized rule matches an entry in a database during generation of said assembly procedure, said database comprising a set of propositions, said propositions defining at least markers associated with links of said linkage, said pattern matcher matching propositions which share predicates.

42. The computer as recited in claim 41, wherein said generalized rules are preferentially applied when a predicate on which they depend has been previously asserted into said database.

34. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said propositions are generated by said generalized rules.

35. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said propositions comprise open and closed predicates, said closed predicates remaining constant during said step of generating, said open predicates encoding items of partial knowledge that is being incrementally inferred.

36. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, wherein said computer is further programmed to;

i) store location constraints of at least two markers; and

(ii) intersect said constraints in said assembly procedure.

37. A digital computer for kinematic analysis of a linkage programmed to:

a) store linkage information for members of a linkage said information comprising topological and geometric information;

b) use said stored information to generate an assembly procedure for at least partially assembling a computer representation of said linkage, said assembly procedure comprising a plurality of assembly rules for said linkage;

c) storing said assembly procedure; and

d) iteratively use said assembly procedure to at least partially assemble computer representations of said linkage in response to at least one driving input, further comprising a pattern matcher to determine if a generalized rule matches an entry in a database.