Go to the documentation of this file.    1 #ifndef AIKIDO_PLANNER_SINGLEPROBLEMPLANNER_HPP_ 
    2 #define AIKIDO_PLANNER_SINGLEPROBLEMPLANNER_HPP_ 
   21 template <
typename Derived, 
typename ProblemT>
 
   36       const Problem& problem, 
Result* result = 
nullptr) final override;
 
   42 #include "aikido/planner/detail/SingleProblemPlanner-impl.hpp" 
   44 #endif // AIKIDO_PLANNER_SINGLEPROBLEMPLANNER_HPP_ 
 
 
Format of serialized trajectory in YAML.
Definition: algorithm.hpp:4
 
std::shared_ptr< const StateSpace > ConstStateSpacePtr
Definition: StateSpace.hpp:15
 
SingleProblemPlanner(statespace::ConstStateSpacePtr stateSpace, common::RNG *rng=nullptr)
Constructs from a state space.
Definition: SingleProblemPlanner-impl.hpp:13
 
std::shared_ptr< Trajectory > TrajectoryPtr
Definition: Trajectory.hpp:13
 
SingleProblemPlanner is a base class for any concrete planner that are not a CompositePlanner.
Definition: SingleProblemPlanner.hpp:22
 
ConfigurationToEndEffectorOffset SolvableProblem
Definition: SingleProblemPlanner.hpp:25
 
Implementation of the C++11 "random engine" concept that uses virtual function calls to erase the typ...
Definition: RNG.hpp:24
 
Base class for a meta-planner.
Definition: Planner.hpp:17
 
Base class for various planning problems.
Definition: Problem.hpp:13
 
bool canSolve(const Problem &problem) const final override
Returns true if this planner can solve problem.
Definition: SingleProblemPlanner-impl.hpp:22
 
trajectory::TrajectoryPtr plan(const Problem &problem, Result *result=nullptr) final override
Solves problem returning the result to result.
Definition: SingleProblemPlanner-impl.hpp:30
 
Base class for planning result of various planning problems.
Definition: Planner.hpp:58