OMTPlan: Optimal Planning Modulo Theories
|
Public Member Functions | |
def | get_covering_assignments (self, parameters, atom) |
def | check_balance (self, balance_checker, enqueue_func) |
def | operator_too_heavy (self, h_action) |
def | operator_unbalanced (self, action, temp_unbalanced_actions) |
def | minimal_covering_renamings (self, action, add_effect, inv_vars) |
def | add_effect_unbalanced (self, action, add_effect, del_effects, inv_vars, time) |
def | add_effect_temporarily_unbalanced (self, action, add_effect, start_del_effects, inv_vars) |
def | refine_candidate (self, add_effect, action, time) |
def | temp_unbalanced_renamings (self, del_effect, add_effect, inv_vars, lhs_by_pred, unbalanced_renamings) |
def | unbalanced_renamings (self, del_effect, add_effect, inv_vars, lhs_by_pred, time, unbalanced_renamings) |
def | lhs_satisfiable (self, renaming, lhs_by_pred) |
def | imply_del_effect (self, del_effect, lhs_by_pred, time) |
def | conditions_require_weight_1 (self, action, add_effect) |
![]() | |
def | __init__ (self, parts) |
def | __eq__ (self, other) |
def | __ne__ (self, other) |
def | __hash__ (self) |
def | __str__ (self) |
def | arity (self) |
def | get_parameters (self, atom) |
def | instantiate (self, parameters) |
Additional Inherited Members | |
![]() | |
parts | |
predicates | |
predicate_to_part | |
def translate.invariants.SafeInvariant.add_effect_temporarily_unbalanced | ( | self, | |
action, | |||
add_effect, | |||
start_del_effects, | |||
inv_vars | |||
) |
at-end add effect has corresponding at-start del effect, so it could be balanced if no other action interferes
def translate.invariants.SafeInvariant.imply_del_effect | ( | self, | |
del_effect, | |||
lhs_by_pred, | |||
time | |||
) |
returns a constraint system that is solvable if lhs implies the del effect (only if lhs is satisfiable). If a solvable lhs never implies the del effect, return None.
def translate.invariants.SafeInvariant.minimal_covering_renamings | ( | self, | |
action, | |||
add_effect, | |||
inv_vars | |||
) |
computes the minimal renamings of the action parameters such that the add effect is covered by the action. Each renaming is an constraint system
def translate.invariants.SafeInvariant.refine_candidate | ( | self, | |
add_effect, | |||
action, | |||
time | |||
) |
refines the candidate for an add effect that is unbalanced in the action and adds the refined one to the queue
def translate.invariants.SafeInvariant.temp_unbalanced_renamings | ( | self, | |
del_effect, | |||
add_effect, | |||
inv_vars, | |||
lhs_by_pred, | |||
unbalanced_renamings | |||
) |
returns the renamings from unbalanced renamings for which the start_del_effect does not balance the end_add_effect.
def translate.invariants.SafeInvariant.unbalanced_renamings | ( | self, | |
del_effect, | |||
add_effect, | |||
inv_vars, | |||
lhs_by_pred, | |||
time, | |||
unbalanced_renamings | |||
) |
returns the renamings from unbalanced renamings for which the del_effect does not balance the add_effect.