This paper present a technique for encoding the representation of a constrained planning problem through the generation of an equivalent unconstrained planning problem.A planning constraints description language is introduced. It is shown that a significant subset of PCDL can be encoded by modifying the planning domain and goals of a classical planner. The constrained problem can then be solved by submitting the modificed problem to any classical planner, the solution to the unconstrained planning problem can be mapped back in the original constrained planning domain in linear time/space.

Encoding Planning Constraints into Partial Order Planning Domains

Marco Baioletti;Alfredo Milani;Stefano Marcugini
1998

Abstract

This paper present a technique for encoding the representation of a constrained planning problem through the generation of an equivalent unconstrained planning problem.A planning constraints description language is introduced. It is shown that a significant subset of PCDL can be encoded by modifying the planning domain and goals of a classical planner. The constrained problem can then be solved by submitting the modificed problem to any classical planner, the solution to the unconstrained planning problem can be mapped back in the original constrained planning domain in linear time/space.
1998
1-55860554-1
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11391/1421360
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? ND
social impact