#include <iostream>
template<class T, size_t DOFs>
T data[DOFs];
public:
std::copy_n(a.begin(), DOFs, std::begin(data));
}
return data[i];
}
return data[i];
}
return DOFs;
}
for (size_t dof = 0; dof < DOFs; ++dof) {
if (data[dof] != rhs[dof]) {
return false;
}
}
return true;
}
};
std::cout << "t | p1 | p2 | p3" << std::endl;
while (otg.update(input, output) == Result::Working) {
std::cout << output.
time <<
" " << p[0] <<
" " << p[1] <<
" " << p[2] <<
" " << std::endl;
output.pass_to_input(input);
}
std::cout <<
"Trajectory duration: " << output.
trajectory.get_duration() <<
" [s]." << std::endl;
}
int main()
Definition: 10_dynamic_dofs_waypoints.cpp:10
Definition: 12_custom_vector_type.cpp:7
size_t size() const
Definition: 12_custom_vector_type.cpp:24
MinimalVector()
Definition: 12_custom_vector_type.cpp:11
T operator[](size_t i) const
Definition: 12_custom_vector_type.cpp:16
bool operator==(const MinimalVector< T, DOFs > &rhs) const
Definition: 12_custom_vector_type.cpp:28
Output type of Ruckig.
Definition: output_parameter.hpp:15
Vector< double > new_position
Definition: output_parameter.hpp:31
double time
Current time on trajectory.
Definition: output_parameter.hpp:34
Trajectory< DOFs, CustomVector > trajectory
Current trajectory.
Definition: output_parameter.hpp:28
Main class for the Ruckig algorithm.
Definition: ruckig.hpp:27