2009-02-11 Created initial document 2009-03-29 Due to the singularity tests picking up false positives for unsolvable chains, removed tests (reverted to standard CCD) and updated section on local minima.
| Cyclic Coordinate Descent in 2D |
|
|
| Wednesday, 11 February 2009 04:43 | ||||||||
Page 1 of 5
CCD solves the IK problem through optimization. Looping through the joints from end to root, we optimize each joint to get the end effector (tip of the final joint) as close to our target as possible. This is loop is then repeated until we find a solution or we reach an iteration limit. You can download the RJ_Demo_IK application and source code to see an interactive implementation.
You might also be interested in the following articles on different IK solvers:
Changelog
|
||||||||
| Last Updated ( Sunday, 02 May 2010 06:28 ) | ||||||||


When performing 