|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use IntCostAction | |
---|---|
ai.search | |
ai.search.informed | |
ai.search.uninformed |
Uses of IntCostAction in ai.search |
---|
Subinterfaces of IntCostAction in ai.search | |
---|---|
interface |
IntCostReversibleAction
Instances implementing this interface represent a reversible action that can be used to transform one search state into another. |
Fields in ai.search declared as IntCostAction | |
---|---|
protected IntCostAction |
SearchEngineForIntCostFn.SearchNodeForIntCostFn.action
the action that resulted in the state contained in this node |
Methods in ai.search that return IntCostAction | |
---|---|
IntCostAction |
SearchEngineForIntCostFn.SearchNodeForIntCostFn.getAction()
This function returns the action that leads from the predecessor to the state contained in this node. |
abstract IntCostAction[] |
AbstractSearchStateForIntCostFn.getAllPossibleActions()
This function returns an array of all the actions that are in principle possible in this state. |
Methods in ai.search that return types with arguments of type IntCostAction | |
---|---|
java.lang.Class<? extends IntCostAction> |
SearchStateForIntCostFn.getActionClass()
This function can be used to retrieve the action class which, together with this state class, defines a search problem. |
java.util.List<inf.util.Pair<IntCostAction,S>> |
SearchEngineForIntCostFn.getSolutionPath()
This function returns the complete path from the initial state to the goal state found. |
inf.util.Pair<IntCostAction,SearchStateForIntCostFn> |
AbstractSearchStateForIntCostFn.GenericSuccessorIterator.next()
|
java.util.Iterator<inf.util.Pair<IntCostAction,SearchStateForIntCostFn>> |
SearchStateForIntCostFn.successors()
This function indirectly generates the successors for this state in the context of the search problem defined by this class. |
java.util.Iterator<inf.util.Pair<IntCostAction,SearchStateForIntCostFn>> |
AbstractSearchStateForIntCostFn.successors()
This function indirectly generates the successors for this state in the context of the search problem defined by this class. |
Methods in ai.search with parameters of type IntCostAction | |
---|---|
void |
SearchEngineForIntCostFn.SearchNodeForIntCostFn.adjustPredecessor(SearchEngineForIntCostFn.SearchNodeForIntCostFn<S> predecessor,
IntCostAction action)
This function can be used to adjust the predecessor for this node. |
SearchStateForIntCostFn |
SearchStateForIntCostFn.apply(IntCostAction action)
This function computes a new search state that is the result of performing the given action in this search state. |
boolean |
SearchStateForIntCostFn.isApplicable(IntCostAction action)
This function tests whether the given action is applicable in this search state. |
Constructors in ai.search with parameters of type IntCostAction | |
---|---|
SearchEngineForIntCostFn.SearchNodeForIntCostFn(S state,
SearchEngineForIntCostFn.SearchNodeForIntCostFn<S> predecessor,
IntCostAction action)
This constructor creates a new search node holding the given state. |
Uses of IntCostAction in ai.search.informed |
---|
Methods in ai.search.informed that return types with arguments of type IntCostAction | |
---|---|
protected inf.util.Pair<IntCostAction,S> |
MAStarSearcherForIntCostFn.MbSearchNode.getNextSuccessor()
|
Methods in ai.search.informed with parameters of type IntCostAction | |
---|---|
protected void |
MAStarSearcherForIntCostFn.MbSearchNode.setDeadEnd(IntCostAction act)
|
Constructors in ai.search.informed with parameters of type IntCostAction | |
---|---|
MAStarSearcherForIntCostFn.MbSearchNode(S state,
MAStarSearcherForIntCostFn.MbSearchNode parent,
IntCostAction act)
|
Uses of IntCostAction in ai.search.uninformed |
---|
Methods in ai.search.uninformed that return types with arguments of type IntCostAction | |
---|---|
java.util.List<inf.util.Pair<IntCostAction,S>> |
BidirBFSearcherForIntCostFn.getSolutionPath()
This function returns the complete path from the initial state to the goal state found. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |