Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

(parallel_planning) fix clang rename of functions #811

Closed
wants to merge 1 commit into from
Closed

(parallel_planning) fix clang rename of functions #811

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
8 changes: 4 additions & 4 deletions doc/how_to_guides/parallel_planning/src/parallel_planning_main.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -36,10 +36,10 @@ getShortestSolution(const std::vector<planning_interface::MotionPlanResponse>& s
for (auto const& solution : solutions)
{
RCLCPP_INFO(LOGGER, "Planner '%s' returned '%s'", solution.planner_id.c_str(),
moveit::core::errorCodeToString(solution.error_code).c_str());
moveit::core::error_code_to_string(solution.error_code).c_str());
if (solution.trajectory)
{
RCLCPP_INFO(LOGGER, "Path length: '%f', Planning time: '%f'", robot_trajectory::pathLength(*solution.trajectory),
RCLCPP_INFO(LOGGER, "Path length: '%f', Planning time: '%f'", robot_trajectory::path_length(*solution.trajectory),
solution.planning_time);
}
}
Expand All @@ -50,8 +50,8 @@ getShortestSolution(const std::vector<planning_interface::MotionPlanResponse>& s
// If both solutions were successful, check which path is shorter
if (solution_a && solution_b)
{
return robot_trajectory::pathLength(*solution_a.trajectory) <
robot_trajectory::pathLength(*solution_b.trajectory);
return robot_trajectory::path_length(*solution_a.trajectory) <
robot_trajectory::path_length(*solution_b.trajectory);
}
// If only solution a is successful, return a
else if (solution_a)
Expand Down