compute_bellman(CostFunctionType &cost_function, StateID state_id, const std::vector< TransitionType > &transitions, value_t termination_cost) const | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
compute_bellman_and_greedy(CostFunctionType &cost_function, StateID state_id, std::vector< TransitionType > &transitions, value_t termination_cost, std::vector< AlgorithmValueType > &qvalues, value_t epsilon=g_epsilon) const | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
probfd::MDPAlgorithm::compute_policy(MDPType &mdp, EvaluatorType &heuristic, param_type< State > state, ProgressReport progress, double maxtime)=0 | probfd::MDPAlgorithm< State, Action > | pure virtual |
do_solve(MDPType &mdp, EvaluatorType &h, param_type< State > state, ProgressReport &progress, double max_time)=0 | probfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, StateInfoT > | pure virtual |
lookup_bounds(StateID state_id) const | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
print_additional_statistics(std::ostream &out) const =0 | probfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, StateInfoT > | pure virtual |
print_statistics(std::ostream &out) const final | probfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, StateInfoT > | virtual |
reset_search_state() | probfd::algorithms::heuristic_search::FRETHeuristicSearchAlgorithm< State, Action, StateInfoT > | inlinevirtual |
select_greedy_transition(MDPType &mdp, std::optional< Action > previous_greedy_action, std::vector< TransitionType > &greedy_transitions) | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
probfd::MDPAlgorithm::solve(MDPType &mdp, EvaluatorType &heuristic, param_type< State > state, ProgressReport progress, double max_time)=0 | probfd::MDPAlgorithm< State, Action > | pure virtual |
update_policy(StateInfo &state_info, const std::optional< TransitionType > &transition) | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
update_value(StateInfo &state_info, AlgorithmValueType other, value_t epsilon=g_epsilon) | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |
was_visited(StateID state_id) const | probfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT > | |