#include <ros/ros.h>
#include <moveit/robot_model/robot_model.h>
#include <moveit/planning_scene/planning_scene.h>
#include <moveit/task_constructor/task.h>
#include <moveit/task_constructor/container.h>
#include <moveit/task_constructor/solvers/cartesian_path.h>
#include <moveit/task_constructor/solvers/pipeline_planner.h>
#include <moveit/task_constructor/stages.h>
Go to the source code of this file.
Functions | |
int | main (int argc, char **argv) |
Variables | |
constexpr double | TAU = 2 * M_PI |
int main | ( | int | argc, |
char ** | argv | ||
) |
Alternatives (3x FixedState with different states) -> Fallbacks(MoveTo<CartesianPath>, MoveTo<PTP>, MoveTo<OMPL>)
This task demonstrates how to use the Fallbacks stage to try different planning approaches in propagator. Note that the initial states are all different, so this task does not describe any real-world scenario (where all plans should start from the same initial state for execution).
Definition at line 22 of file fallbacks_move_to.cpp.
|
constexpr |
Definition at line 12 of file fallbacks_move_to.cpp.