Abstract
This paper deals with planning in the presence of constraints and preferences as proposed for the 5 Planning Competition. State trajectory constraints are translated into LTL formulae and are compiled into Buchi automata in PDDL format. Preference constraints are compiled into numerical fluents. Values of these fluents are changed by grounded operator effects upon violation.
Users
Please
log in to take part in the discussion (add own reviews or comments).