ikfast_inv_kin.hpp

Go to the documentation of this file.

 
#ifndef TESSERACT_KINEMATICS_IMPL_IKFAST_INV_KIN_HPP
#define TESSERACT_KINEMATICS_IMPL_IKFAST_INV_KIN_HPP
 
#include <tesseract_common/macros.h>
TESSERACT_COMMON_IGNORE_WARNINGS_PUSH
#include <stdexcept>
#include <console_bridge/console.h>
#include <tesseract_kinematics/ikfast/external/ikfast.h>
TESSERACT_COMMON_IGNORE_WARNINGS_POP
 
#include <tesseract_kinematics/ikfast/ikfast_inv_kin.h>
#include <tesseract_kinematics/core/utils.h>
 
namespace tesseract_kinematics
{
inline IKFastInvKin::IKFastInvKin(std::string base_link_name,
                                  std::string tip_link_name,
                                  std::vector<std::string> joint_names,
                                  std::string solver_name,
                                  std::vector<std::vector<double>> free_joint_states)
  : base_link_name_(std::move(base_link_name))
  , tip_link_name_(std::move(tip_link_name))
  , joint_names_(std::move(joint_names))
  , solver_name_(std::move(solver_name))
  , free_joint_states_(std::move(free_joint_states))
{
}
 
inline InverseKinematics::UPtr IKFastInvKin::clone() const { return std::make_unique<IKFastInvKin>(*this); }
 
inline IKFastInvKin::IKFastInvKin(const IKFastInvKin& other) { *this = other; }
 
inline IKFastInvKin& IKFastInvKin::operator=(const IKFastInvKin& other)
{
  base_link_name_ = other.base_link_name_;
  tip_link_name_ = other.tip_link_name_;
  joint_names_ = other.joint_names_;
  solver_name_ = other.solver_name_;
  free_joint_states_ = other.free_joint_states_;
 
  return *this;
}
 
inline IKSolutions IKFastInvKin::calcInvKin(const tesseract_common::TransformMap& tip_link_poses,
                                            const Eigen::Ref<const Eigen::VectorXd>& /*seed*/) const
{
  assert(tip_link_poses.size() == 1);
  assert(tip_link_poses.find(tip_link_name_) != tip_link_poses.end());
  assert(std::abs(1.0 - tip_link_poses.at(tip_link_name_).matrix().determinant()) < 1e-6);
 
  const Eigen::Isometry3d& pose = tip_link_poses.at(tip_link_name_);
 
  // Convert to ikfast data type
  Eigen::Transform<IkReal, 3, Eigen::Isometry> ikfast_tcp = pose.cast<IkReal>();
 
  // Decompose
  const Eigen::Matrix<IkReal, 3, 1> translation = ikfast_tcp.translation();
 
  // Note the row major ordering here: IkFast expects the matrix in r00, r01, r02, ..., r11, r12, r13
  // ordering
  const Eigen::Matrix<IkReal, 3, 3, Eigen::RowMajor> rotation = ikfast_tcp.rotation();
 
  auto ikfast_dof = static_cast<std::size_t>(numJoints());
 
  // Call IK (TODO: Make a better solution list class? One that uses vector instead of list)
  ikfast::IkSolutionList<IkReal> ikfast_solution_set;
  std::vector<double> sols;
 
  // Lambda to add all possible solutions for a given combination of free joints, or nullptr if no free joints
  auto addSols = [&](const double* pfree) {
    ComputeIk(translation.data(), rotation.data(), pfree, ikfast_solution_set);
 
    // Unpack the solutions into the output vector
    const auto n_sols = ikfast_solution_set.GetNumSolutions();
 
    std::vector<IkReal> ikfast_output;
    ikfast_output.resize(n_sols * ikfast_dof);
 
    for (std::size_t i = 0; i < n_sols; ++i)
    {
      // This actually walks the list EVERY time from the start of i.
      const auto& sol = ikfast_solution_set.GetSolution(i);
      auto* out = ikfast_output.data() + i * ikfast_dof;
      sol.GetSolution(out, pfree);
    }
 
    sols.insert(
        end(sols), std::make_move_iterator(ikfast_output.begin()), std::make_move_iterator(ikfast_output.end()));
  };
 
  if (!free_joint_states_.empty())
  {
    for (auto j_combo : free_joint_states_)
    {
      addSols(j_combo.data());
    }
  }
  else
  {
    addSols(nullptr);
  }
 
  // Check the output
  std::size_t num_sol = sols.size() / ikfast_dof;
  IKSolutions solution_set;
  solution_set.reserve(sols.size());
  for (std::size_t i = 0; i < num_sol; i++)
  {
    Eigen::Map<Eigen::VectorXd> eigen_sol(sols.data() + ikfast_dof * i, static_cast<Eigen::Index>(ikfast_dof));
    if (eigen_sol.array().allFinite())
      solution_set.push_back(eigen_sol);
  }
 
  return solution_set;
}
 
inline Eigen::Index IKFastInvKin::numJoints() const { return static_cast<Eigen::Index>(GetNumJoints()); }
inline std::vector<std::string> IKFastInvKin::getJointNames() const { return joint_names_; }
inline std::string IKFastInvKin::getBaseLinkName() const { return base_link_name_; }
inline std::string IKFastInvKin::getWorkingFrame() const { return base_link_name_; }
inline std::vector<std::string> IKFastInvKin::getTipLinkNames() const { return { tip_link_name_ }; }
inline std::string IKFastInvKin::getSolverName() const { return solver_name_; }
 
inline std::vector<std::vector<double>>
IKFastInvKin::generateAllFreeJointStateCombinations(const std::vector<std::vector<double>>& free_joint_samples)
{
  std::vector<std::vector<double>> free_joint_states;
  std::vector<std::size_t> curr_joint_indices(free_joint_samples.size(), 0);
  while (curr_joint_indices.front() < free_joint_samples.front().size())
  {
    std::vector<double> curr_joint_values;
    for (std::size_t i = 0; i < curr_joint_indices.size(); ++i)
      curr_joint_values.push_back(free_joint_samples[i][curr_joint_indices[i]]);
    free_joint_states.push_back(curr_joint_values);
    curr_joint_indices.back()++;
    for (std::size_t i = curr_joint_indices.size() - 1; i > 0; --i)
    {
      if (curr_joint_indices[i] == free_joint_samples[i].size())
      {
        curr_joint_indices[i] = 0;
        curr_joint_indices[i - 1]++;
      }
    }
  }
  return free_joint_states;
}
 
}  // namespace tesseract_kinematics
 
#endif  // TESSERACT_KINEMATICS_IMPL_IKFAST_INV_KIN_HPP