Interface for modules finding a trajectory to use for navigation commands next. More...
#include <trajectory_search.h>

Public Member Functions | |
| virtual bool | findBestTrajectory (Trajectory &traj, std::vector< Trajectory > *all_explored)=0 |
| virtual | ~TrajectorySearch () |
Protected Member Functions | |
| TrajectorySearch () | |
Interface for modules finding a trajectory to use for navigation commands next.
Definition at line 49 of file trajectory_search.h.
| virtual base_local_planner::TrajectorySearch::~TrajectorySearch | ( | ) | [inline, virtual] |
Definition at line 61 of file trajectory_search.h.
| base_local_planner::TrajectorySearch::TrajectorySearch | ( | ) | [inline, protected] |
Definition at line 64 of file trajectory_search.h.
| virtual bool base_local_planner::TrajectorySearch::findBestTrajectory | ( | Trajectory & | traj, |
| std::vector< Trajectory > * | all_explored | ||
| ) | [pure virtual] |
searches the space of allowed trajectory and returns one considered the optimal given the constraints of the particular search.
| traj | The container to write the result to |
| all_explored | pass NULL or a container to collect all trajectories for debugging (has a penalty) |
Implemented in base_local_planner::SimpleScoredSamplingPlanner.