Assignment Search Framework
|
Public Member Functions | |
AStar () | |
virtual | ~AStar () |
![]() | |
BestFirstSearch () | |
virtual | ~BestFirstSearch () |
void | setHashFunction (const StateHashFunction< state_t > *hash) |
void | setHeuristic (Heuristic< state_t > *heur) |
uint64_t | getUniqueGoalTests () const |
![]() | |
SearchEngine () | |
virtual | ~SearchEngine () |
void | setGoalTest (const GoalTestFunction< state_t > *g) |
void | setTransitionSystem (const TransitionSystem< state_t, action_t > *o) |
SearchStatus | getStatus () const |
SearchTermType | getPlan (const state_t &init_state, std::vector< action_t > &sol_plan) |
bool | foundSolution () const |
std::vector< action_t > | getLastPlan () |
double | getLastPlanCost () |
void | setStorageLimit (uint64_t limit) |
bool | hitStorageLimit () |
void | setHComputeLimit (uint64_t limit) |
bool | hitHCompLimit () |
void | setSuccCallLimit (uint64_t limit) |
bool | hitSuccFuncLimit () |
void | setGoalTestLimit (uint64_t limit) |
bool | hitGoalTestLimit () |
uint64_t | getStorageCount () const |
uint64_t | getHCompCount () const |
uint64_t | getSuccFuncCount () const |
uint64_t | getStateGenCount () const |
uint64_t | getActionGenCount () const |
uint64_t | getGoalTestCount () const |
Protected Member Functions | |
virtual double | nodeEval (const state_t &state, double g_cost, double h_cost) |
![]() | |
virtual SearchTermType | searchForPlan (const state_t &init_state) |
virtual void | resetStatistics () |
virtual bool | isConfigured () const |
virtual void | resetEngine () |
virtual BfsExpansionResult | nodeExpansion () |
void | extractSolutionPath (NodeID path_end_id) |
![]() | |
virtual void | incrementGoalTestCount () |
virtual void | incrementHCompCount () |
virtual void | incrementSuccFuccCalls () |
virtual void | incrementStateGenCount () |
virtual void | increaseActionGenCount (double new_gens) |
Additional Inherited Members | |
![]() | |
Heuristic< state_t > * | heur_func |
The heuristic function. More... | |
const StateHashFunction < state_t > * | hash_func |
The hash function. More... | |
OpenClosedList< state_t, action_t > | open_closed_list |
The open and closed list. More... | |
uint64_t | unique_goal_tests |
The number of unique goal tests performed. More... | |
std::vector< action_t > | app_actions |
A vector to store the set of applicable actions. More... | |
![]() | |
const GoalTestFunction< state_t > * | goal_test |
The goal test function. More... | |
const TransitionSystem < state_t, action_t > * | op_system |
The transition system. More... | |
SearchStatus | alg_status |
The current search status. More... | |
bool | have_incumbent |
If an incumbent solution is stored or not. More... | |
std::vector< action_t > | incumbent_plan |
The last solution found. More... | |
double | incumbent_cost |
The cost of the last solution. More... | |
uint64_t | storage_limit |
The limit on how many states are stored. 0 for no limit. More... | |
uint64_t | storage_count |
The number of states currently being stored. More... | |
uint64_t | h_comp_limit |
The limit on how many heuristic computations can be performed. 0 for no limit. More... | |
uint64_t | h_comp_count |
The number of heuristic computations during the current search. More... | |
uint64_t | succ_func_limit |
The limit on how many successor function calls can be performed. 0 for no limit. More... | |
uint64_t | succ_func_count |
The number of heuristic computations made during the current search. More... | |
uint64_t | goal_test_limit |
The limit on the number of goal tests. 0 for no limit. More... | |
uint64_t | goal_test_count |
The number of goal tests performed during the current search. More... | |
uint64_t | state_gen_count |
The number of state generations during the current search. More... | |
uint64_t | action_gen_count |
The number of state generations during the current search. More... | |
|
inlineprotectedvirtual |
Calculates the evaluation of the given node.
state | The state to evaluate. |
g_cost | The g-cost of the current node. |
h_cost | The h-cost of the current node. |
Implements BestFirstSearch< state_t, action_t >.