Package fr.uga.pddl4j.planners.statespace.search

Class AStar

java.lang.Object

fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch

fr.uga.pddl4j.planners.statespace.search.AStar

All Implemented Interfaces:

SearchStrategy, StateSpaceSearch, Serializable

public final class AStar
extends AbstractStateSpaceSearch

This class implements A* search strategy.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface fr.uga.pddl4j.planners.SearchStrategy

SearchStrategy.Name

Field Summary

Fields inherited from interface fr.uga.pddl4j.planners.statespace.search.StateSpaceSearch

DEFAULT_HEURISTIC, DEFAULT_HEURISTIC_WEIGHT, DEFAULT_TIMEOUT

Constructor Summary

Constructors

Constructor	Description
AStar()	Creates a new AStar search strategy with default parameters.
AStar(int timeout, StateHeuristic.Name heuristic, double weight)	Creates a new AStar search strategy.

Method Summary

Modifier and Type	Method	Description
Node	search(Problem codedProblem)	Solves the planning problem and returns the first solution search found.

Methods inherited from class fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch

extractPlan, getCreatedNodes, getExploredNodes, getHeuristic, getMemoryUsed, getPendingNodes, getSearchingTime, getTimeout, getWeight, resetNodesStatistics, searchPlan, searchSolutionNode, setCreatedNodes, setExploredNodes, setHeuristic, setMemoryUsed, setPendingNodes, setSearchingTime, setTimeOut, setWeight

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

AStar

public AStar()

Creates a new AStar search strategy with default parameters.

AStar

public AStar(int timeout,
 StateHeuristic.Name heuristic,
 double weight)

Creates a new AStar search strategy.

Parameters:

timeout - the time out of the planner.

heuristic - the heuristic to use to solve the planning problem.

weight - the weight set to the heuristic.

Method Details

search

public Node search(Problem codedProblem)

Solves the planning problem and returns the first solution search found.

Parameters:

codedProblem - the problem to be solved. The problem cannot be null.

Returns:

a solution search or null if it does not exist.