This paper discusses the issue of efficient resolution of timeline-based planning problems. In particular, taking inspiration from the more classical heuristics for the resolution of STRIPS-like problems, it proposes a new heuristic strategy which, while maintaining the variables lifted, allows more accurate decisions. The concepts presented in this work pave the way for a new type of heuristics which, at present, allow this kind of solvers a significant performance improvement.
Lifted Heuristics for Timeline-based Planning
De Benedictis R;Cesta A
2020
Abstract
This paper discusses the issue of efficient resolution of timeline-based planning problems. In particular, taking inspiration from the more classical heuristics for the resolution of STRIPS-like problems, it proposes a new heuristic strategy which, while maintaining the variables lifted, allows more accurate decisions. The concepts presented in this work pave the way for a new type of heuristics which, at present, allow this kind of solvers a significant performance improvement.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.
