Safe Haskell	Safe
Language	Haskell2010

FastDownward.Exec

Contents

Search Engines
- Search Engine Options
Abstract Tasks
Constraint Generators
Evaluators
- Evaluator Configuration
Label Reduction
Landmark Factory
Merge Scoring Function
Merge Selector
Merge Strategy
Merge Tree
Open List
Pattern Collection Generators
Pruning Method
Shrink Strategy
Subtask Generators

Synopsis

data Options = Options {
- fastDownward :: FilePath
- problem :: String
- planFilePath :: FilePath
- search :: SearchEngine
}
callFastDownward :: MonadIO m => Options -> m (ExitCode, String, String)
data SearchEngine
- = AStar AStarConfiguration
- | EagerBestFirst EagerBestFirstConfiguration
- | EagerGreedy EagerGreedyConfiguration
- | EnforcedHillClimbing EnforcedHillClimbingConfiguration
- | Iterated IteratedConfiguration
- | LazyBestFirst LazyBestFirstConfiguration
- | LazyGreedy LazyGreedyConfiguration
- | LazyWeightedAStar LazyWeightedAStarConfiguration
data AStarConfiguration = AStarConfiguration {
- evaluator :: Evaluator
- lazyEvaluator :: Maybe Evaluator
- pruning :: PruningMethod
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data EagerBestFirstConfiguration = EagerBestFirstConfiguration {
- open :: OpenList
- reopenClosed :: Bool
- fEval :: Maybe Evaluator
- preferred :: [Evaluator]
- pruning :: PruningMethod
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data EagerGreedyConfiguration = EagerGreedyConfiguration {
- evaluators :: [Evaluator]
- preferred :: [Evaluator]
- boost :: Int
- pruning :: PruningMethod
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data EnforcedHillClimbingConfiguration = EnforcedHillClimbingConfiguration {
- h :: Evaluator
- preferredUsage :: PreferredOperatorUsage
- preferred :: [Evaluator]
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data IteratedConfiguration = IteratedConfiguration {
- engines :: [SearchEngine]
- passBound :: Bool
- repeatLast :: Bool
- continueOnFail :: Bool
- continueOnSolve :: Bool
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data LazyBestFirstConfiguration = LazyBestFirstConfiguration {
- open :: OpenList
- reopenClosed :: Bool
- preferred :: [Evaluator]
- randomizeSuccessors :: Bool
- preferredSuccessorsFirst :: Bool
- randomSeed :: Maybe Int
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data LazyGreedyConfiguration = LazyGreedyConfiguration {
- evaluators :: [Evaluator]
- preferred :: [Evaluator]
- reopenClosed :: Bool
- boost :: Int
- randomizeSuccessors :: Bool
- preferredSuccessorsFirst :: Bool
- randomSeed :: Maybe Int
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data LazyWeightedAStarConfiguration = LazyWeightedAStarConfiguration {
- evaluators :: [Evaluator]
- preferred :: [Evaluator]
- reopenClosed :: Bool
- boost :: Int
- w :: Int
- randomizeSuccessors :: Bool
- preferredSuccessorsFirst :: Bool
- randomSeed :: Maybe Int
- costType :: CostType
- bound :: Maybe Int
- maxTime :: Maybe Double
}
data CostType
- = Normal
- | One
- | PlusOne
data PreferredOperatorUsage
- = PruneByPreferred
- | RankPreferredFirst
data AbstractTask
- = AdaptCost CostType
- | NoTransform
data ConstraintGenerator
- = LMCutConstraints
- | PosthocOptimizationConstraints PatternCollectionGenerator
- | StateEquationConstraints
data Evaluator
- = Add AddConfiguration
- | AllStatesPotential AllStatesPotentialConfiguration
- | Blind BlindConfiguration
- | CEA CEAConfiguration
- | CEGAR CEGARConfiguration
- | CG CGConfiguration
- | DiversePotentials DiversePotentialsConfiguration
- | FF FFConfiguration
- | GoalCount GoalCountConfiguration
- | HM HMConfiguration
- | HMax HMaxConfiguration
- | InitialStatePotential InitialStatePotentialConfiguration
- | LMCount LMCountConfiguration
- | LMCut LMCutConfiguration
- | Max [Evaluator]
- | MergeAndShrink MergeAndShrinkConfiguration
- | OperatorCounting OperatorCountingConfiguration
- | SampleBasedPotentials SampleBasedPotentialsConfiguration
- | ConstantEvaluator Int
- | G
- | Pref
- | Sum [Evaluator]
- | Weighted Evaluator Int
- | CanonicalPDB CanonicalPDBConfiguration
- | IPDB IPDBConfiguration
- | ZeroOnePDB ZeroOnePDBConfiguration
data AddConfiguration = AddConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data AllStatesPotentialConfiguration = AllStatesPotentialConfiguration {
- maxPotential :: Maybe Double
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data BlindConfiguration = BlindConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data CEAConfiguration = CEAConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data CEGARConfiguration = CEGARConfiguration {
- subtasks :: [SubtaskGenerator]
- maxStates :: Maybe Int
- maxTransitions :: Maybe Int
- maxTime :: Maybe Double
- pick :: CEGARPick
- useGeneralCosts :: Bool
- transform :: AbstractTask
- cacheEstimates :: Bool
- randomSeed :: Maybe Int
}
data CEGARPick
- = Random
- | MinUnwanted
- | MaxUnwanted
- | MinRefined
- | MaxRefined
- | MinHAdd
- | MaxHAdd
data CGConfiguration = CGConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data DiversePotentialsConfiguration = DiversePotentialsConfiguration {
- numSamples :: Maybe Int
- maxNumHeuristics :: Maybe Int
- maxPotential :: Maybe Double
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
- randomSeed :: Maybe Int
}
data FFConfiguration = FFConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data GoalCountConfiguration = GoalCountConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data HMConfiguration = HMConfiguration {
- m :: Int
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data HMaxConfiguration = HMaxConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data InitialStatePotentialConfiguration = InitialStatePotentialConfiguration {
- maxPotential :: Maybe Double
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data LMCountConfiguration = LMCountConfiguration {
- lmFactory :: LandmarkFactory
- admissible :: Bool
- optimal :: Bool
- pref :: Bool
- alm :: Bool
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data LMCutConfiguration = LMCutConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data MergeAndShrinkConfiguration = MergeAndShrinkConfiguration {
- transform :: AbstractTask
- cacheEstimates :: Bool
- mergeStrategy :: MergeStrategy
- shrinkStrategy :: ShrinkStrategy
- labelReduction :: LabelReduction
- pruneUnreachableStates :: Bool
- pruneIrrelevantStates :: Bool
- maxStates :: Maybe Int
- maxStatesBeforeMerge :: Maybe Int
- thresholdBeforeMerge :: Maybe Int
- verbosity :: Verbosity
}
data Verbosity
- = Silent
- | Basic
- | Verbose
data OperatorCountingConfiguration = OperatorCountingConfiguration {
- constraintGenerators :: [ConstraintGenerator]
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data SampleBasedPotentialsConfiguration = SampleBasedPotentialsConfiguration {
- numHeuristics :: Maybe Int
- numSamples :: Maybe Int
- maxPotential :: Maybe Double
- lpSolver :: LPSolver
- transform :: AbstractTask
- cacheEstimates :: Bool
- randomSeed :: Maybe Int
}
data CanonicalPDBConfiguration = CanonicalPDBConfiguration {
- patterns :: PatternCollectionGenerator
- maxTimeDominancePruning :: Maybe Double
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data IPDBConfiguration = IPDBConfiguration {
- pdbMaxSize :: Maybe Int
- collectionMaxSize :: Maybe Int
- numSamples :: Maybe Int
- minImprovement :: Maybe Int
- maxTime :: Maybe Double
- randomSeed :: Maybe Int
- maxTimeDominancePruning :: Maybe Double
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data ZeroOnePDBConfiguration = ZeroOnePDBConfiguration {
- patterns :: PatternCollectionGenerator
- transform :: AbstractTask
- cacheEstimates :: Bool
}
data LPSolver
- = CLP
- | CPLEX
- | GUROBI
newtype LabelReduction = ExactGeneralizedLabelReduction ExactGeneralizedLabelReductionConfiguration
data ExactGeneralizedLabelReductionConfiguration = ExactGeneralizedLabelReductionConfiguration {
- beforeShrinking :: Bool
- beforeMerging :: Bool
- method :: LabelReductionMethod
- systemOrder :: SystemOrder
- randomSeed :: Maybe Int
}
data LabelReductionMethod
- = TwoTransitionSystems
- | AllTransitionSystems
- | AllTransitionSystemsWithFixpoint
data SystemOrder
- = RegularSystemOrder
- | ReverseSystemOrder
- | RandomSystemOrder
data LandmarkFactory
- = LMExhaust LMExhaustConfiguration
- | LMHM LMHMConfiguration
- | LMMerged LMMergedConfiguration
- | LMRHW LMRHWConfiguration
- | LMZG LMZGConfiguration
data LMExhaustConfiguration = LMExhaustConfiguration {
- reasonableOrders :: Bool
- onlyCausalLandmarks :: Bool
- disjunctiveLandmarks :: Bool
- conjunctiveLandmarks :: Bool
- noOrders :: Bool
}
data LMHMConfiguration = LMHMConfiguration {
- m :: Int
- reasonableOrders :: Bool
- onlyCausalLandmarks :: Bool
- disjunctiveLandmarks :: Bool
- conjunctiveLandmarks :: Bool
- noOrders :: Bool
}
data LMMergedConfiguration = LMMergedConfiguration {
- factories :: [LandmarkFactory]
- reasonableOrders :: Bool
- onlyCausalLandmarks :: Bool
- disjunctiveLandmarks :: Bool
- conjunctiveLandmarks :: Bool
- noOrders :: Bool
}
data LMRHWConfiguration = LMRHWConfiguration {
- reasonableOrders :: Bool
- onlyCausalLandmarks :: Bool
- disjunctiveLandmarks :: Bool
- conjunctiveLandmarks :: Bool
- noOrders :: Bool
}
data LMZGConfiguration = LMZGConfiguration {
- reasonableOrders :: Bool
- onlyCausalLandmarks :: Bool
- disjunctiveLandmarks :: Bool
- conjunctiveLandmarks :: Bool
- noOrders :: Bool
}
data MergeScoringFunction
- = DFP
- | GoalRelevance
- | MIASM MIASMConfiguration
- | SingleRandom (Maybe Int)
- | TotalOrder TotalOrderConfiguration
data MIASMConfiguration = MIASMConfiguration {
- shrinkStrategy :: ShrinkStrategy
- maxStates :: Maybe Int
- maxStatesBeforeMerge :: Maybe Int
- thresholdBeforeMerge :: Maybe Int
}
data TotalOrderConfiguration = TotalOrderConfiguration {
- atomicTsOrder :: AtomicTsOrder
- productTsOrder :: ProductTsOrder
- atomicBeforeProduct :: Bool
- randomSeed :: Maybe Int
}
data AtomicTsOrder
- = ReverseLevelAtomicTs
- | LevelAtomicTs
- | RandomAtomicTs
data ProductTsOrder
- = OldToNew
- | NewToOld
- | RandomProductTsOrder
newtype MergeSelector = ScoreBasedFiltering [MergeScoringFunction]
data MergeStrategy
- = MergePrecomputed MergeTree
- | MergeSCCs MergeSCCsConfiguration
- | MergeStateless MergeSelector
data MergeSCCsConfiguration = MergeSCCsConfiguration {
- orderOfSCCs :: OrderOfSCCs
- mergeTree :: Maybe MergeTree
- mergeSelector :: Maybe MergeSelector
}
data OrderOfSCCs
- = Topological
- | ReverseTopological
- | Decreasing
- | Increasing
newtype MergeTree = LinearMergeTree LinearMergeTreeConfiguration
data LinearMergeTreeConfiguration = LinearMergeTreeConfiguration {
- randomSeed :: Maybe Int
- updateOption :: UpdateOption
- variableOrder :: VariableOrder
}
data UpdateOption
- = UseFirst
- | UseSecond
- | UseRandom
data VariableOrder
- = CGGoalLevel
- | CGGoalRandom
- | GoalCGLevel
- | RandomVariableOrder
- | LevelOrder
- | ReverseLevelOrder
data OpenList
- = Alt AltConfiguration
- | EpsilonGreedy EpsilonGreedyConfiguration
- | Pareto ParetoConfiguration
- | Single SingleConfiguration
- | Tiebreaking TiebreakingConfiguration
- | TypeBased TypeBasedConfiguration
data AltConfiguration = AltConfiguration {
- sublists :: [OpenList]
- boost :: Int
}
data EpsilonGreedyConfiguration = EpsilonGreedyConfiguration {
- eval :: Evaluator
- prefOnly :: Bool
- epsilon :: Ratio Int
- randomSeed :: Maybe Int
}
data ParetoConfiguration = ParetoConfiguration {
- evals :: [Evaluator]
- prefOnly :: Bool
- stateUniformSelection :: Bool
- randomSeed :: Maybe Int
}
data SingleConfiguration = SingleConfiguration {
- eval :: Evaluator
- prefOnly :: Bool
}
data TiebreakingConfiguration = TiebreakingConfiguration {
- evals :: [Evaluator]
- prefOnly :: Bool
- unsafePruning :: Bool
}
data TypeBasedConfiguration = TypeBasedConfiguration {
- evaluators :: [Evaluator]
- randomSeed :: Maybe Int
}
data PatternCollectionGenerator
- = Combo (Maybe Int)
- | Genetic GeneticConfiguration
- | Hillclimbing HillclimbingConfiguration
- | ManualPattern [[Int]]
- | Systematic SystematicConfiguration
data GeneticConfiguration = GeneticConfiguration {
- pdbMaxSize :: Maybe Int
- numCollections :: Maybe Int
- numEpisodes :: Maybe Int
- mutationProbability :: Ratio Int
- disjoint :: Bool
- randomSeed :: Maybe Int
}
data HillclimbingConfiguration = HillclimbingConfiguration {
- pdbMaxSize :: Maybe Int
- collectionMaxSize :: Maybe Int
- numSamples :: Maybe Int
- minImprovement :: Maybe Int
- maxTime :: Maybe Double
- randomSeed :: Maybe Int
}
data SystematicConfiguration = SystematicConfiguration {
- patternMaxSize :: Maybe Int
- onlyInterestingPatterns :: Bool
}
data PruningMethod
- = Null
- | StubbornSetsEC StubbornSetsConfiguration
- | StubbornSetsSimple StubbornSetsConfiguration
data StubbornSetsConfiguration = StubbornSetsConfiguration {
- minRequiredPruningRatio :: Ratio Int
- expansionsBeforeCheckingPruningRatio :: Maybe Int
}
data ShrinkStrategy
- = Bisimulation BisimulationConfiguration
- | FPreserving FPreservingConfiguration
- | RandomShrink (Maybe Int)
data BisimulationConfiguration = BisimulationConfiguration {
- greedy :: Bool
- atLimit :: BisimulationLimitStrategy
}
data BisimulationLimitStrategy
- = Return
- | UseUp
data FPreservingConfiguration = FPreservingConfiguration {
- randomSeed :: Maybe Int
- shrinkF :: HighLow
- shrinkH :: HighLow
}
data HighLow
- = High
- | Low
data SubtaskGenerator
- = Goals GoalsConfiguration
- | Landmarks LandmarksConfiguration
- | Original OriginalConfiguration
data GoalsConfiguration = GoalsConfiguration {
- order :: GoalsOrder
- randomSeed :: Maybe Int
}
data GoalsOrder
- = OriginalOrder
- | RandomOrder
- | HAddUp
- | HAddDown
data LandmarksConfiguration = LandmarksConfiguration {
- order :: GoalsOrder
- randomSeed :: Maybe Int
- combineFacts :: Bool
}
newtype OriginalConfiguration = OriginalConfiguration {
- copies :: Maybe Int
}

Documentation

data Options Source #

Constructors

Options
Fields fastDownward :: FilePath problem :: String planFilePath :: FilePath search :: SearchEngine

callFastDownward :: MonadIO m => Options -> m (ExitCode, String, String) Source #

Search Engines

data AStarConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#A.2A_search_.28eager.29

Constructors

AStarConfiguration
Fields evaluator :: Evaluator lazyEvaluator :: Maybe Evaluator pruning :: PruningMethod costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data EagerBestFirstConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Eager_best-first_search

Constructors

EagerBestFirstConfiguration
Fields open :: OpenList reopenClosed :: Bool fEval :: Maybe Evaluator preferred :: [Evaluator] pruning :: PruningMethod costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data EagerGreedyConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Greedy_search_.28eager.29

Constructors

EagerGreedyConfiguration
Fields evaluators :: [Evaluator] preferred :: [Evaluator] boost :: Int pruning :: PruningMethod costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data EnforcedHillClimbingConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Lazy_enforced_hill-climbing

Constructors

EnforcedHillClimbingConfiguration
Fields h :: Evaluator preferredUsage :: PreferredOperatorUsage preferred :: [Evaluator] costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data IteratedConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Iterated_search

Constructors

IteratedConfiguration
Fields engines :: [SearchEngine] passBound :: Bool repeatLast :: Bool continueOnFail :: Bool continueOnSolve :: Bool costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data LazyBestFirstConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Lazy_best-first_search

Constructors

LazyBestFirstConfiguration
Fields open :: OpenList reopenClosed :: Bool preferred :: [Evaluator] randomizeSuccessors :: Bool preferredSuccessorsFirst :: Bool randomSeed :: Maybe Int costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data LazyGreedyConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#Greedy_search_.28lazy.29

Constructors

LazyGreedyConfiguration
Fields evaluators :: [Evaluator] preferred :: [Evaluator] reopenClosed :: Bool boost :: Int randomizeSuccessors :: Bool preferredSuccessorsFirst :: Bool randomSeed :: Maybe Int costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

data LazyWeightedAStarConfiguration Source #

See http://www.fast-downward.org/Doc/SearchEngine#A.28Weighted.29_A.2A_search_.28lazy.29

Constructors

LazyWeightedAStarConfiguration
Fields evaluators :: [Evaluator] preferred :: [Evaluator] reopenClosed :: Bool boost :: Int w :: Int randomizeSuccessors :: Bool preferredSuccessorsFirst :: Bool randomSeed :: Maybe Int costType :: CostType bound :: Maybe Int maxTime :: Maybe Double

Search Engine Options

data CostType Source #

Constructors

Normal	All actions are accounted for with their real cost.
One	All actions are accounted for as unit cost.
PlusOne	All actions are accounted for as their real cost + 1 (except if all actions have original cost 1, in which case cost 1 is used). This is the behaviour known for the heuristics of the LAMA planner. This is intended to be used by the heuristics, not search engines, but is supported for both.

Instances

Show CostType Source #
Instance details Defined in FastDownward.Exec Methods showsPrec :: Int -> CostType -> ShowS # show :: CostType -> String # showList :: [CostType] -> ShowS #

data PreferredOperatorUsage Source #

Constructors

PruneByPreferred
RankPreferredFirst

Abstract Tasks

data AbstractTask Source #

See http://www.fast-downward.org/Doc/AbstractTask

Constructors

AdaptCost CostType
NoTransform

Constraint Generators

data ConstraintGenerator Source #

Constructors

LMCutConstraints
PosthocOptimizationConstraints PatternCollectionGenerator
StateEquationConstraints

Evaluators

data Evaluator Source #

See http://www.fast-downward.org/Doc/Evaluator

data AddConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Additive_heuristic

Constructors

AddConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data AllStatesPotentialConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Potential_heuristic_optimized_for_all_states

Constructors

AllStatesPotentialConfiguration
Fields maxPotential :: Maybe Double lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool

data BlindConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Blind_heuristic

Constructors

BlindConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data CEAConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Context-enhanced_additive_heuristic

Constructors

CEAConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data CEGARConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Additive_CEGAR_heuristic

Constructors

CEGARConfiguration
Fields subtasks :: [SubtaskGenerator] maxStates :: Maybe Int maxTransitions :: Maybe Int maxTime :: Maybe Double pick :: CEGARPick useGeneralCosts :: Bool transform :: AbstractTask cacheEstimates :: Bool randomSeed :: Maybe Int

data CEGARPick Source #

Constructors

Random
MinUnwanted
MaxUnwanted
MinRefined
MaxRefined
MinHAdd
MaxHAdd

data CGConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Causal_graph_heuristic

Constructors

CGConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data DiversePotentialsConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Diverse_potential_heuristics

Constructors

DiversePotentialsConfiguration
Fields numSamples :: Maybe Int maxNumHeuristics :: Maybe Int maxPotential :: Maybe Double lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool randomSeed :: Maybe Int

data FFConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#FF_heuristic

Constructors

FFConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data GoalCountConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Goal_count_heuristic

Constructors

GoalCountConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data HMConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#h.5Em_heuristic

Constructors

HMConfiguration
Fields m :: Int transform :: AbstractTask cacheEstimates :: Bool

data HMaxConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Max_heuristic

Constructors

HMaxConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data InitialStatePotentialConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Potential_heuristic_optimized_for_initial_state

Constructors

InitialStatePotentialConfiguration
Fields maxPotential :: Maybe Double lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool

data LMCountConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Landmark-count_heuristic

Constructors

LMCountConfiguration
Fields lmFactory :: LandmarkFactory admissible :: Bool optimal :: Bool pref :: Bool alm :: Bool lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool

data LMCutConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Landmark-cut_heuristic

Constructors

LMCutConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool

data MergeAndShrinkConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Merge-and-shrink_heuristic

Constructors

MergeAndShrinkConfiguration
Fields transform :: AbstractTask cacheEstimates :: Bool mergeStrategy :: MergeStrategy shrinkStrategy :: ShrinkStrategy labelReduction :: LabelReduction pruneUnreachableStates :: Bool pruneIrrelevantStates :: Bool maxStates :: Maybe Int maxStatesBeforeMerge :: Maybe Int thresholdBeforeMerge :: Maybe Int verbosity :: Verbosity

data Verbosity Source #

Constructors

Silent
Basic
Verbose

Instances

Show Verbosity Source #
Instance details Defined in FastDownward.Exec Methods showsPrec :: Int -> Verbosity -> ShowS # show :: Verbosity -> String # showList :: [Verbosity] -> ShowS #

data OperatorCountingConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Operator_counting_heuristic

Constructors

OperatorCountingConfiguration
Fields constraintGenerators :: [ConstraintGenerator] lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool

data SampleBasedPotentialsConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Sample-based_potential_heuristics

Constructors

SampleBasedPotentialsConfiguration
Fields numHeuristics :: Maybe Int numSamples :: Maybe Int maxPotential :: Maybe Double lpSolver :: LPSolver transform :: AbstractTask cacheEstimates :: Bool randomSeed :: Maybe Int

data CanonicalPDBConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Canonical_PDB

Constructors

CanonicalPDBConfiguration
Fields patterns :: PatternCollectionGenerator maxTimeDominancePruning :: Maybe Double transform :: AbstractTask cacheEstimates :: Bool

data IPDBConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#iPDB

Constructors

IPDBConfiguration
Fields pdbMaxSize :: Maybe Int collectionMaxSize :: Maybe Int numSamples :: Maybe Int minImprovement :: Maybe Int maxTime :: Maybe Double randomSeed :: Maybe Int maxTimeDominancePruning :: Maybe Double transform :: AbstractTask cacheEstimates :: Bool

data ZeroOnePDBConfiguration Source #

See http://www.fast-downward.org/Doc/Evaluator#Zero-One_PDB

Constructors

ZeroOnePDBConfiguration
Fields patterns :: PatternCollectionGenerator transform :: AbstractTask cacheEstimates :: Bool

Evaluator Configuration

data LPSolver Source #

Constructors

CLP
CPLEX
GUROBI

Instances

Show LPSolver Source #
Instance details Defined in FastDownward.Exec Methods showsPrec :: Int -> LPSolver -> ShowS # show :: LPSolver -> String # showList :: [LPSolver] -> ShowS #

Label Reduction

newtype LabelReduction Source #

Constructors

ExactGeneralizedLabelReduction ExactGeneralizedLabelReductionConfiguration

data ExactGeneralizedLabelReductionConfiguration Source #

See http://www.fast-downward.org/Doc/LabelReduction#Exact_generalized_label_reduction

Constructors

ExactGeneralizedLabelReductionConfiguration
Fields beforeShrinking :: Bool beforeMerging :: Bool method :: LabelReductionMethod systemOrder :: SystemOrder randomSeed :: Maybe Int

data LabelReductionMethod Source #

Constructors

TwoTransitionSystems
AllTransitionSystems
AllTransitionSystemsWithFixpoint

data SystemOrder Source #

Constructors

RegularSystemOrder
ReverseSystemOrder
RandomSystemOrder

Landmark Factory

data LandmarkFactory Source #

See http://www.fast-downward.org/Doc/LandmarkFactory

Constructors

LMExhaust LMExhaustConfiguration
LMHM LMHMConfiguration
LMMerged LMMergedConfiguration
LMRHW LMRHWConfiguration
LMZG LMZGConfiguration

data LMExhaustConfiguration Source #

See http://www.fast-downward.org/Doc/LandmarkFactory#Exhaustive_Landmarks

Constructors

LMExhaustConfiguration
Fields reasonableOrders :: Bool onlyCausalLandmarks :: Bool disjunctiveLandmarks :: Bool conjunctiveLandmarks :: Bool noOrders :: Bool

data LMHMConfiguration Source #

See http://www.fast-downward.org/Doc/LandmarkFactory#h.5Em_Landmarks

Constructors

LMHMConfiguration
Fields m :: Int reasonableOrders :: Bool onlyCausalLandmarks :: Bool disjunctiveLandmarks :: Bool conjunctiveLandmarks :: Bool noOrders :: Bool

data LMMergedConfiguration Source #

See http://www.fast-downward.org/Doc/LandmarkFactory#Merged_Landmarks

Constructors

LMMergedConfiguration
Fields factories :: [LandmarkFactory] reasonableOrders :: Bool onlyCausalLandmarks :: Bool disjunctiveLandmarks :: Bool conjunctiveLandmarks :: Bool noOrders :: Bool

data LMRHWConfiguration Source #

See http://www.fast-downward.org/Doc/LandmarkFactory#RHW_Landmarks.

Constructors

LMRHWConfiguration
Fields reasonableOrders :: Bool onlyCausalLandmarks :: Bool disjunctiveLandmarks :: Bool conjunctiveLandmarks :: Bool noOrders :: Bool

data LMZGConfiguration Source #

See http://www.fast-downward.org/Doc/LandmarkFactory#Zhu.2FGivan_Landmarks

Constructors

LMZGConfiguration
Fields reasonableOrders :: Bool onlyCausalLandmarks :: Bool disjunctiveLandmarks :: Bool conjunctiveLandmarks :: Bool noOrders :: Bool

Merge Scoring Function

data MergeScoringFunction Source #

See http://www.fast-downward.org/Doc/MergeScoringFunction

Constructors

DFP
GoalRelevance
MIASM MIASMConfiguration
SingleRandom (Maybe Int)
TotalOrder TotalOrderConfiguration

data MIASMConfiguration Source #

Constructors

MIASMConfiguration
Fields shrinkStrategy :: ShrinkStrategy maxStates :: Maybe Int maxStatesBeforeMerge :: Maybe Int thresholdBeforeMerge :: Maybe Int

data TotalOrderConfiguration Source #

Constructors

TotalOrderConfiguration
Fields atomicTsOrder :: AtomicTsOrder productTsOrder :: ProductTsOrder atomicBeforeProduct :: Bool randomSeed :: Maybe Int

data AtomicTsOrder Source #

Constructors

ReverseLevelAtomicTs
LevelAtomicTs
RandomAtomicTs

data ProductTsOrder Source #

Constructors

OldToNew
NewToOld
RandomProductTsOrder

Merge Selector

newtype MergeSelector Source #

Constructors

ScoreBasedFiltering [MergeScoringFunction]

Merge Strategy

data MergeStrategy Source #

See http://www.fast-downward.org/Doc/MergeStrategy

Constructors

MergePrecomputed MergeTree
MergeSCCs MergeSCCsConfiguration
MergeStateless MergeSelector

data MergeSCCsConfiguration Source #

See http://www.fast-downward.org/Doc/MergeStrategy#Merge_strategy_SSCs

Constructors

MergeSCCsConfiguration
Fields orderOfSCCs :: OrderOfSCCs mergeTree :: Maybe MergeTree mergeSelector :: Maybe MergeSelector

data OrderOfSCCs Source #

Constructors

Topological
ReverseTopological
Decreasing
Increasing

Merge Tree

newtype MergeTree Source #

Constructors

LinearMergeTree LinearMergeTreeConfiguration

data LinearMergeTreeConfiguration Source #

See http://www.fast-downward.org/Doc/MergeTree#Linear_merge_trees

Constructors

LinearMergeTreeConfiguration
Fields randomSeed :: Maybe Int updateOption :: UpdateOption variableOrder :: VariableOrder

data UpdateOption Source #

Constructors

UseFirst
UseSecond
UseRandom

data VariableOrder Source #

Constructors

CGGoalLevel
CGGoalRandom
GoalCGLevel
RandomVariableOrder
LevelOrder
ReverseLevelOrder

Open List

data OpenList Source #

See http://www.fast-downward.org/Doc/OpenList

Constructors

Alt AltConfiguration
EpsilonGreedy EpsilonGreedyConfiguration
Pareto ParetoConfiguration
Single SingleConfiguration
Tiebreaking TiebreakingConfiguration
TypeBased TypeBasedConfiguration

data AltConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Alternation_open_list

Constructors

AltConfiguration
Fields sublists :: [OpenList] boost :: Int

data EpsilonGreedyConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Epsilon-greedy_open_list

Constructors

EpsilonGreedyConfiguration
Fields eval :: Evaluator prefOnly :: Bool epsilon :: Ratio Int randomSeed :: Maybe Int

data ParetoConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Pareto_open_list

Constructors

ParetoConfiguration
Fields evals :: [Evaluator] prefOnly :: Bool stateUniformSelection :: Bool randomSeed :: Maybe Int

data SingleConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Standard_open_list

Constructors

SingleConfiguration
Fields eval :: Evaluator prefOnly :: Bool

data TiebreakingConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Tie-breaking_open_list

Constructors

TiebreakingConfiguration
Fields evals :: [Evaluator] prefOnly :: Bool unsafePruning :: Bool

data TypeBasedConfiguration Source #

See http://www.fast-downward.org/Doc/OpenList#Type-based_open_list

Constructors

TypeBasedConfiguration
Fields evaluators :: [Evaluator] randomSeed :: Maybe Int

Pattern Collection Generators

data PatternCollectionGenerator Source #

See http://www.fast-downward.org/Doc/PatternCollectionGenerator

Constructors

Combo (Maybe Int)
Genetic GeneticConfiguration
Hillclimbing HillclimbingConfiguration
ManualPattern [[Int]]
Systematic SystematicConfiguration

data GeneticConfiguration Source #

See http://www.fast-downward.org/Doc/PatternCollectionGenerator#Genetic_Algorithm_Patterns

Constructors

GeneticConfiguration
Fields pdbMaxSize :: Maybe Int numCollections :: Maybe Int numEpisodes :: Maybe Int mutationProbability :: Ratio Int disjoint :: Bool randomSeed :: Maybe Int

data HillclimbingConfiguration Source #

See http://www.fast-downward.org/Doc/PatternCollectionGenerator#hillclimbing

Constructors

HillclimbingConfiguration
Fields pdbMaxSize :: Maybe Int collectionMaxSize :: Maybe Int numSamples :: Maybe Int minImprovement :: Maybe Int maxTime :: Maybe Double randomSeed :: Maybe Int

data SystematicConfiguration Source #

See http://www.fast-downward.org/Doc/PatternCollectionGenerator#Systematically_generated_patterns

Constructors

SystematicConfiguration
Fields patternMaxSize :: Maybe Int onlyInterestingPatterns :: Bool

Pruning Method

data PruningMethod Source #

See http://www.fast-downward.org/Doc/PruningMethod

Constructors

Null
StubbornSetsEC StubbornSetsConfiguration
StubbornSetsSimple StubbornSetsConfiguration

data StubbornSetsConfiguration Source #

See http://www.fast-downward.org/Doc/PruningMethod#StubbornSetsEC

Constructors

StubbornSetsConfiguration
Fields minRequiredPruningRatio :: Ratio Int expansionsBeforeCheckingPruningRatio :: Maybe Int

Shrink Strategy

data ShrinkStrategy Source #

See http://www.fast-downward.org/Doc/ShrinkStrategy

Constructors

Bisimulation BisimulationConfiguration
FPreserving FPreservingConfiguration
RandomShrink (Maybe Int)

data BisimulationConfiguration Source #

See http://www.fast-downward.org/Doc/ShrinkStrategy#Bismulation_based_shrink_strategy

Constructors

BisimulationConfiguration
Fields greedy :: Bool atLimit :: BisimulationLimitStrategy

data BisimulationLimitStrategy Source #

Constructors

Return
UseUp

data FPreservingConfiguration Source #

See http://www.fast-downward.org/Doc/ShrinkStrategy#f-preserving_shrink_strategy

Constructors

FPreservingConfiguration
Fields randomSeed :: Maybe Int shrinkF :: HighLow shrinkH :: HighLow

data HighLow Source #

Constructors

High
Low

Instances

Show HighLow Source #
Instance details Defined in FastDownward.Exec Methods showsPrec :: Int -> HighLow -> ShowS # show :: HighLow -> String # showList :: [HighLow] -> ShowS #

Subtask Generators

data SubtaskGenerator Source #

See http://www.fast-downward.org/Doc/SubtaskGenerator

Constructors

Goals GoalsConfiguration
Landmarks LandmarksConfiguration
Original OriginalConfiguration

data GoalsConfiguration Source #

See http://www.fast-downward.org/Doc/SubtaskGenerator#goals

Constructors

GoalsConfiguration
Fields order :: GoalsOrder randomSeed :: Maybe Int

data GoalsOrder Source #

Constructors

OriginalOrder
RandomOrder
HAddUp
HAddDown

data LandmarksConfiguration Source #

See http://www.fast-downward.org/Doc/SubtaskGenerator#landmarks

Constructors

LandmarksConfiguration
Fields order :: GoalsOrder randomSeed :: Maybe Int combineFacts :: Bool

newtype OriginalConfiguration Source #

Constructors

OriginalConfiguration
Fields copies :: Maybe Int

AStar AStarConfiguration
EagerBestFirst EagerBestFirstConfiguration
EagerGreedy EagerGreedyConfiguration
EnforcedHillClimbing EnforcedHillClimbingConfiguration
Iterated IteratedConfiguration
LazyBestFirst LazyBestFirstConfiguration
LazyGreedy LazyGreedyConfiguration
LazyWeightedAStar LazyWeightedAStarConfiguration

Add AddConfiguration
AllStatesPotential AllStatesPotentialConfiguration
Blind BlindConfiguration
CEA CEAConfiguration
CEGAR CEGARConfiguration
CG CGConfiguration
DiversePotentials DiversePotentialsConfiguration
FF FFConfiguration
GoalCount GoalCountConfiguration
HM HMConfiguration
HMax HMaxConfiguration
InitialStatePotential InitialStatePotentialConfiguration
LMCount LMCountConfiguration
LMCut LMCutConfiguration
Max [Evaluator]
MergeAndShrink MergeAndShrinkConfiguration
OperatorCounting OperatorCountingConfiguration
SampleBasedPotentials SampleBasedPotentialsConfiguration
ConstantEvaluator Int
G
Pref
Sum [Evaluator]
Weighted Evaluator Int
CanonicalPDB CanonicalPDBConfiguration
IPDB IPDBConfiguration
ZeroOnePDB ZeroOnePDBConfiguration