Name
Abstract | ||
|---|---|---|
To solve the inverse kinematics problem in symbolic form it is necessary to determine the roots of so-called sine-cosine-polynomials (SC-polynomials). A functional decomposition of an SC-polynomial reduces this task to the solution of two equations of degree less than or equal to half of the original degree. Thus, decompositions can significantly improve symbolic solutions of the inverse kinematics problem. An earlier algorithm only detects a special type of decomposition, is of exponential complexity, and fails for complicated kinematical problems. The algorithm presented here finds all decompositions and reduces the complexity by magnitudes, thus satisfying all needs in kinematics. The algorithm is applicable as well to symbolic solutions of the direct position problem of parallel manipulators. By combination with the so-called specialized analysis technique, it is possible to scan all different symbolic solutions of any manipulator and to determine the particular solution that allows a maximum decomposition. This is an important step toward finding optimal symbolic solutions for kinematic equation systems |
Year | DOI | Venue |
|---|---|---|
1993 | 10.1109/ROBOT.1993.292103 | Atlanta, GA |
Keywords | Field | DocType |
computational complexity,inverse problems,kinematics,polynomials,robots,symbol manipulation,SC-polynomial,complexity,direct position problem,fast functional decomposition,inverse kinematics problem,parallel manipulators,roots,sine-cosine-polynomials,specialized analysis technique,symbolic solution | Applied mathematics,Mathematical optimization,Kinematics equations,Kinematics,Inverse kinematics,Polynomial,Control theory,Functional decomposition,Inverse problem,Method of undetermined coefficients,Mathematics,Computational complexity theory | Conference |
Citations | PageRank | References |
1 | 0.39 | 1 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Péter Kovács | 1 | 1 | 0.39 |
| Günter Hommel | 2 | 657 | 134.35 |