Propagation of PDDL3 plan constraints

Ptrik Haslum

Propagation of PDDL3 plan constraints

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

Abstract

We present a sound, though incomplete, and tractable propagation procedure for PDDL3 trajectory constraints, with the aim of providing an inexpensive unsatisfiability test for sets of such constraints. The propagator is supported by (tractable) methods that derive additional constraints from the problem description. It is applied to compute lower bounds on penalty for problems with soft trajectory constraints (preferences).

Original language	English
Pages	16-23
Number of pages	8
Publication status	Published - 2013
Event	8th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2013 - Rome, Italy Duration: 11 Jun 2013 → …

Conference

Conference	8th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2013
Country/Territory	Italy
City	Rome
Period	11/06/13 → …

Cite this

@conference{4f5d8e82e7aa41379d806cefdb00ad89,

title = "Propagation of PDDL3 plan constraints",

abstract = "We present a sound, though incomplete, and tractable propagation procedure for PDDL3 trajectory constraints, with the aim of providing an inexpensive unsatisfiability test for sets of such constraints. The propagator is supported by (tractable) methods that derive additional constraints from the problem description. It is applied to compute lower bounds on penalty for problems with soft trajectory constraints (preferences).",

author = "Ptrik Haslum",

note = "Publisher Copyright: Copyright {\textcopyright} 2013, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; 8th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2013 ; Conference date: 11-06-2013",

year = "2013",

language = "English",

pages = "16--23",

}

TY - CONF

T1 - Propagation of PDDL3 plan constraints

AU - Haslum, Ptrik

PY - 2013

Y1 - 2013

N2 - We present a sound, though incomplete, and tractable propagation procedure for PDDL3 trajectory constraints, with the aim of providing an inexpensive unsatisfiability test for sets of such constraints. The propagator is supported by (tractable) methods that derive additional constraints from the problem description. It is applied to compute lower bounds on penalty for problems with soft trajectory constraints (preferences).

AB - We present a sound, though incomplete, and tractable propagation procedure for PDDL3 trajectory constraints, with the aim of providing an inexpensive unsatisfiability test for sets of such constraints. The propagator is supported by (tractable) methods that derive additional constraints from the problem description. It is applied to compute lower bounds on penalty for problems with soft trajectory constraints (preferences).

UR - http://www.scopus.com/inward/record.url?scp=85086471319&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:85086471319

SP - 16

EP - 23

T2 - 8th Workshop on Constraint Satisfaction Techniques for Planning and Scheduling Problems, COPLAS 2013

Y2 - 11 June 2013

ER -

Propagation of PDDL3 plan constraints

Abstract

Conference

Other files and links

Fingerprint

Cite this