#include <solver.h>
Public Types | |
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 | addToCloseList (StatePtr state, double cost=0) |
virtual void | addToOpenList (SolverNodePtr node)=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 | isOpenListEmpty ()=0 |
virtual SolverNodePtr | popFromOpenList ()=0 |
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 | |
SolveList | close_list_ |
GraphPtr | graph_ |
bool | verbose_ |
typedef GraphT::Ptr jsk_footstep_planner::Solver< GraphT >::GraphPtr |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, jsk_footstep_planner::BestFirstSearchSolver< GraphT >, jsk_footstep_planner::BreadthFirstSearchSolver< GraphT >, jsk_footstep_planner::DepthFirstSearchSolver< GraphT >, jsk_footstep_planner::AStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
typedef boost::shared_ptr<Solver> jsk_footstep_planner::Solver< GraphT >::Ptr |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, jsk_footstep_planner::BestFirstSearchSolver< GraphT >, jsk_footstep_planner::BreadthFirstSearchSolver< GraphT >, jsk_footstep_planner::DepthFirstSearchSolver< GraphT >, jsk_footstep_planner::AStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
typedef boost::unordered_map< StatePtr, double > jsk_footstep_planner::Solver< GraphT >::SolveList |
Reimplemented in jsk_footstep_planner::GridAStarSolver< GraphT >.
typedef SolverNode<State, GraphT>::Ptr jsk_footstep_planner::Solver< GraphT >::SolverNodePtr |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, jsk_footstep_planner::BestFirstSearchSolver< GraphT >, jsk_footstep_planner::BreadthFirstSearchSolver< GraphT >, jsk_footstep_planner::DepthFirstSearchSolver< GraphT >, jsk_footstep_planner::AStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
typedef GraphT::StateT jsk_footstep_planner::Solver< GraphT >::State |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, jsk_footstep_planner::BestFirstSearchSolver< GraphT >, jsk_footstep_planner::BreadthFirstSearchSolver< GraphT >, jsk_footstep_planner::DepthFirstSearchSolver< GraphT >, jsk_footstep_planner::AStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
typedef GraphT::StateT::Ptr jsk_footstep_planner::Solver< GraphT >::StatePtr |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >, jsk_footstep_planner::BestFirstSearchSolver< GraphT >, jsk_footstep_planner::BreadthFirstSearchSolver< GraphT >, jsk_footstep_planner::DepthFirstSearchSolver< GraphT >, jsk_footstep_planner::AStarSolver< GraphT >, and jsk_footstep_planner::GridAStarSolver< GraphT >.
jsk_footstep_planner::Solver< GraphT >::Solver | ( | ) | [inline] |
jsk_footstep_planner::Solver< GraphT >::Solver | ( | GraphPtr | graph | ) | [inline] |
virtual void jsk_footstep_planner::Solver< GraphT >::addToCloseList | ( | StatePtr | state, |
double | cost = 0 |
||
) | [inline, virtual] |
virtual void jsk_footstep_planner::Solver< GraphT >::addToOpenList | ( | SolverNodePtr | node | ) | [pure virtual] |
virtual void jsk_footstep_planner::Solver< GraphT >::addToOpenList | ( | std::vector< SolverNodePtr > | nodes | ) | [inline, virtual] |
virtual bool jsk_footstep_planner::Solver< GraphT >::findInCloseList | ( | StatePtr | state | ) | [inline, virtual] |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >.
virtual bool jsk_footstep_planner::Solver< GraphT >::findInCloseList | ( | StatePtr | state, |
double & | cost | ||
) | [inline, virtual] |
virtual bool jsk_footstep_planner::Solver< GraphT >::isOK | ( | const ros::WallTime & | start_time, |
const ros::WallDuration & | timeout | ||
) | [inline, virtual] |
Reimplemented in jsk_footstep_planner::FootstepAStarSolver< GraphT >.
virtual bool jsk_footstep_planner::Solver< GraphT >::isOpenListEmpty | ( | ) | [pure virtual] |
virtual SolverNodePtr jsk_footstep_planner::Solver< GraphT >::popFromOpenList | ( | ) | [pure virtual] |
virtual bool jsk_footstep_planner::Solver< GraphT >::removeFromCloseList | ( | StatePtr | state | ) | [inline, virtual] |
virtual void jsk_footstep_planner::Solver< GraphT >::setVerbose | ( | bool | v | ) | [inline, virtual] |
virtual std::vector<typename SolverNode<State, GraphT>::Ptr> jsk_footstep_planner::Solver< GraphT >::solve | ( | const ros::WallDuration & | timeout = ros::WallDuration(1000000000.0) | ) | [inline, virtual] |
SolveList jsk_footstep_planner::Solver< GraphT >::close_list_ [protected] |
GraphPtr jsk_footstep_planner::Solver< GraphT >::graph_ [protected] |
bool jsk_footstep_planner::Solver< GraphT >::verbose_ [protected] |