|
| OptimalSubsetAStar2 (MCRPlannerGoalSet *_planner, int _start, const vector< int > &_targets) |
|
virtual bool | IsGoal (const State &s) |
| The following must be overloaded by the subclass.
|
|
virtual void | Successors (const State &s, vector< State > &successors, vector< SubsetCost > &cost) |
|
virtual void | ClearVisited () |
|
virtual void | Visit (const State &s, Node *n) |
|
virtual Node * | VisitedStateNode (const State &s) |
|
| GeneralizedAStar (const pair< int, Subset > &start) |
|
void | SetStart (const pair< int, Subset > &start) |
| Resets the search from the given start state.
|
|
bool | Search () |
| Performs search until a goal is reached.
|
|
bool | SearchStep () |
| Performs a single iteration of search.
|
|
bool | SearchFailed () |
| Returns true if search failed.
|
|
int | NumNodes () const |
| Returns the number of nodes in the tree.
|
|
int | NumExpanded () const |
| Returns the number of previously expanded nodes.
|
|
int | NumDescendents (const Node &n) const |
| Returns the number of descendents of n.
|
|
SubsetCost | TopPriority () const |
| Returns the priority of the next node to be expanded.
|
|
bool | GoalFound () const |
| Returns true if the goal has been found.
|
|
SubsetCost | GoalCost () const |
|
const std::vector< pair< int, Subset > > & | GoalPath () const |
| Returns path of states to the goal.
|
|
virtual SubsetCost | Heuristic (const pair< int, Subset > &s) |
|
virtual void | Visit (const pair< int, Subset > &s, Node *n) |
|
virtual bool | OnExpand (Node *n) |
|
virtual void OptimalSubsetAStar2::ClearVisited |
( |
| ) |
|
|
inlinevirtual |
The documentation for this struct was generated from the following file: