#include <best_first_search_solver.h>
Public Types | |
typedef GraphT::Ptr | GraphPtr |
typedef std::priority_queue< SolverNodePtr, std::vector< SolverNodePtr >, std::greater< SolverNodePtr > > | OpenList |
typedef boost::shared_ptr< BestFirstSearchSolver > | Ptr |
typedef SolverNode< State, GraphT >::Ptr | SolverNodePtr |
typedef GraphT::StateT | State |
typedef GraphT::StateT::Ptr | StatePtr |
Public Types inherited from jsk_footstep_planner::Solver< GraphT > | |
typedef GraphT::Ptr | GraphPtr |
typedef boost::shared_ptr< Solver > | Ptr |
typedef boost::unordered_map< StatePtr, double > | SolveList |
typedef SolverNode< State, GraphT >::Ptr | SolverNodePtr |
typedef GraphT::StateT | State |
typedef GraphT::StateT::Ptr | StatePtr |
Public Member Functions | |
virtual void | addToOpenList (SolverNodePtr node) |
BestFirstSearchSolver (GraphPtr graph) | |
virtual double | fn (SolverNodePtr n) |
virtual bool | isOpenListEmpty () |
virtual SolverNodePtr | popFromOpenList () |
Public Member Functions inherited from jsk_footstep_planner::Solver< GraphT > | |
virtual void | addToCloseList (StatePtr state, double cost=0) |
virtual void | addToOpenList (std::vector< SolverNodePtr > nodes) |
virtual bool | findInCloseList (StatePtr state) |
virtual bool | findInCloseList (StatePtr state, double &cost) |
virtual bool | isOK (const ros::WallTime &start_time, const ros::WallDuration &timeout) |
virtual bool | removeFromCloseList (StatePtr state) |
virtual void | setVerbose (bool v) |
virtual std::vector< typename SolverNode< State, GraphT >::Ptr > | solve (const ros::WallDuration &timeout=ros::WallDuration(1000000000.0)) |
Solver () | |
Solver (GraphPtr graph) | |
Protected Attributes | |
OpenList | open_list_ |
Protected Attributes inherited from jsk_footstep_planner::Solver< GraphT > | |
SolveList | close_list_ |
GraphPtr | graph_ |
bool | verbose_ |
Definition at line 46 of file best_first_search_solver.h.
typedef GraphT::Ptr jsk_footstep_planner::BestFirstSearchSolver< GraphT >::GraphPtr |
Definition at line 52 of file best_first_search_solver.h.
typedef std::priority_queue<SolverNodePtr, std::vector<SolverNodePtr>, std::greater<SolverNodePtr> > jsk_footstep_planner::BestFirstSearchSolver< GraphT >::OpenList |
Definition at line 56 of file best_first_search_solver.h.
typedef boost::shared_ptr<BestFirstSearchSolver> jsk_footstep_planner::BestFirstSearchSolver< GraphT >::Ptr |
Definition at line 49 of file best_first_search_solver.h.
typedef SolverNode<State, GraphT>::Ptr jsk_footstep_planner::BestFirstSearchSolver< GraphT >::SolverNodePtr |
Definition at line 53 of file best_first_search_solver.h.
typedef GraphT::StateT jsk_footstep_planner::BestFirstSearchSolver< GraphT >::State |
Definition at line 51 of file best_first_search_solver.h.
typedef GraphT::StateT::Ptr jsk_footstep_planner::BestFirstSearchSolver< GraphT >::StatePtr |
Definition at line 50 of file best_first_search_solver.h.
|
inline |
Definition at line 58 of file best_first_search_solver.h.
|
inlinevirtual |
Implements jsk_footstep_planner::Solver< GraphT >.
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
Definition at line 60 of file best_first_search_solver.h.
|
inlinevirtual |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, and jsk_footstep_planner::AStarSolver< GraphT >.
Definition at line 77 of file best_first_search_solver.h.
|
inlinevirtual |
Implements jsk_footstep_planner::Solver< GraphT >.
Reimplemented in jsk_footstep_planner::GridAStarSolver< GraphT >.
Definition at line 65 of file best_first_search_solver.h.
|
inlinevirtual |
Implements jsk_footstep_planner::Solver< GraphT >.
Reimplemented in jsk_footstep_planner::GridAStarSolver< GraphT >.
Definition at line 70 of file best_first_search_solver.h.
|
protected |
Definition at line 82 of file best_first_search_solver.h.