6#include <gtest/gtest.h>
8#include <kdl/chaindynparam.hpp>
9#include <kdl/chainfksolverpos_recursive.hpp>
17namespace fs = std::filesystem;
19static constexpr double kHomePose[7] = { 0.0, 0.2618, 3.1416, -2.2689, 0.0, 0.9599, 1.5708 };
20static constexpr double kKp[7] = { 100, 200, 100, 200, 100, 200, 100 };
21static constexpr double kKd[7] = { 10, 20, 10, 20, 10, 20, 10 };
23static fs::path repo_root() {
return fs::path(__FILE__).parent_path().parent_path(); }
34 std::unique_ptr<KDL::ChainFkSolverPos_recursive>
fk_;
35 std::unique_ptr<KDL::ChainDynParam>
dyn_;
41 const std::string arm_mjcf =
42 (
root_ /
"third_party/menagerie/kinova_gen3/gen3.xml").
string();
43 const std::string grp_mjcf =
44 (
root_ /
"third_party/menagerie/robotiq_2f85/2f85.xml").
string();
45 if (!fs::exists(arm_mjcf)) {
46 GTEST_SKIP() << arm_mjcf <<
" not found";
49 if (!fs::exists(grp_mjcf)) {
50 GTEST_SKIP() << grp_mjcf <<
" not found";
56 .attach_to =
"bracelet_link",
58 .pos = { 0.0, 0.0, -0.061525 },
59 .euler = { 180.0, 0.0, 0.0 },
60 .contact_exclusions = {},
63 rs.
path = arm_mjcf.c_str();
78 fk_ = std::make_unique<KDL::ChainFkSolverPos_recursive>(
s_.
chain);
79 dyn_ = std::make_unique<KDL::ChainDynParam>(
s_.
chain, KDL::Vector(0, 0, -9.81));
82 for (
unsigned i = 0; i <
n_; ++i)
q_home_(i) = kHomePose[i];
99 KDL::JntArray q_zero(n_);
101 mj_forward(model_, data_);
104 ASSERT_GE(dyn_->JntToGravity(q_zero, g), 0);
106 double max_err = 0.0;
107 for (
unsigned i = 0; i < n_; ++i)
108 max_err = std::max(max_err, std::abs(g(i) - data_->qfrc_bias[s_.kdl_to_mj_dof[i]]));
109 EXPECT_LE(max_err, 5e-2);
115 fk_->JntToCart(q_home_, ee_init);
119 KDL::JntArray q(n_), g(n_);
120 for (
int i = 0; i < 500; ++i) {
122 for (
unsigned j = 0; j < n_; ++j) q(j) = s_.jnt_pos_msr[j];
123 dyn_->JntToGravity(q, g);
124 for (
unsigned j = 0; j < n_; ++j) {
126 kKp[j] * (kHomePose[j] - s_.jnt_pos_msr[j]) - kKd[j] * s_.jnt_vel_msr[j] + g(j);
131 KDL::JntArray q_end(n_);
132 for (
unsigned j = 0; j < n_; ++j) q_end(j) = s_.jnt_pos_msr[j];
134 fk_->JntToCart(q_end, ee_end);
135 double drift = (ee_init.p - ee_end.p).Norm();
136 EXPECT_LE(drift, 0.005);
146 for (
unsigned i = 0; i < n_; ++i) s_.jnt_trq_cmd[i] = 0.0;
151 for (
unsigned i = 0; i < static_cast<unsigned>(s_.n_joints); ++i) {
152 double expected = s_.data->qfrc_actuator[s_.kdl_to_mj_dof[i]];
153 EXPECT_DOUBLE_EQ(s_.jnt_trq_msr[i], expected)
154 <<
"jnt_trq_msr[" << i <<
"] does not match qfrc_actuator";
158int main(
int argc,
char *argv[])
160 testing::InitGoogleTest(&argc, argv);
161 return RUN_ALL_TESTS();
std::unique_ptr< KDL::ChainDynParam > dyn_
std::unique_ptr< KDL::ChainFkSolverPos_recursive > fk_
bool init_robot_from_mjcf(Robot *r, mjModel *model, mjData *data, const char *base_body, const char *tip_body, const char *prefix="", const ToolFrameSpec *tool=nullptr)
void set_joint_pos(Robot *r, const KDL::JntArray &q, bool call_forward=true)
bool build_scene(mjModel **out_model, mjData **out_data, const SceneSpec *spec)
void destroy_scene(mjModel *model, mjData *data)
std::vector< AttachmentSpec > attachments
std::vector< RobotSpec > robots
int main(int argc, char *argv[])
TEST_F(MjcfTrqCtrlTest, GravityAccuracy)