/** \file itasc/kdl/chainjnttojacsolver.cpp * \ingroup itasc */ // Copyright (C) 2007 Ruben Smits // Version: 1.0 // Author: Ruben Smits // Maintainer: Ruben Smits // URL: http://www.orocos.org/kdl // This library is free software; you can redistribute it and/or // modify it under the terms of the GNU Lesser General Public // License as published by the Free Software Foundation; either // version 2.1 of the License, or (at your option) any later version. // This library is distributed in the hope that it will be useful, // but WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // Lesser General Public License for more details. // You should have received a copy of the GNU Lesser General Public // License along with this library; if not, write to the Free Software // Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA #include "chainjnttojacsolver.hpp" namespace KDL { ChainJntToJacSolver::ChainJntToJacSolver(const Chain& _chain): chain(_chain) { } ChainJntToJacSolver::~ChainJntToJacSolver() { } int ChainJntToJacSolver::JntToJac(const JntArray& q_in,Jacobian& jac) { assert(q_in.rows()==chain.getNrOfJoints()&& q_in.rows()==jac.columns()); Frame T_local, T_joint; T_total = Frame::Identity(); SetToZero(t_local); int i=chain.getNrOfSegments()-1; unsigned int q_nr = chain.getNrOfJoints(); //Lets recursively iterate until we are in the root segment while (i >= 0) { const Segment& segment = chain.getSegment(i); int ndof = segment.getJoint().getNDof(); q_nr -= ndof; //get the pose of the joint. T_joint = segment.getJoint().pose(((JntArray&)q_in)(q_nr)); // combine with the tip to have the tip pose T_local = T_joint*segment.getFrameToTip(); //calculate new T_end: T_total = T_local * T_total; for (int dof=0; dof