Class Hierarchy

Go to the graphical class hierarchy

This inheritance list is sorted roughly, but not completely, alphabetically:

[detail level 1234]

►Cprobfd::algorithms::acyclic_vi::AcyclicValueIterationObserver< State, Action >	Models an observer subscribed to events of the acyclic value iteration algorithm
Cprobfd::algorithms::acyclic_vi::StatisticsObserver< State, Action >	An observer that collects basic statistics of the acyclic value iteration algorithm
Cprobfd::algorithms::ao_search::AOBase< State, Action, StateInfo >	Base class for the AO* algorithm family
►Cprobfd::algorithms::ao_search::AOBase< State, Action, internal::PerStateInformation< Action, UseInterval > >
Cprobfd::algorithms::exhaustive_ao::ExhaustiveAOSearch< State, Action, UseInterval >	Exhaustive AO* search algorithm
►Cprobfd::algorithms::ao_search::AOBase< State, Action, PerStateInformation< Action, UseInterval, true > >
Cprobfd::algorithms::ao_search::ao_star::AOStar< State, Action, UseInterval >	Implementation of the AO* algorithm
Cprobfd::approx_eq_to	Unary function object for approximate equality comparison
Cprobfd::approx_less	Unary function object for approximate inequality comparison
Cprobfd::approx_neq_to	Unary function object for approximate inequality comparison
Cprobfd::cartesian_abstractions::CEGARResult
Cprobfd::algorithms::ClearGuard< T >	Helper RAII class that ensures that containers are cleared when going out of scope
Cprobfd::CostFunction< typename, typename >	The interface specifying action and state termination costs, aswell as the goal states of a state space
►Cprobfd::CostFunction< State, Action >
►Cprobfd::MDP< State, Action >
Cprobfd::CompositeMDP< State, Action >	Composes a state space and a cost function to an MDP
Cprobfd::SimpleMDP< State, Action >	Basic interface for MDPs
Cprobfd::MDP< QuotientState, QuotientAction >
►Cprobfd::MDP< int, const ProbabilisticTransition * >
Cprobfd::SimpleMDP< int, const ProbabilisticTransition * >
►Cprobfd::MDP< StateRank, const ProjectionOperator * >
►Cprobfd::SimpleMDP< StateRank, const ProjectionOperator * >
Cprobfd::pdbs::ProjectionStateSpace	Represents the state space of a projection of a probabilistic planning task
Cprobfd::MDP< QuotientState< State, Action >, QuotientAction< Action > >
Cprobfd::MDP< typename, typename >	Basic interface for MDPs
Cprobfd::tasks::DeterminizationTask	Deterministic planning task representing the all-outcomes determinization of a probabilistic planning task
Cprobfd::Distribution< typename >	A convenience class that represents a finite probability distribution
Cprobfd::Distribution< int >
Cprobfd::Distribution< probfd::StateID >
Cprobfd::preprocessing::ECDStatistics	Contains printable statistics for the end component decomposition
Cprobfd::preprocessing::EndComponentDecomposition< State, Action >	A builder class that implements end component decomposition
Cprobfd::Evaluator< typename >	The interface representing heuristic functions
Cprobfd::Evaluator< int >
Cprobfd::Evaluator< QuotientState< State, Action > >
►Cprobfd::Evaluator< State >
►Cprobfd::heuristics::ConstantEvaluator< State >	Returns a constant estimate for each state
Cprobfd::heuristics::BlindEvaluator< State >	Returns an estimate of zero for each state
Cprobfd::heuristics::DeadEndPruningHeuristic	Uses a classical heuristic on the all-outcomes-determinization to prune dead-ends
Cprobfd::heuristics::DeterminizationCostHeuristic	Uses a classical heuristic on the all-outcomes-determinization to estimate the expected costs to reach the goal
►Cprobfd::cartesian_abstractions::FlawGenerator	Find flaws in the abstraction
Cprobfd::cartesian_abstractions::AdaptiveFlawGenerator	A flaw generator that uses an incomplete flaw generator, with a complete flaw generator as a backup
Cprobfd::cartesian_abstractions::PolicyBasedFlawGenerator	Find flaws using ILAO*
Cprobfd::algorithms::get_t< n >	Function object calling std::get<n> on its argument. Useful in ranges algorithms
►Cprobfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, StateInfoT >	The common base class for MDP h search algorithms
►Cprobfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, StateInfoT >	Extends HeuristicSearchBase with default implementations for MDPAlgorithm
Cprobfd::algorithms::heuristic_search::FRETHeuristicSearchAlgorithm< State, Action, StateInfoT >	Heuristics search algorithm that can be used within FRET
Cprobfd::algorithms::heuristic_search::HeuristicSearchBase< quotients::QuotientState< State, Action >, quotients::QuotientAction< Action >, internal::PerStateInformation< quotients::QuotientAction< Action >, UseInterval > >
►Cprobfd::algorithms::heuristic_search::HeuristicSearchBase< State, Action, internal::PerStateInformation< Action, UseInterval > >
►Cprobfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, internal::PerStateInformation< Action, UseInterval > >
►Cprobfd::algorithms::heuristic_search::FRETHeuristicSearchAlgorithm< State, Action, internal::PerStateInformation< Action, UseInterval > >
Cprobfd::algorithms::heuristic_depth_first_search::HeuristicDepthFirstSearch< State, Action, UseInterval >	Implementation of the depth-first heuristic search algorithm family [12]
Cprobfd::algorithms::lrtdp::LRTDP< State, Action, UseInterval >	Implements the labelled real-time dynamic programming (LRTDP) algorithm [3]
Cprobfd::occupation_measures::HigherOrderHPOMGenerator	Implements the optimal operator cost partitioning heuristic over a set of PDBs
Cprobfd::occupation_measures::HPOMGenerator	Implements the projection occupation measure heuristic constraints [13]
Cprobfd::occupation_measures::HROCGenerator	Implements the regrouped operator counting heuristic constraints [13]
Cprobfd::cartesian_abstractions::ILAOPolicyGenerator	Find an optimal policy using ILAO*
Cprobfd::Interval	Represents a closed interval over the extended reals as a pair of lower and upper bound
Cprobfd::ItemProbabilityPair< T, PrType >	An item-probability pair
Cprobfd::ItemProbabilityPair< AlgorithmValueType * >
Cprobfd::ItemProbabilityPair< probfd::StateID >
Cprobfd::pdbs::MatchTree	Applicable actions generator for projections
►Cprobfd::MDPAlgorithm< State, Action >	Interface for MDP algorithm implementations
Cprobfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, internal::PerStateInformation< Action, UseInterval > >
Cprobfd::algorithms::acyclic_vi::AcyclicValueIteration< State, Action >	Implements acyclic Value Iteration
Cprobfd::algorithms::exhaustive_dfs::ExhaustiveDepthFirstSearch< State, Action, UseInterval >	Implementation of an anytime topological value iteration variant
Cprobfd::algorithms::fret::FRET< typename, typename, typename, typename >	Implemetation of the Find-Revise-Eliminate-Traps (FRET) framework [9]
Cprobfd::algorithms::heuristic_search::HeuristicSearchAlgorithm< State, Action, StateInfoT >	Extends HeuristicSearchBase with default implementations for MDPAlgorithm
Cprobfd::algorithms::idual::IDual< State, Action >	Implementation of the I-Dual algorithm [14]
Cprobfd::algorithms::interval_iteration::IntervalIteration< State, Action >	Implemention of interval iteration [7]
Cprobfd::algorithms::ta_topological_vi::TATopologicalValueIteration< State, Action, UseInterval >	Implements a trap-aware variant of Topological Value Iteration
Cprobfd::algorithms::topological_vi::TopologicalValueIteration< State, Action, UseInterval >	Implements Topological Value Iteration [5]
►Cprobfd::MDPAlgorithm< QState, QAction >
Cprobfd::algorithms::topological_vi::TopologicalValueIteration< QState, QAction, true >
Cprobfd::MDPAlgorithm< State, OperatorID >
Cprobfd::MultiPolicy< typename, typename >	Represents a policy that can specify a set of actions for a state
►Cprobfd::MultiPolicy< State, Action >
Cprobfd::Policy< State, Action >
Cprobfd::Policy< typename, typename >	Represents a deterministic, stationary, partial policy
Cprobfd::no_normalize_t	Disambiguator tag type
Cprobfd::algorithms::OpenList< typename >	An interface for open lists used during search algorithms
Cprobfd::algorithms::OpenList< Action >
Cprobfd::overloaded< Ts >
Cprobfd::pdbs::PatternCollectionGeneratorClassical	The classical pattern generator adapter
Cprobfd::PolicyDecision< Action >	Stores an action and a bounding interval for the Q* value of this action
►Cprobfd::algorithms::PolicyPicker< State, Action >	An strategy interface used to choose break ties between multiple greedy actions for a state
Cprobfd::policy_pickers::StablePolicyPicker< State, Action, ArbitraryTiebreaker< State, Action > >
Cprobfd::policy_pickers::StablePolicyPicker< State, Action, RandomTiebreaker< State, Action > >
Cprobfd::policy_pickers::StablePolicyPicker< State, Action, VDiffTiebreaker< State, Action > >
Cprobfd::policy_pickers::StablePolicyPicker< State, Action, Derived >	CRTP base class for stable policy picker implementations
►Cprobfd::algorithms::PolicyPicker< quotients::QuotientState< int, const ProbabilisticTransition * >, quotients::QuotientAction< const ProbabilisticTransition * > >
Cprobfd::policy_pickers::StablePolicyPicker< quotients::QuotientState< int, const ProbabilisticTransition * >, quotients::QuotientAction< const ProbabilisticTransition * >, ArbitraryTiebreaker< quotients::QuotientState< int, const ProbabilisticTransition * >, quotients::QuotientAction< const ProbabilisticTransition * > > >
►Cprobfd::algorithms::PolicyPicker< State, OperatorID >
Cprobfd::policy_pickers::StablePolicyPicker< State, OperatorID, OperatorIdTiebreaker >
Cprobfd::ProbabilisticEffectConditionsProxy	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
Cprobfd::ProbabilisticEffectProxy	Proxy class used to inspect a probabilistic effect of a probabilistic operator
Cprobfd::ProbabilisticEffectsProxy	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
Cprobfd::ProbabilisticOperatorProxy	Proxy class used to inspect a single probabilistic operator
Cprobfd::ProbabilisticOperatorsProxy	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
Cprobfd::ProbabilisticOutcomeProxy	Proxy class used to inspect a single probabilistic outcome of a probabilistic operator
Cprobfd::ProbabilisticOutcomesProxy	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
Cprobfd::ProbabilisticTask	Represents a probabilistic planning task with axioms and conditional effects
Cprobfd::ProbabilisticTaskProxy	Proxy class used to inspect a probabilistic planning task
Cprobfd::pdbs::ProbabilityAwarePatternDatabase	Implementation of a probability-aware pattern database
Cprobfd::ProgressReport	A registry for print functions related to search progress
Cprobfd::pdbs::ProjectionOperator	Represents an operator of a projection state space
Cprobfd::pdbs::ProjectionOperatorToString	Helper class to convert projection operators to strings
Cprobfd::preprocessing::QualitativeReachabilityAnalysis< State, Action >	Algorithm that computes all dead-ends and states with a goal probability of one which are reachable from a given initial state
Cprobfd::preprocessing::QualitativeReachabilityAnalysis< QState, QAction >
►Cprobfd::SolverInterface	An interface that describes an MDP solver
Cprobfd::solvers::MDPSolver	Base interface for MDP solvers
Cprobfd::StateID	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
Cprobfd::algorithms::StateProperties	Interface providing access to various state properties during heuristic search
Cprobfd::pdbs::StateRankingFunction	Implements the state ranking function for abstract states of projections
►Cprobfd::StateSpace< State, Action >	An interface representing a Markov Decision Process (MDP) without objective function
Cprobfd::MDP< State, Action >
Cprobfd::MDP< QuotientState, QuotientAction >
Cprobfd::MDP< int, const ProbabilisticTransition * >
Cprobfd::MDP< StateRank, const ProjectionOperator * >
Cprobfd::MDP< QuotientState< State, Action >, QuotientAction< Action > >
Cprobfd::MDP< typename, typename >	Basic interface for MDPs
Cprobfd::algorithms::heuristic_search::internal::Statistics	Base statistics for MDP h search
Cprobfd::algorithms::idual::Statistics	I-Dual algorithm statistics
Cprobfd::algorithms::ta_topological_vi::Statistics	Topological value iteration statistics
Cprobfd::algorithms::topological_vi::Statistics	Topological value iteration statistics
Cprobfd::algorithms::SuccessorSampler< typename >	An interface used to sample a state from a successor distribution
Cprobfd::algorithms::SuccessorSampler< Action >
Cprobfd::TerminationInfo	Specifies the termination cost and goal status of a state
Cprobfd::algorithms::TransitionSorter< State, Action >	An interface used to reorder a list of transitions