An interface for defining policies that refer to a planner object to produce the policy
An interface for planning classes that can compute Q-values.
And interface for defining classes that check for certain conditions in states.
An extension of the StateConditionTest that is iterable.
A state mapping interface that maps one state into another state.
An interface for algorithms that can return the value for states.
This class is used as a wrapper for specifying the possible state transitions that can occur when an action is applied from a particular state (which is kept hidden).
The super class to use for all planning algorithms.
A class of helper static methods that may be commonly used code that uses a QComputable planner.
A state condition class that returns true when ever any grounded version of a specified propositional function is true in a state.
This class extends the OOMDP planner to define a class of planners that compute state value functions using the tabular Bellman update, such as ValueIteraiton.
This class is used to store tabular value function values that can be manipulated with the