A B C D E F G H I M O P R S T U
All Classes All Packages
All Classes All Packages
All Classes All Packages
A
- Action - Class in ai.libs.jaicore.planning.core
- Action(Operation, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.core.Action
- AForwardDecompositionReducer<I1 extends IHTNPlanningProblem,O1 extends IPlan,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<TFDNode,java.lang.String>,O2 extends ai.libs.jaicore.search.model.other.SearchGraphPath<TFDNode,java.lang.String>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- AForwardDecompositionReducer() - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.AForwardDecompositionReducer
- ai.libs.jaicore.planning.classical.algorithms.strips.forward - package ai.libs.jaicore.planning.classical.algorithms.strips.forward
- ai.libs.jaicore.planning.classical.problems.ce - package ai.libs.jaicore.planning.classical.problems.ce
- ai.libs.jaicore.planning.classical.problems.ceoc - package ai.libs.jaicore.planning.classical.problems.ceoc
- ai.libs.jaicore.planning.classical.problems.strips - package ai.libs.jaicore.planning.classical.problems.strips
- ai.libs.jaicore.planning.core - package ai.libs.jaicore.planning.core
- ai.libs.jaicore.planning.core.events - package ai.libs.jaicore.planning.core.events
- ai.libs.jaicore.planning.core.interfaces - package ai.libs.jaicore.planning.core.interfaces
- ai.libs.jaicore.planning.hierarchical.algorithms - package ai.libs.jaicore.planning.hierarchical.algorithms
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd - package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- ai.libs.jaicore.planning.hierarchical.problems.ceocipstn - package ai.libs.jaicore.planning.hierarchical.problems.ceocipstn
- ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters - package ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters
- ai.libs.jaicore.planning.hierarchical.problems.ceocstn - package ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters - package ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters
- ai.libs.jaicore.planning.hierarchical.problems.htn - package ai.libs.jaicore.planning.hierarchical.problems.htn
- ai.libs.jaicore.planning.hierarchical.problems.rtn - package ai.libs.jaicore.planning.hierarchical.problems.rtn
- ai.libs.jaicore.planning.hierarchical.problems.stn - package ai.libs.jaicore.planning.hierarchical.problems.stn
- AShop2Converter - Class in ai.libs.jaicore.planning.hierarchical.problems.htn
- AShop2Converter() - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.htn.AShop2Converter
B
- BestFirstForwardDecompositionReducer<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- BestFirstForwardDecompositionReducer() - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- BestFirstForwardDecompositionReducer(INodeEvaluator<TFDNode, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- BestFirstForwardDecompositionReducer(GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode, String, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- BlindForwardDecompositionHTNPlanner<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- BlindForwardDecompositionHTNPlanner(CostSensitiveHTNPlanningProblem<IHTNPlanningProblem, V>, INodeEvaluator<TFDNode, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BlindForwardDecompositionHTNPlanner
C
- CEAction - Class in ai.libs.jaicore.planning.classical.problems.ce
- CEAction(CEOperation, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ce.CEAction
- CEOCAction - Class in ai.libs.jaicore.planning.classical.problems.ceoc
- CEOCAction(CEOCOperation, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCAction
- CEOCIPSTN2JSHOP2 - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters
- CEOCIPSTN2JSHOP2() - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
- CEOCIPSTNPlanningDomain - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocipstn
- CEOCIPSTNPlanningDomain(Collection<? extends CEOCOperation>, Collection<? extends OCIPMethod>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningDomain
- CEOCIPSTNPlanningProblem - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocipstn
- CEOCIPSTNPlanningProblem(CEOCIPSTNPlanningDomain, CNFFormula, Monom, TaskNetwork, Map<String, EvaluablePredicate>, Map<String, OracleTaskResolver>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- CEOCIPTFDGraphGenerator - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd
-
Graph Generator for HTN planning where (i) operations have conditional effects, (ii) operations may create new objects, and (iii) method preconditions may contain evaluable predicates.
- CEOCIPTFDGraphGenerator(CEOCIPSTNPlanningProblem) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd.CEOCIPTFDGraphGenerator
- CEOCOperation - Class in ai.libs.jaicore.planning.classical.problems.ceoc
- CEOCOperation(String, String, Monom, Map<CNFFormula, Monom>, Map<CNFFormula, Monom>, String) - Constructor for class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- CEOCOperation(String, List<VariableParam>, Monom, Map<CNFFormula, Monom>, Map<CNFFormula, Monom>, List<VariableParam>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- CEOCPlanningDomain - Class in ai.libs.jaicore.planning.classical.problems.ceoc
- CEOCPlanningDomain(Collection<CEOCOperation>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCPlanningDomain
- CEOCPlanningProblem - Class in ai.libs.jaicore.planning.classical.problems.ceoc
- CEOCPlanningProblem(CEOCPlanningDomain, Monom, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCPlanningProblem
- CEOCSTN2Shop2 - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters
- CEOCSTN2Shop2() - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
- CEOCSTNPlanningDomain - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- CEOCSTNPlanningDomain(Collection<? extends CEOCOperation>, Collection<? extends OCMethod>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningDomain
- CEOCSTNPlanningProblem - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- CEOCSTNPlanningProblem(CEOCSTNPlanningDomain, CNFFormula, Monom, TaskNetwork) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningProblem
- CEOCSTNUtil - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- CEOCSTNUtil() - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNUtil
- CEOCTFDGraphGenerator - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd
- CEOCTFDGraphGenerator(CEOCSTNPlanningProblem) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd.CEOCTFDGraphGenerator
- CEOperation - Class in ai.libs.jaicore.planning.classical.problems.ce
- CEOperation(String, String, Monom, Map<CNFFormula, Monom>, Map<CNFFormula, Monom>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- CEOperation(String, List<VariableParam>, Monom, Map<CNFFormula, Monom>, Map<CNFFormula, Monom>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- CEPlanningDomain - Class in ai.libs.jaicore.planning.classical.problems.ce
- CEPlanningDomain(Collection<CEOperation>) - Constructor for class ai.libs.jaicore.planning.classical.problems.ce.CEPlanningDomain
- CEPlanningProblem - Class in ai.libs.jaicore.planning.classical.problems.ce
- CEPlanningProblem(CEPlanningDomain, Monom, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.ce.CEPlanningProblem
- checkValidity() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningDomain
- checkValidity() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- clear() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- convertPathToSolution(List<Action>) - Method in interface ai.libs.jaicore.planning.core.interfaces.SolutionPathConverter
- CostSensitiveGraphSearchBasedHTNPlanningAlgorithm<P extends IHTNPlanningProblem,S extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms
- CostSensitiveGraphSearchBasedHTNPlanningAlgorithm(P, AlgorithmicProblemReduction<P, IEvaluatedGraphSearchBasedPlan<N, A, V>, S, EvaluatedSearchGraphPath<N, A, V>>, IAlgorithmFactory<S, EvaluatedSearchGraphPath<N, A, V>>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.CostSensitiveGraphSearchBasedHTNPlanningAlgorithm
- CostSensitiveGraphSearchBasedPlanningAlgorithm<I1,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms
- CostSensitiveGraphSearchBasedPlanningAlgorithm(I1, AlgorithmicProblemReduction<I1, IEvaluatedGraphSearchBasedPlan<N, A, V>, I2, EvaluatedSearchGraphPath<N, A, V>>, IAlgorithmFactory<I2, EvaluatedSearchGraphPath<N, A, V>>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.CostSensitiveGraphSearchBasedPlanningAlgorithm
- CostSensitiveHTNPlanningProblem<P extends IHTNPlanningProblem,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.problems.htn
- CostSensitiveHTNPlanningProblem(P, IObjectEvaluator<IPlan, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- CostSensitivePlanningToSearchProblemReduction<N,A,V extends java.lang.Comparable<V>,I1 extends IHTNPlanningProblem,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,O2 extends ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>> - Class in ai.libs.jaicore.planning.hierarchical.problems.htn
- CostSensitivePlanningToSearchProblemReduction(IHierarchicalPlanningToGraphSearchReduction<N, A, I1, IPlan, GraphSearchInput<N, A>, SearchGraphPath<N, A>>, AlgorithmicProblemReduction<? super GraphSearchWithPathEvaluationsInput<N, A, V>, ? super EvaluatedSearchGraphPath<N, A, V>, I2, O2>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToSearchProblemReduction
- CostSensitivePlanningToStandardSearchProblemReduction<N,A,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.problems.htn
- CostSensitivePlanningToStandardSearchProblemReduction(IHierarchicalPlanningToGraphSearchReduction<N, A, IHTNPlanningProblem, IPlan, GraphSearchInput<N, A>, SearchGraphPath<N, A>>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToStandardSearchProblemReduction
D
- decodeSolution(EvaluatedSearchGraphPath<TFDNode, String, V>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- decodeSolution(SearchGraphPath<StripsForwardPlanningNode, String>) - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.STRIPSForwardSearchReducer
- decodeSolution(SearchGraphPath<TFDNode, String>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.SimpleForwardDecompositionReducer
- decodeSolution(O2) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToSearchProblemReduction
E
- encodeProblem(StripsPlanningProblem) - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.STRIPSForwardSearchReducer
- encodeProblem(CostSensitiveHTNPlanningProblem<IHTNPlanningProblem, V>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- encodeProblem(CostSensitiveHTNPlanningProblem<I1, V>) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToSearchProblemReduction
-
This method operates in three steps: 1) it derives a general graph search problem from the given planning problem 2) it combines the obtained graph search problem with a path evaluation function into a GrahhSearchWithPathEvaluationsInput 3) it derives a potentially more informed GraphSearchInput The last process is called the forward reduction.
- encodeProblem(IHTNPlanningProblem) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.SimpleForwardDecompositionReducer
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningDomain
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsAction
- equals(Object) - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- equals(Object) - Method in class ai.libs.jaicore.planning.core.Action
- equals(Object) - Method in class ai.libs.jaicore.planning.core.Plan
- equals(Object) - Method in class ai.libs.jaicore.planning.core.SearchGraphBasedPlan
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.OCMethod
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- equals(Object) - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- EvaluatedPlan<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.core
- EvaluatedPlan(IPlan, V) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedPlan
- EvaluatedPlan(List<Action>, V) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedPlan
- EvaluatedSearchGraphBasedPlan<N,A,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.core
- EvaluatedSearchGraphBasedPlan(IEvaluatedPlan<V>, SearchGraphPath<N, A>) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan
- EvaluatedSearchGraphBasedPlan(IPlan, EvaluatedSearchGraphPath<N, A, V>) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan
- EvaluatedSearchGraphBasedPlan(IPlan, V, SearchGraphPath<N, A>) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan
- EvaluatedSearchGraphBasedPlan(List<Action>, V, SearchGraphPath<N, A>) - Constructor for class ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan
- extractPlanFromSolutionPath(List<TFDNode>) - Static method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNUtil
F
- ForwardDecompositionHTNPlanner<P extends IHTNPlanningProblem,V extends java.lang.Comparable<V>,S extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<TFDNode,java.lang.String>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- ForwardDecompositionHTNPlanner(P, AForwardDecompositionReducer<P, IEvaluatedGraphSearchBasedPlan<TFDNode, String, V>, S, EvaluatedSearchGraphPath<TFDNode, String, V>>, IOptimalPathInORGraphSearchFactory<S, TFDNode, String, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.ForwardDecompositionHTNPlanner
- ForwardDecompositionHTNPlannerBasedOnBestFirst<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- ForwardDecompositionHTNPlannerBasedOnBestFirst(CostSensitiveHTNPlanningProblem<IHTNPlanningProblem, V>, INodeEvaluator<TFDNode, V>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.ForwardDecompositionHTNPlannerBasedOnBestFirst
G
- generateInfoForNode(StripsForwardPlanningNode) - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsNodeInfoGenerator
- generateInfoForNode(List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeInfoGenerator
- getActions() - Method in interface ai.libs.jaicore.planning.core.interfaces.IPlan
- getActions() - Method in class ai.libs.jaicore.planning.core.Plan
- getActionsForPrimitiveTaskThatAreApplicableInState(CNFFormula, Operation, Literal, Monom) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getActionToReachState() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- getAdd() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- getAddList() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsAction
- getAddList() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- getAddLists() - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEAction
- getAddLists() - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- getAnnotations() - Method in class ai.libs.jaicore.planning.core.Plan
- getApplicableActionsInState(Monom, StripsPlanningDomain) - Static method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- getApplicableActionsInState(Monom, StripsPlanningDomain, boolean, int) - Static method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- getAppliedAction() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNEdge
- getAppliedAction() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- getAppliedMethodInstance() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- getBlocksWorldProblem() - Static method in class ai.libs.jaicore.planning.classical.problems.strips.StandardProblemFactory
- getClassesThatAreInAClusterThatNeedsToBeRefined(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClassesThatAreInAnyCluster(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClassesThatAreIsolated(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClassesThatAreNotIsolated(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClassesThatExistInState(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClassesThatRemainToBeSeparated(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClustersThatExistInState(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getClustersThatWillBeRefined(RTNNode) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- getContextRecreator() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNEdge
- getCorePlanningProblem() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getDel() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- getDeleteList() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsAction
- getDeleteList() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- getDeleteLists() - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEAction
- getDeleteLists() - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- getDockworkerProblem() - Static method in class ai.libs.jaicore.planning.classical.problems.strips.StandardProblemFactory
- getDomain() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsPlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getDomain() - Method in interface ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- getDomain() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- getEncoding() - Method in class ai.libs.jaicore.planning.core.Action
- getEncoding() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getEvaluablePlanningPredicates() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getEvaluablePlanningPredicates() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- getEvaluablePrecondition() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- getGoalState() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- getGoalStateFunction() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- getGoalTester() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningGraphGenerator
- getGoalTester() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNGraphGenerator
- getGoalTester() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- getGraphSearchInput(I1) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.AForwardDecompositionReducer
- getGrounding() - Method in class ai.libs.jaicore.planning.core.Action
- getGrounding() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getId() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- getInit() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getInit() - Method in interface ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem
- getInit() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- getInit() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- getInitState() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- getKnowledge() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getKnowledge() - Method in interface ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem
- getKnowledge() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- getMethod() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getMethodInstance() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNEdge
- getMethodInstancesForTaskThatAreApplicableInState(CNFFormula, Method, Literal, Monom, List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getMethodInstancesForTaskThatAreApplicableInState(CNFFormula, Collection<? extends Method>, Literal, Monom, List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getMethods() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningDomain
- getMethods() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningDomain
- getMethods() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningDomain
- getMethods() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- getName() - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- getName() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- getNetwork() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getNetwork() - Method in interface ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem
- getNetwork() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- getNetwork() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- getNetwork() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getNetwork() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- getOperation() - Method in class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCAction
- getOperation() - Method in class ai.libs.jaicore.planning.core.Action
- getOperations() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningDomain
- getOperations() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNPlanningDomain
- getOperations() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- getOperationWithName(STNPlanningDomain, String) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getOracleResolvers() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- getOutputs() - Method in class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- getOutputs() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.OCMethod
- getParameters() - Method in class ai.libs.jaicore.planning.core.Action
- getParameters() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- getParameters() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getParams() - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- getPathOfNode(TFDNode, Map<TFDNode, TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeUtil
- getPlanEvaluator() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- getPlanForSolution(SearchGraphPath<TFDNode, String>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.AForwardDecompositionReducer
- getPossibleOperationGroundingsForState(Monom, StripsOperation, int) - Static method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- getPrecondition() - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- getPrecondition() - Method in class ai.libs.jaicore.planning.core.Action
- getPrecondition() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- getPrecondition() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- getProblem() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- getReducers() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTaskNetwork
- getRemainingTasks() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- getRemainingTasks() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- getRemainingTasks() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- getRemainingTasks(List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeUtil
- getRestProblem(List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeUtil
- getRootGenerator() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningGraphGenerator
- getRootGenerator() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNGraphGenerator
- getRootGenerator() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- getScore() - Method in class ai.libs.jaicore.planning.core.EvaluatedPlan
- getScore() - Method in class ai.libs.jaicore.planning.core.events.PlanFoundEvent
- getSearchGraphPath() - Method in class ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan
- getSearchGraphPath() - Method in interface ai.libs.jaicore.planning.core.interfaces.IGraphSearchBasedPlan
- getSearchGraphPath() - Method in class ai.libs.jaicore.planning.core.SearchGraphBasedPlan
- getState() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- getState() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- getState() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- getState(List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeUtil
- getStateAfterApplicationGivenInitState(Monom) - Method in class ai.libs.jaicore.planning.core.Plan
- getStateAfterPlanExecution(Monom, Plan) - Static method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- getStateAfterPlanExecution(Monom, List<CEOCAction>) - Static method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.CEOCSTNUtil
- getStateRelativeToInitState(Monom) - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- getSubSolutions(Monom, Literal) - Method in interface ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd.OracleTaskResolver
- getSuccessorGenerator() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningGraphGenerator
- getSuccessorGenerator() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNGraphGenerator
- getSuccessorGenerator() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- getSuccessorsResultingFromResolvingComplexTask(Monom, Literal, List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- getSuccessorsResultingFromResolvingPrimitiveTask(Monom, Literal, List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- getTask() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- getTaskChainOfTotallyOrderedNetwork(TaskNetwork) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- getTransformer() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- GoalStateFunction - Interface in ai.libs.jaicore.planning.classical.problems.strips
- GraphSearchBasedPlanningAlgorithm<I1,O1 extends IGraphSearchBasedPlan<N,A>,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,O2 extends ai.libs.jaicore.search.model.other.SearchGraphPath<N,A>,N,A> - Class in ai.libs.jaicore.planning.hierarchical.algorithms
- GraphSearchBasedPlanningAlgorithm(I1, AlgorithmicProblemReduction<I1, O1, I2, O2>, IAlgorithmFactory<I2, O2>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.GraphSearchBasedPlanningAlgorithm
H
- hashCode() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.ce.CEOperation
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningDomain
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsAction
- hashCode() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- hashCode() - Method in class ai.libs.jaicore.planning.core.Action
- hashCode() - Method in class ai.libs.jaicore.planning.core.Plan
- hashCode() - Method in class ai.libs.jaicore.planning.core.SearchGraphBasedPlan
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.OCMethod
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- hashCode() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
I
- IEvaluatedGraphSearchBasedPlan<N,A,V extends java.lang.Comparable<V>> - Interface in ai.libs.jaicore.planning.core.interfaces
- IEvaluatedPlan<V extends java.lang.Comparable<V>> - Interface in ai.libs.jaicore.planning.core.interfaces
- IGraphSearchBasedPlan<N,A> - Interface in ai.libs.jaicore.planning.core.interfaces
- IHierarchicalPlanningToGraphSearchReduction<N,A,I1 extends IHTNPlanningProblem,O1 extends IPlan,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,O2 extends ai.libs.jaicore.search.model.other.SearchGraphPath<N,A>> - Interface in ai.libs.jaicore.planning.hierarchical.problems.htn
- IHTNPlanningProblem - Interface in ai.libs.jaicore.planning.hierarchical.problems.htn
- indent(int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.AShop2Converter
- IPlan - Interface in ai.libs.jaicore.planning.core.interfaces
- isAndNode() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- isGoal() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- isGoalState(Monom) - Method in interface ai.libs.jaicore.planning.classical.problems.strips.GoalStateFunction
- isLonely() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- isPathSemanticallySubsumed(List<TFDNode>, List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd.CEOCTFDGraphGenerator
- isPathSemanticallySubsumed(List<TFDNode>, List<TFDNode>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- isSortNetworkBasedOnNumberPrefixes() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- ISTRIPSPlanningGraphGeneratorDeriver<N,A> - Interface in ai.libs.jaicore.planning.classical.algorithms.strips.forward
M
- maskString(String) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
- Method - Class in ai.libs.jaicore.planning.hierarchical.problems.stn
- Method(String, List<VariableParam>, Literal, Monom, TaskNetwork, boolean) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- MethodInstance - Class in ai.libs.jaicore.planning.hierarchical.problems.stn
- MethodInstance(Method, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
O
- OCIPMethod - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocipstn
- OCIPMethod(String, String, Literal, Monom, TaskNetwork, boolean, String, Monom) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- OCIPMethod(String, List<VariableParam>, Literal, Monom, TaskNetwork, boolean, List<VariableParam>, Monom) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- OCIPMethodInstance - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocipstn
- OCIPMethodInstance(Method, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethodInstance
- OCMethod - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- OCMethod(String, List<VariableParam>, Literal, Monom, TaskNetwork, boolean, List<VariableParam>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.OCMethod
- OCMethodInstance - Class in ai.libs.jaicore.planning.hierarchical.problems.ceocstn
- OCMethodInstance(Method, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.OCMethodInstance
- Operation - Class in ai.libs.jaicore.planning.classical.problems.strips
- Operation(String, List<VariableParam>, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.Operation
- OracleTaskResolver - Interface in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd
- orderRemainingTasksByPriority(TFDNode) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
P
- Plan - Class in ai.libs.jaicore.planning.core
- Plan(List<Action>) - Constructor for class ai.libs.jaicore.planning.core.Plan
- Plan(List<Action>, Map<String, Object>) - Constructor for class ai.libs.jaicore.planning.core.Plan
- PlanFoundEvent<A extends Action,V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.core.events
- PlanFoundEvent(String, EvaluatedPlan<V>) - Constructor for class ai.libs.jaicore.planning.core.events.PlanFoundEvent
- PlanningDomain - Class in ai.libs.jaicore.planning.classical.problems.strips
- PlanningDomain(Collection<Operation>) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.PlanningDomain
- PlanningProblem - Class in ai.libs.jaicore.planning.classical.problems.strips
- PlanningProblem(PlanningDomain, Monom, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- PlanningProblem(PlanningDomain, Monom, GoalStateFunction) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- postProcessComplexTaskNode(TFDNode) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
-
A hook for extending classes that can be used to change the nodes before they are attached
- postProcessPrimitiveTaskNode(TFDNode) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceoctfd.CEOCTFDGraphGenerator
- postProcessPrimitiveTaskNode(TFDNode) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
-
A hook for extending classes that can be used to change the nodes before they are attached
- primitiveTasks - Variable in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- print(CEOCSTNPlanningProblem) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
- print(CEOCSTNPlanningProblem, String) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
- printDomain(File) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
-
Writes the given Problem into the output file
- printDomain(Writer, String) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
-
Writes the given Problem into the output file
- printLiteral(BufferedWriter, Literal) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
-
Prints a single literal into the bufferedwriter
- printLiteral(BufferedWriter, Literal) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
-
Prints a single literal into the bufferedwriter
- printLiteral(BufferedWriter, Literal) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.AShop2Converter
- printMethod(BufferedWriter, Method, int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
-
Prints a mehtod into the given writer
- printMethod(BufferedWriter, Method, int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
-
Prints a mehtod into the given writer
- printMonom(BufferedWriter, Monom, int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.AShop2Converter
-
Prints a single monom into the bufferedwriter
- printMonom(BufferedWriter, Monom, int, boolean) - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.AShop2Converter
-
Prints a single monom into the bufferedwriter
- printOperation(BufferedWriter, CEOCOperation, int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
-
Prints the operations of the domain into a FIle
- printOperation(BufferedWriter, CEOCOperation, int) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
-
Prints the operations of the domain into a FIle
- printProblem(CEOCIPSTNPlanningProblem, Writer, String) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.converters.CEOCIPSTN2JSHOP2
- printProblem(CEOCSTNPlanningProblem, File) - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocstn.converters.CEOCSTN2Shop2
- problem - Variable in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
R
- recoverPlanFromActionEncoding(STNPlanningDomain, List<String>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- reduce(Monom) - Method in interface ai.libs.jaicore.planning.hierarchical.problems.rtn.StateReducer
- RTaskNetwork - Class in ai.libs.jaicore.planning.hierarchical.problems.rtn
- RTaskNetwork(TaskNetwork, Map<Literal, StateReducer>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTaskNetwork
- RTNEdge - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn
- RTNEdge(Map<ConstantParam, ConstantParam>, MethodInstance, CEOCAction) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNEdge
- RTNGraphGenerator - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn
- RTNGraphGenerator(RTNPlanningProblem) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNGraphGenerator
- RTNMethod - Class in ai.libs.jaicore.planning.hierarchical.problems.rtn
- RTNMethod(String, List<VariableParam>, Literal, Monom, RTaskNetwork, boolean, List<VariableParam>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNMethod
- RTNNode - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn
- RTNNode(boolean, Monom, List<Literal>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- RTNPlanningDomain - Class in ai.libs.jaicore.planning.hierarchical.problems.rtn
- RTNPlanningDomain(Collection<? extends CEOCOperation>, Collection<? extends RTNMethod>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningDomain
- RTNPlanningProblem - Class in ai.libs.jaicore.planning.hierarchical.problems.rtn
- RTNPlanningProblem(RTNPlanningDomain, Monom, TaskNetwork) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.rtn.RTNPlanningProblem
- RTNUtil - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn
- runPreCreationHook() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.STRIPSPlanner
- runPreCreationHook() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.CostSensitiveGraphSearchBasedHTNPlanningAlgorithm
S
- SearchGraphBasedPlan<N,A> - Class in ai.libs.jaicore.planning.core
- SearchGraphBasedPlan(Plan, SearchGraphPath<N, A>) - Constructor for class ai.libs.jaicore.planning.core.SearchGraphBasedPlan
- serializeGraph(LabeledGraph<RTNNode, RTNEdge>) - Static method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNUtil
- setAnnotation(String, Object) - Method in class ai.libs.jaicore.planning.core.Plan
- setAnnotation(Map<String, Object>) - Method in class ai.libs.jaicore.planning.core.Plan
- setEvaluablePlanningPredicates(Map<String, EvaluablePredicate>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- setRemainingTasks(List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- setState(Monom) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- setTransformer(GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode, String, V>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer
- SimpleForwardDecompositionReducer - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition
- SimpleForwardDecompositionReducer() - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.SimpleForwardDecompositionReducer
- SolutionPathConverter<T> - Interface in ai.libs.jaicore.planning.core.interfaces
- StandardProblemFactory - Class in ai.libs.jaicore.planning.classical.problems.strips
- StateReducer - Interface in ai.libs.jaicore.planning.hierarchical.problems.rtn
- STNPlanningDomain - Class in ai.libs.jaicore.planning.hierarchical.problems.stn
- STNPlanningDomain(Collection<? extends Operation>, Collection<? extends Method>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- STNPlanningProblem - Class in ai.libs.jaicore.planning.hierarchical.problems.stn
- STNPlanningProblem(STNPlanningDomain, CNFFormula, Monom, TaskNetwork) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
- StripsAction - Class in ai.libs.jaicore.planning.classical.problems.strips
- StripsAction(StripsOperation, Map<VariableParam, ConstantParam>) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsAction
- StripsForwardPlanningGraphGenerator - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
- StripsForwardPlanningGraphGenerator(StripsPlanningProblem) - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningGraphGenerator
- StripsForwardPlanningNode - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
-
We only store the difference to the init state, i.e. what needs to be added or remove from the init state to get the state
- StripsForwardPlanningNode(Monom, Monom, Action) - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- STRIPSForwardSearchReducer - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
- STRIPSForwardSearchReducer() - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.STRIPSForwardSearchReducer
- StripsNodeInfoGenerator<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
- StripsNodeInfoGenerator() - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsNodeInfoGenerator
- StripsOperation - Class in ai.libs.jaicore.planning.classical.problems.strips
- StripsOperation(String, List<VariableParam>, Monom, Monom, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- STRIPSPlanner<V extends java.lang.Comparable<V>> - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
- STRIPSPlanner(StripsPlanningProblem, AlgorithmicProblemReduction<StripsPlanningProblem, IGraphSearchBasedPlan<StripsForwardPlanningNode, String>, GraphSearchInput<StripsForwardPlanningNode, String>, SearchGraphPath<StripsForwardPlanningNode, String>>, IAlgorithmFactory<GraphSearchInput<StripsForwardPlanningNode, String>, SearchGraphPath<StripsForwardPlanningNode, String>>) - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.STRIPSPlanner
- StripsPlanningDomain - Class in ai.libs.jaicore.planning.classical.problems.strips
- StripsPlanningDomain(Collection<StripsOperation>) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsPlanningDomain
- StripsPlanningProblem - Class in ai.libs.jaicore.planning.classical.problems.strips
- StripsPlanningProblem(StripsPlanningDomain, Monom, Monom) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsPlanningProblem
- StripsPlanningProblem(StripsPlanningDomain, Monom, GoalStateFunction) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsPlanningProblem
- StripsPlanningProblem(StripsPlanningProblem) - Constructor for class ai.libs.jaicore.planning.classical.problems.strips.StripsPlanningProblem
- StripsUtil - Class in ai.libs.jaicore.planning.classical.algorithms.strips.forward
- StripsUtil() - Constructor for class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- stripTNPrefixes(List<Literal>) - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
T
- TaskNetwork - Class in ai.libs.jaicore.planning.hierarchical.problems.stn
- TaskNetwork() - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.TaskNetwork
- TaskNetwork(Graph<Literal>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.TaskNetwork
- TaskNetwork(String) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.TaskNetwork
- TaskNetwork(List<Literal>) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.stn.TaskNetwork
- TaskPlannerUtil - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators
- TaskPlannerUtil(Map<String, EvaluablePredicate>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.TaskPlannerUtil
- TFDGraphGenerator - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- TFDGraphGenerator(IHTNPlanningProblem) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- TFDNode - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- TFDNode(Monom, List<Literal>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- TFDNode(Monom, List<Literal>, MethodInstance, Action) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- TFDNode(Action, boolean) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- TFDNode(MethodInstance, boolean) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- TFDNodeInfoGenerator - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- TFDNodeInfoGenerator() - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeInfoGenerator
- TFDNodeUtil - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- TFDNodeUtil(Map<String, EvaluablePredicate>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNodeUtil
- TFDRestProblem - Class in ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd
- TFDRestProblem(Monom, List<Literal>) - Constructor for class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- toString() - Method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsForwardPlanningNode
- toString() - Method in class ai.libs.jaicore.planning.classical.problems.ceoc.CEOCOperation
- toString() - Method in class ai.libs.jaicore.planning.classical.problems.strips.Operation
- toString() - Method in class ai.libs.jaicore.planning.classical.problems.strips.PlanningProblem
- toString() - Method in class ai.libs.jaicore.planning.classical.problems.strips.StripsOperation
- toString() - Method in class ai.libs.jaicore.planning.core.Action
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.ceociptfd.CEOCIPTFDGraphGenerator
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.rtn.RTNNode
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDRestProblem
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.CEOCIPSTNPlanningProblem
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.ceocipstn.OCIPMethod
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.Method
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.MethodInstance
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningDomain
- toString() - Method in class ai.libs.jaicore.planning.hierarchical.problems.stn.STNPlanningProblem
U
- UniformCostHTNPlanningProblem - Class in ai.libs.jaicore.planning.hierarchical.problems.htn
- UniformCostHTNPlanningProblem(IHTNPlanningProblem) - Constructor for class ai.libs.jaicore.planning.hierarchical.problems.htn.UniformCostHTNPlanningProblem
- updateState(Monom, Action) - Static method in class ai.libs.jaicore.planning.classical.algorithms.strips.forward.StripsUtil
- util - Variable in class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDGraphGenerator
All Classes All Packages