kloessner/probfd/state__properties_8h_source.html

#ifndef PROBFD_ALGORITHMS_STATE_PROPERTIES_H

#define PROBFD_ALGORITHMS_STATE_PROPERTIES_H


#include "probfd/types.h"

#include "probfd/value_type.h"


#include <optional>


// Forward Declarations

namespace probfd {

struct Interval;

}


namespace probfd::algorithms {


class StateProperties {

public:

    virtual ~StateProperties() = default;


    virtual value_t lookup_value(StateID state_id) = 0;


    virtual Interval lookup_bounds(StateID state_id) = 0;

};


} // namespace probfd::algorithms


#endif // PROBFD_ALGORITHMS_STATE_PROPERTIES_H

probfd::algorithms::StateProperties
Interface providing access to various state properties during heuristic search.
Definition state_properties.h:22

probfd::algorithms::StateProperties::lookup_value
virtual value_t lookup_value(StateID state_id)=0
Looks up the current lower bound for the optimal value of a state.

probfd::algorithms::StateProperties::lookup_bounds
virtual Interval lookup_bounds(StateID state_id)=0
Looks up the bounding interval for the optimal value of a state.

probfd::algorithms
This namespace contains implementations of SSP search algorithms.
Definition acyclic_value_iteration.h:22

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

probfd::value_t
double value_t
Typedef for the state value type.
Definition aliases.h:7

probfd::Interval
Represents a closed interval over the extended reals as a pair of lower and upper bound.
Definition interval.h:12

probfd::StateID
A StateID represents a state within a StateIDMap. Just like Fast Downward's StateID type,...
Definition types.h:22