treeidsolver_recursive_newton_euler.hpp

Go to the documentation of this file.

// Copyright  (C)  2009  Ruben Smits <ruben dot smits at mech dot kuleuven dot be>

// Version: 1.0
// Author: Franco Fusco <franco dot fusco at ls2n dot fr>
// Maintainer: Ruben Smits <ruben dot smits at mech dot kuleuven dot be>
// 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

#ifndef KDL_TREE_IDSOLVER_RECURSIVE_NEWTON_EULER_HPP
#define KDL_TREE_IDSOLVER_RECURSIVE_NEWTON_EULER_HPP

#include "treeidsolver.hpp"

namespace KDL{
    class TreeIdSolver_RNE : public TreeIdSolver {
    public:
        TreeIdSolver_RNE(const Tree& tree, Vector grav);

        int CartToJnt(const JntArray &q, const JntArray &q_dot, const JntArray &q_dotdot, const WrenchMap& f_ext, JntArray &torques);

        virtual void updateInternalDataStructures();

    private:
        void initAuxVariables();

        void rne_step(SegmentMap::const_iterator segment, const JntArray &q, const JntArray &q_dot, const JntArray &q_dotdot, const WrenchMap& f_ext, JntArray& torques);

        const Tree& tree;
        unsigned int nj;
        unsigned int ns;
        std::map<std::string,Frame> X;
        std::map<std::string,Twist> S;
        std::map<std::string,Twist> v;
        std::map<std::string,Twist> a;
        std::map<std::string,Wrench> f;
        Twist ag;
    };
}

#endif