concepts.dm.pdsketch.strips.strips_heuristics.StripsBlindHeuristic#

class StripsBlindHeuristic[source]#

Bases: StripsHeuristic

A blind heuristic that always returns 1 if the goal is not satisfied, and 0 otherwise.

Methods

`compute`(state)	Compute the heuristic value of the given state.
`from_type`(type_identifier, task[, translator])	Create a heuristic from the given type identifier.

Attributes

`goal_func`	The (compiled version) of goal function of the task.
`task`	The grounded STRIPS planning task.
`translator`	The translator used to translate the task representation into the GS* (grounded STRIPS) representation.

__init__(task, translator=None)#

Initialize the heuristic.

Parameters:

task (GStripsProblem) – the task to compute the heuristic value (including the goal and the operators)
translator (GStripsTranslatorBase | None) – the translator to translate the task representation into the GS* (grounded STRIPS) representation.

compute(state)[source]#

Compute the heuristic value of the given state.

Parameters:: state (SState) – the state to compute the heuristic value.
Returns:: the heuristic value of the given state.
Return type:: int

classmethod from_type(type_identifier, task, translator=None, **kwargs)#

Create a heuristic from the given type identifier.

Parameters:

type_identifier (str) – the type identifier of the heuristic.
task (GStripsProblem) – the grounded STRIPS planning task.
translator (GStripsTranslatorBase | None) – the translator used to translate the planning task to the GS* (grounded STRIPS) representation.
**kwargs – additional arguments to pass to the constructor.

Returns:

the created heuristic.

Return type:

StripsHeuristic

property goal_func: Callable[[SState], bool | GSBoolForwardDiffReturn]#: The (compiled version) of goal function of the task.

property translator: GStripsTranslatorBase | None#: The translator used to translate the task representation into the GS* (grounded STRIPS) representation.