Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 12345]

►Nprobfd	The top-level namespace of probabilistic Fast Downward
►Nalgorithms	This namespace contains implementations of SSP search algorithms
►Nacyclic_vi	Namespace dedicated to the acyclic value iteration algorithm
CAcyclicValueIteration	Implements acyclic Value Iteration
CAcyclicValueIterationObserver	Models an observer subscribed to events of the acyclic value iteration algorithm
CStatisticsObserver	An observer that collects basic statistics of the acyclic value iteration algorithm
►Nao_search	Namespace dedicated to the AO* family of MDP algorithms
►Nao_star	Namespace dedicated to the AO* algorithm
CAOStar	Implementation of the AO* algorithm
CAOBase	Base class for the AO* algorithm family
►Nexhaustive_ao	I do not know this algorithm
CExhaustiveAOSearch	Exhaustive AO* search algorithm
►Nexhaustive_dfs	Namespace for anytime TVI
CExhaustiveDepthFirstSearch	Implementation of an anytime topological value iteration variant
►Nfret	Namespace dedicated to the Find, Revise, Eliminate Traps (FRET) framework
CFRET	Implemetation of the Find-Revise-Eliminate-Traps (FRET) framework [9]
►Nheuristic_depth_first_search	Namespace dedicated to Depth-First Heuristic Search
CHeuristicDepthFirstSearch	Implementation of the depth-first heuristic search algorithm family [12]
►Nheuristic_search	Namespace dedicated to the MDP h search base implementation
►Ninternal
CStatistics	Base statistics for MDP h search
CFRETHeuristicSearchAlgorithm	Heuristics search algorithm that can be used within FRET
CHeuristicSearchAlgorithm	Extends HeuristicSearchBase with default implementations for MDPAlgorithm
CHeuristicSearchBase	The common base class for MDP h search algorithms
►Nidual	Namespace dedicated to the i-dual MDP algorithm
CIDual	Implementation of the I-Dual algorithm [14]
CStatistics	I-Dual algorithm statistics
►Ninterval_iteration	Namespace dedicated to interval iteration on MaxProb MDPs
CIntervalIteration	Implemention of interval iteration [7]
►Nlrtdp	Namespace dedicated to labelled real-time dynamic programming (LRTDP)
CLRTDP	Implements the labelled real-time dynamic programming (LRTDP) algorithm [3]
►Nta_topological_vi	Namespace dedicated to trap-aware Topological Value Iteration (TATVI)
CStatistics	Topological value iteration statistics
CTATopologicalValueIteration	Implements a trap-aware variant of Topological Value Iteration
►Ntopological_vi	Namespace dedicated to Topological Value Iteration (TVI)
CStatistics	Topological value iteration statistics
CTopologicalValueIteration	Implements Topological Value Iteration [5]
CClearGuard	Helper RAII class that ensures that containers are cleared when going out of scope
Cget_t	Function object calling std::get<n> on its argument. Useful in ranges algorithms
COpenList	An interface for open lists used during search algorithms
CPolicyPicker	An strategy interface used to choose break ties between multiple greedy actions for a state
CStateProperties	Interface providing access to various state properties during heuristic search
CSuccessorSampler	An interface used to sample a state from a successor distribution
CTransitionSorter	An interface used to reorder a list of transitions
►Ncartesian_abstractions
CAdaptiveFlawGenerator	A flaw generator that uses an incomplete flaw generator, with a complete flaw generator as a backup
CCEGARResult
CFlawGenerator	Find flaws in the abstraction
CILAOPolicyGenerator	Find an optimal policy using ILAO*
CPolicyBasedFlawGenerator	Find flaws using ILAO*
►Nheuristics	This namespace contains heuristic implementations
CBlindEvaluator	Returns an estimate of zero for each state
CConstantEvaluator	Returns a constant estimate for each state
CDeadEndPruningHeuristic	Uses a classical heuristic on the all-outcomes-determinization to prune dead-ends
CDeterminizationCostHeuristic	Uses a classical heuristic on the all-outcomes-determinization to estimate the expected costs to reach the goal
CLPHeuristic	Base class for heuristics based on linear programming
COccupationMeasureHeuristic	Implements an occupation measure heuristic built from the specified LP constraints
CProbabilityAwarePDBHeuristic	The probability-aware PDB heuristic
►Noccupation_measures	Namespace dedicated to occupation measure heuristic base classes
CHigherOrderHPOMGenerator	Implements the optimal operator cost partitioning heuristic over a set of PDBs
CHPOMGenerator	Implements the projection occupation measure heuristic constraints [13]
CHROCGenerator	Implements the regrouped operator counting heuristic constraints [13]
►Npdbs	Namespace dedicated to probabilistic pattern databases
CMatchTree	Applicable actions generator for projections
CPatternCollectionGeneratorClassical	The classical pattern generator adapter
CProbabilityAwarePatternDatabase	Implementation of a probability-aware pattern database
CProjectionOperator	Represents an operator of a projection state space
CProjectionOperatorToString	Helper class to convert projection operators to strings
CProjectionStateSpace	Represents the state space of a projection of a probabilistic planning task
CStateRankingFunction	Implements the state ranking function for abstract states of projections
►Npolicy_pickers
CStablePolicyPicker	CRTP base class for stable policy picker implementations
►Npreprocessing	This namespace contains preprocessing algorithms for SSPs
CECDStatistics	Contains printable statistics for the end component decomposition
CEndComponentDecomposition	A builder class that implements end component decomposition
CQualitativeReachabilityAnalysis	Algorithm that computes all dead-ends and states with a goal probability of one which are reachable from a given initial state
►Nsolvers	This namespace contains the solver interface base class for various search algorithms
CMDPSolver	Base interface for MDP solvers
►Ntasks	This namespace contains implementations of probabilistic planning tasks
CDeterminizationTask	Deterministic planning task representing the all-outcomes determinization of a probabilistic planning task
Capprox_eq_to	Unary function object for approximate equality comparison
Capprox_less	Unary function object for approximate inequality comparison
Capprox_neq_to	Unary function object for approximate inequality comparison
CCompositeMDP	Composes a state space and a cost function to an MDP
CCostFunction	The interface specifying action and state termination costs, aswell as the goal states of a state space
CDistribution	A convenience class that represents a finite probability distribution
CEvaluator	The interface representing heuristic functions
CInterval	Represents a closed interval over the extended reals as a pair of lower and upper bound
CItemProbabilityPair	An item-probability pair
CMDP	Basic interface for MDPs
CMDPAlgorithm	Interface for MDP algorithm implementations
CMultiPolicy	Represents a policy that can specify a set of actions for a state
Cno_normalize_t	Disambiguator tag type
Coverloaded
CPolicy	Represents a deterministic, stationary, partial policy
CPolicyDecision	Stores an action and a bounding interval for the Q* value of this action
CProbabilisticEffectConditionsProxy	Proxy class used to inspect the list of effect conditions of a conditional effect of a probabilistic operator. Can be used as a range of FactProxies, one for each effect condition
CProbabilisticEffectProxy	Proxy class used to inspect a probabilistic effect of a probabilistic operator
CProbabilisticEffectsProxy	Proxy class used to inspect the list of probabilistic effects of a probabilistic operator. Can be used as a range of ProbabilisticEffectProxies, one for each probabilistic effect
CProbabilisticOperatorProxy	Proxy class used to inspect a single probabilistic operator
CProbabilisticOperatorsProxy	Proxy class used to inspect a list of probabilistic operators of a probabilistic task. Can be used as a range of ProbabilisticOperatorProxies, one for each probabilistic operator
CProbabilisticOutcomeProxy	Proxy class used to inspect a single probabilistic outcome of a probabilistic operator
CProbabilisticOutcomesProxy	Proxy class used to inspect the list of probabilistic outcomes of a probabilistic operator. Can be used as a range of ProbabilisticOutcomeProxies, one for each probabilistic outcome
CProbabilisticTask	Represents a probabilistic planning task with axioms and conditional effects
CProbabilisticTaskProxy	Proxy class used to inspect a probabilistic planning task
CProgressReport	A registry for print functions related to search progress
CSimpleMDP	Basic interface for MDPs
CSolverInterface	An interface that describes an MDP solver
CStateID	A StateID represents a state within a StateIDMap. Just like Fast Downward's StateID type, it is trivial to copy and intended for long term storage
CStateSpace	An interface representing a Markov Decision Process (MDP) without objective function
CTerminationInfo	Specifies the termination cost and goal status of a state