Interface for modules finding a trajectory to use for navigation commands next.
More...
#include <trajectory_search.h>
Interface for modules finding a trajectory to use for navigation commands next.
Definition at line 84 of file trajectory_search.h.
◆ ~TrajectorySearch()
virtual base_local_planner::TrajectorySearch::~TrajectorySearch |
( |
| ) |
|
|
inlinevirtual |
◆ TrajectorySearch()
base_local_planner::TrajectorySearch::TrajectorySearch |
( |
| ) |
|
|
inlineprotected |
◆ findBestTrajectory()
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.
- Parameters
-
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.
The documentation for this class was generated from the following file: