|How *much* you posted, bitches
|Page 5 of 5|
|Author:||Damian [ Sun Feb 06, 2005 12:27 pm ]|
Hi! Thanks for answer. Yes I almost solved the problem. It can takes me maybe still a few hours but I'm near to the solution. I used a cosine right(?) (I'm not sure of the name ) a*a = b*b + c*c - 2*b*c*cos(alpha). It works quite well.
|Author:||RB [ Sun Feb 06, 2005 2:25 pm ]|
Ok. Just idea. I don't know where you are with math so ask if something is unclear.
You know where robot's hand is and the current angle of it in comparing with something (x,y,z,alpha). And you know where robot should go (x1,y1,z1,alpha1).
What you need to do is just to assume that robot is rotated in the right direction and the hand is in (x1,y1,z1,alpha1). Then you can calculate position of its other end. And then is easy to determine if remaining two segments can or cannot make the requested position. In the most of cases you'll have only one solution.
I suggest you to do all calculations in the plane where all segments are. You need only the angles between the segments so you won't need to turn back to 3d.
|Page 5 of 5||All times are UTC - 6 hours|
|Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group