1#ifndef PROBFD_ALGORITHMS_AO_STAR_H
2#define PROBFD_ALGORITHMS_AO_STAR_H
4#include "probfd/algorithms/ao_search.h"
11class SuccessorSampler;
38template <
typename State,
typename Action,
bool UseInterval>
43 PerStateInformation<Action, UseInterval, true>> {
44 using Base =
typename AOStar::AOBase;
48 using AlgorithmValueType = Base::AlgorithmValueType;
50 using MDPType =
typename Base::MDPType;
51 using EvaluatorType =
typename Base::EvaluatorType;
52 using PolicyPickerType =
typename Base::PolicyPickerType;
53 using StateInfo =
typename Base::StateInfo;
58 const std::shared_ptr<SuccessorSamplerType> outcome_selection_;
61 std::vector<Transition<Action>> transitions_;
62 std::vector<AlgorithmValueType> qvalues_;
67 std::shared_ptr<PolicyPickerType> policy_chooser,
68 std::shared_ptr<SuccessorSamplerType> outcome_selection);
73 EvaluatorType& heuristic,
76 double max_time)
override;
79 bool update_value_check_solved(
82 std::vector<Transition<Action>> transitions,
88#define GUARD_INCLUDE_PROBFD_ALGORITHMS_AO_STAR_H
89#include "probfd/algorithms/ao_star_impl.h"
90#undef GUARD_INCLUDE_PROBFD_ALGORITHMS_AO_STAR_H
A convenience class that represents a finite probability distribution.
Definition task_state_space.h:27
A registry for print functions related to search progress.
Definition progress_report.h:33
Base class for the AO* algorithm family.
Definition ao_search.h:85
Implementation of the AO* algorithm.
Definition ao_star.h:43
Namespace dedicated to the AO* algorithm.
Definition ao_star.h:15
This namespace contains implementations of SSP search algorithms.
Definition acyclic_value_iteration.h:22
typename std::conditional_t< is_cheap_to_copy_v< T >, T, const T & > param_type
Alias template defining the best way to pass a parameter of a given type.
Definition type_traits.h:25
Represents a closed interval over the extended reals as a pair of lower and upper bound.
Definition interval.h:12