kloessner/probfd/probfd_2abstractions_2distances_8h_source.html

#ifndef PROBFD_ABSTRACTIONS_DISTANCES_H

#define PROBFD_ABSTRACTIONS_DISTANCES_H


#include "probfd/pdbs/types.h"


#include "probfd/type_traits.h"

#include "probfd/value_type.h"


#include <limits>

#include <span>


// Forward Declarations

namespace probfd {

template <typename>

class Evaluator;

template <typename, typename>

class MDP;

} // namespace probfd


namespace probfd {


template <typename State, typename Action>

void compute_value_table(

    MDP<State, Action>& mdp,

    param_type<State> initial_state,

    const Evaluator<State>& heuristic,

    std::span<value_t> value_table,

    double max_time = std::numeric_limits<double>::infinity());


} // namespace probfd


#define GUARD_INCLUDE_PROBFD_ABSTRACTIONS_DISTANCES_H

#include "probfd/abstractions/distances_impl.h"

#undef GUARD_INCLUDE_PROBFD_ABSTRACTIONS_DISTANCES_H


#endif

probfd
The top-level namespace of probabilistic Fast Downward.
Definition command_line.h:8

probfd::compute_value_table
void compute_value_table(MDP< State, Action > &mdp, param_type< State > initial_state, const Evaluator< State > &heuristic, std::span< value_t > value_table, double max_time=std::numeric_limits< double >::infinity())
Computes the optimal value function of the abstraction, complete up to forward reachability from the ...
Definition distances_impl.h:22

probfd::param_type
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