Package edu.uky.ai.planning.ss
Class BackwardNode
java.lang.Object
edu.uky.ai.planning.ss.BackwardNode
- All Implemented Interfaces:
StateSpaceNode
- Direct Known Subclasses:
BackwardRoot
Represents a node in a backward state space search graph, where a node is a
goal and a plan to achieve the problem goal if the node's goal can be
achieved.
- Author:
- Stephen G. Ware
-
Field Summary
FieldsModifier and TypeFieldDescriptionfinal Conjunction
The goal to be achieve that will allow the plan to succeedfinal BackwardNode
This node's parent node (i.e.final BackwardPlan
The plan to reach the goal -
Method Summary
Modifier and TypeMethodDescriptionexpand
(Conjunction goal, Step step) Expands the child node that would be generated if the given step were the first one to be taken.getPlan()
Returns the plan this node represents.final BackwardRoot
getRoot()
Returns the root node of the search space.toString()
-
Field Details
-
goal
The goal to be achieve that will allow the plan to succeed -
plan
The plan to reach the goal -
parent
This node's parent node (i.e. the rest of the plan after the first step)
-
-
Method Details
-
toString
-
getPlan
Description copied from interface:StateSpaceNode
Returns the plan this node represents.- Specified by:
getPlan
in interfaceStateSpaceNode
- Returns:
- the plan
-
getRoot
Description copied from interface:StateSpaceNode
Returns the root node of the search space.- Specified by:
getRoot
in interfaceStateSpaceNode
- Returns:
- the root
-
expand
Expands the child node that would be generated if the given step were the first one to be taken. If the parent has not yet been visited, the parent is marked as visited.- Parameters:
goal
- the goal that must be achieved to take the given stepstep
- the first step to take- Returns:
- a node for the resulting goal
-