Go to the documentation of this file. 1 #ifndef AIKIDO_PLANNER_COMPOSITEPLANNER_HPP_
2 #define AIKIDO_PLANNER_COMPOSITEPLANNER_HPP_
26 const std::vector<PlannerPtr>& planners = std::vector<PlannerPtr>());
47 #endif // AIKIDO_PLANNER_COMPOSITEPLANNER_HPP_
Format of serialized trajectory in YAML.
Definition: algorithm.hpp:4
bool canSolve(const Problem &problem) const override
Returns true if this planner can solve problem.
std::shared_ptr< const StateSpace > ConstStateSpacePtr
Definition: StateSpace.hpp:15
Base class for a meta-planner.
Definition: Planner.hpp:17
Base class for various planning problems.
Definition: Problem.hpp:13
CompositePlanner(statespace::ConstStateSpacePtr stateSpace, const std::vector< PlannerPtr > &planners=std::vector< PlannerPtr >())
Constructs given list of planners.
#define AIKIDO_DECLARE_POINTERS(X)
Definition: pointers.hpp:21
const std::vector< PlannerPtr > mPlanners
Planners.
Definition: CompositePlanner.hpp:36
CompositePlanner is a base class for concrete planner classes that contain multiple planners.
Definition: CompositePlanner.hpp:16
bool hasPlanner(const Planner &planner) const
Returns true if this CompositePlanner contains planner.