Package edu.uky.ai.planning.pg
Class PlanGraphSearch
java.lang.Object
edu.uky.ai.planning.Search
edu.uky.ai.planning.pg.PlanGraphSearch
Represents the two-phase search process of a
PlanGraphPlanner
. The
solve
method performs the first phase, extending the plan
graph until all goals are non-mutex. It then calls
PlanGraphPlanner.makeSearch(PlanGraph, edu.uky.ai.SearchBudget)
to
perform the second phase, searching the graph for a solution. If the second
phase does not return a solution, the graph is extended by one level and the
second phrase starts again with the extended plan graph. This continues
until a solution is found or the search runs out of resources.- Author:
- Stephen G. Ware
-
Field Summary
-
Method Summary
Modifier and TypeMethodDescriptionint
Returns the total number of nodes that have been generated in this search since it was created.int
Returns the total number of nodes that have been visited in this search space since it was created.final Plan
solve()
Searches the space until a solution is found.
-
Method Details
-
countVisited
public int countVisited()Description copied from class:Search
Returns the total number of nodes that have been visited in this search space since it was created.- Specified by:
countVisited
in classSearch
- Returns:
- the number of visited nodes
-
countGenerated
public int countGenerated()Description copied from class:Search
Returns the total number of nodes that have been generated in this search since it was created.- Specified by:
countGenerated
in classSearch
- Returns:
- the number of expanded ndoes
-
solve
Description copied from class:Search
Searches the space until a solution is found.
-