38 #ifndef SIMPLE_SCORED_SAMPLING_PLANNER_H_ 39 #define SIMPLE_SCORED_SAMPLING_PLANNER_H_ 74 SimpleScoredSamplingPlanner(std::vector<TrajectorySampleGenerator*> gen_list, std::vector<TrajectoryCostFunction*>& critics,
int max_samples = -1);
std::vector< TrajectorySampleGenerator * > gen_list_
std::vector< TrajectoryCostFunction * > critics_
~SimpleScoredSamplingPlanner()
Generates a local plan using the given generator and cost functions. Assumes less cost are best...
double scoreTrajectory(Trajectory &traj, double best_traj_cost)
bool findBestTrajectory(Trajectory &traj, std::vector< Trajectory > *all_explored=0)
Interface for modules finding a trajectory to use for navigation commands next.
SimpleScoredSamplingPlanner()
Holds a trajectory generated by considering an x, y, and theta velocity.