Go to the documentation of this file.    1 #ifndef AIKIDO_PLANNER_CONFIGURATIONTOCONFIGURATIONPLANNER_HPP_ 
    2 #define AIKIDO_PLANNER_CONFIGURATIONTOCONFIGURATIONPLANNER_HPP_ 
   14         ConfigurationToConfigurationPlanner,
 
   15         ConfigurationToConfiguration>
 
   41 #endif // AIKIDO_PLANNER_CONFIGURATIONTOCONFIGURATIONPLANNER_HPP_ 
 
 
Format of serialized trajectory in YAML.
Definition: algorithm.hpp:4
 
std::shared_ptr< const StateSpace > ConstStateSpacePtr
Definition: StateSpace.hpp:15
 
Base planner class for ConfigurationToConfiguration planning problem.
Definition: ConfigurationToConfigurationPlanner.hpp:12
 
ConfigurationToConfigurationPlanner(statespace::ConstStateSpacePtr stateSpace, common::RNG *rng=nullptr)
Constructs from a state space.
 
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
 
Implementation of the C++11 "random engine" concept that uses virtual function calls to erase the typ...
Definition: RNG.hpp:24
 
virtual trajectory::TrajectoryPtr plan(const SolvableProblem &problem, Result *result=nullptr)=0
Solves problem returning the result to result.
 
Planning problem to plan to a single goal configuration.
Definition: ConfigurationToConfiguration.hpp:13
 
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