SLIDE 8 Problem formulation
Polynomial optimization problem
◮ Polynomial optimization problem equivalent to the original optimization problem: min
c∈−1,17, s∈−1,17 ||c − 1||2
s.t. pj(c, s) = 0 (j = 1, . . . , 12) qi(c, s) = 0 (i = 1, . . . , 7) −(ci + 1) tan θLow
i
2
+ si ≥ 0 (i = 1, . . . , 7) (ci + 1) tan θHigh
i
2
− si ≥ 0 (i = 1, . . . , 7) (9) ◮ In 14 variables (c and s). ◮ Contains polynomials up to degree four. ◮ When solved, θ are recovered from c and s by function atan2.
- P. Trutman, M. Safey El Din, D. Henrion, T. Pajdla
Globally Optimal Solution to IK of 7DOF Manipulator IMPACT seminar 7 / 16