void KChainOrientationBodySchema::Jacobian(Matrix& jac){
Matrix mat(joint_angle_dim,6);
GetFullJacobian(mat.Array());
mat.Transpose(jac); // different storing convention in mathlib.h
// jac.Print();
}
bool GeneralIK::_SolveTransThenRot(std::vector<dReal>& q_s)
{
if(bPRINT)
RAVELOG_INFO("Solving...\n");
//clear from previous run
_numitr = 0;
badjointinds.resize(0);
prev_error = 1000000.0;
//initialize stepsize and epsilon
maxstep = 0.1*_targtms.size();
stepsize = maxstep;
epsilon = 0.001;
bClearBadJoints = true; //setting this to true will make the algorithm attempt to move joints that are at joint limits at every iteration
if(bDRAW)
{
for(int i = 0; i < _targmanips.size();i++)
{
GetEnv()->plot3( &(DoubleVectorToFloatVector(_targtms[i].trans)[0]), 1, 0, 5, Vector(0,1,0) );
}
}
bBalanceGradient = false;
Vector perpvec;
//while(1)
for(int kk = 0; kk < 3000; kk++)
{
_numitr++;
bLimit = false;
_pRobot->SetActiveDOFValues(q_s);
if(bWRITETRAJ)
{
for(int i = 0; i < _pRobot->GetActiveDOF(); i++)
{
_trajpoint.q[i] = q_s[i];
}
ptraj->AddPoint(_trajpoint);
}
for(int i = 0; i < _targmanips.size();i++)
{
_pRobot->SetActiveManipulator(_targmanips[i]);
_curtms[i] = _pRobot->GetActiveManipulator()->GetEndEffectorTransform();
//since doing only translation, trick the solver into thinking it has achieved correct rotation
_curtms[i].rot = _targtms[i].rot;
if(bDRAW)
GetEnv()->plot3( &(DoubleVectorToFloatVector(_curtms[i].trans)[0]), 1, 0, 5, Vector(1,0,0) );
}
x_error = TransformDifferenceVectorized(dx.Store(),_targtms,_curtms);
if(bPRINT)
PrintMatrix(dx.Store(),1,dx.Nrows(),"dx: ");
if(bPRINT)
RAVELOG_INFO("x error: %f\n",x_error);
//if balance stuff is on, error will go up sometimes, so don't do this check
if(!bBalance && (x_error >= prev_error || (prev_error - x_error < epsilon/10))&& x_error > epsilon)
{
if(bPRINT)
{
RAVELOG_INFO("no progress\n");
RAVELOG_INFO("prev: %f x_err: %f limit %d\n",prev_error,x_error,(int)bLimit);
}
stepsize = stepsize/2;
x_error = prev_error;
q_s = q_s_old;
}
else
stepsize = maxstep;
if(bPRINT)
RAVELOG_INFO("stepsize: %f\n",stepsize);
//don't let step size get too small
if(stepsize < epsilon)
{
//RAVELOG_INFO("Projection stalled _numitr: %d\n",_numitr);
return false;
}
if(bClearBadJoints)
{
badjointinds.resize(0);
}
do{
q_s_old = q_s;
if(bLimit == false)
prev_error = x_error;
if(bBalance)
{
GetCOGJacobian(Transform(),Jtemp2,curcog);
}
if(x_error < epsilon && (!bBalance || CheckSupport(curcog)))
{
if(bPRINT)
RAVELOG_INFO("Translation component projection successfull _numitr: %d\n",_numitr);
return _SolveStopAtLimits(q_s);
}
//only need to compute the jacobian once if there are joint limit problems
if(bLimit == false)
{
for(int i = 0; i < _targmanips.size();i++)
{
_pRobot->SetActiveManipulator(_targmanips[i]);
GetFullJacobian(_curtms[i],_targtms[i],Jtemp);
Jtrans.Rows(i*3 +1,(i+1)*3) = Jtemp.Rows(1,3);
dx_trans.Rows(i*3 +1,(i+1)*3) = dx.Rows(1,3);
}
if(bBalance)
{
//the cog jacobian should only be 2 dimensional, b/c we don't care about z
GetCOGJacobian(Transform(),Jtemp2,curcog);
if(!CheckSupport(curcog))
{
bBalanceGradient = true;
balancedx[0] = (curcog.x - cogtarg.x);
balancedx[1] = (curcog.y - cogtarg.y);
}
else
{
balancedx[0] = 0;
balancedx[1] = 0;
bBalanceGradient = false;
}
}
}
//eliminate bad joint columns from the Jacobian
for(int j = 0; j < badjointinds.size(); j++)
for(int k = 0; k < _numtransdims; k++)
Jtrans[k][badjointinds[j]] = 0;
if(bBalance)
{
for(int j = 0; j < badjointinds.size(); j++)
for(int k = 0; k <2; k++)
Jtemp2[k][badjointinds[j]] = 0;
}
if(x_error > stepsize)
magnitude = stepsize/x_error;
else
magnitude = 1;
//NEWMAT::DiagonalMatrix Weights;
//Weights.ReSize(_numdofs);
//Weights = 1;
//J = J * Weights;
//PrintMatrix(J.Store(),_numtargdims,_numdofs,"J: ");
NEWMAT::DiagonalMatrix Reg(_numtransdims);
Reg = 0.0001;
M << (Jtrans*Jtrans.t()) + Reg;
//PrintMatrix(J.Store(),_numtargdims,_numtargdims,"M: ");
invConditioningBound(100,M,Minv);
//Minv = M.i();
//PrintMatrix(Minv.Store(),_numtargdims,_numtargdims,"Minv: ");
Jplus = Jtrans.t()*Minv;
if(bBalanceGradient)
{
Mbal << (Jtemp2*Jtemp2.t());
invConditioningBound(100,Mbal,Mbalinv);
//do ik, then move toward balance in null space
step = magnitude*Jplus*(dx_trans) + (NEWMAT::IdentityMatrix(_numdofs) - Jplus*Jtrans)*(Jtemp2.t()*Mbalinv)*(1*balancedx);
}
else
{
step = magnitude*Jplus*(dx_trans);
}
if(bPRINT)
PrintMatrix(step.Store(),1,step.Nrows(),"step: ");
//add step and check for joint limits
bLimit = false;
for(int i = 0; i < _numdofs; i++)
{
q_s[i] = q_s_old[i] - step[i];
if(q_s[i] < _lowerLimit[i] || q_s[i] > _upperLimit[i])
{
if(bPRINT)
RAVELOG_INFO("Jacobian going past joint limit. J%d: %f outside %f to %f\n",i,q_s[i],_lowerLimit[i],_upperLimit[i]);
if(q_s[i] < _lowerLimit[i])
q_s[i] = _lowerLimit[i];
if(q_s[i] > _upperLimit[i])
q_s[i] = _upperLimit[i];
badjointinds.push_back(i); //note this will never add the same joint twice, even if bClearBadJoints = false
bLimit = true;
}
}
//move back to previous point if any joint limits
if(bLimit)
{
q_s = q_s_old;
}
}while(bLimit);
if(bPRINT)
RAVELOG_INFO("after limits\n");
}
RAVELOG_INFO("Iteration limit reached\n");
return false;
}