Skip to Main content Skip to Navigation
Conference papers

A Constraint-Based Encoding for Domain-Independent Temporal Planning

Arthur Bit-Monnot 1
1 LAAS-RIS - Équipe Robotique et InteractionS
LAAS - Laboratoire d'analyse et d'architecture des systèmes
Abstract : We present a general constraint-based encoding for domain-independent task planning. Task planning is characterized by causal relationships expressed as conditions and effects of optional actions. Possible actions are typically represented by templates, where each template can be instantiated into a number of primitive actions. While most previous work for domain-independent task planning has focused on primitive actions in a state-oriented view, our encoding uses a fully lifted representation at the level of action templates. It follows a time-oriented view in the spirit of previous work in constraint-based scheduling. As a result, the proposed encoding is simple and compact as it grows with the number of actions in a solution plan rather than the number of possible primitive actions. When solved with an SMT solver, we show that the proposed encoding is slightly more efficient than state-of-the-art methods on temporally constrained planning benchmarks while clearly outperforming other fully constraint-based approaches.
Document type :
Conference papers
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

https://hal.laas.fr/hal-02931989
Contributor : Arthur Bit-Monnot <>
Submitted on : Monday, September 7, 2020 - 2:04:03 PM
Last modification on : Thursday, June 10, 2021 - 3:48:21 AM
Long-term archiving on: : Wednesday, December 2, 2020 - 9:48:26 PM

File

18-cp.pdf
Files produced by the author(s)

Identifiers

Citation

Arthur Bit-Monnot. A Constraint-Based Encoding for Domain-Independent Temporal Planning. International Conference on Principles and Practice of Constraint Programming, Aug 2018, Lille, France. ⟨10.1007/978-3-319-98334-9_3⟩. ⟨hal-02931989⟩

Share

Metrics

Record views

33

Files downloads

41