- -

Temporal landmark graphs for solving overconstrained planning problems

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Temporal landmark graphs for solving overconstrained planning problems

Show full item record

Marzal Calatayud, EJ.; Sebastiá Tarín, L.; Onaindia De La Rivaherrera, E. (2016). Temporal landmark graphs for solving overconstrained planning problems. Knowledge-Based Systems. 106:14-25. doi:10.1016/j.knosys.2016.05.029

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/79308

Files in this item

Item Metadata

Title: Temporal landmark graphs for solving overconstrained planning problems
Author:
UPV Unit: Universitat Politècnica de València. Escuela Técnica Superior de Ingeniería Geodésica, Cartográfica y Topográfica - Escola Tècnica Superior d'Enginyeria Geodèsica, Cartogràfica i Topogràfica
Universitat Politècnica de València. Escola Tècnica Superior d'Enginyeria Informàtica
Issued date:
Abstract:
This paper presents TempLM, a novel approach for handling temporal planning problems with deadlines. The proposal revolves around the concept of temporal landmark, a proposition that must be necessarily true in all solution ...[+]
Subjects: Automated planning , Temporal planning , Deadlines , Landmarks
Copyrigths: Reserva de todos los derechos
Source:
Knowledge-Based Systems. (issn: 0950-7051 )
DOI: 10.1016/j.knosys.2016.05.029
Publisher:
Elsevier
Publisher version: http://dx.doi.org/10.1016/j.knosys.2016.05.029
Thanks:
We thank Derek Long for solving our doubts about the modal operators in PDDL3 and Erez Karpas for supplying the compiled domain and problem files with their temporal landmarks. This work has been partially supported by ...[+]
Type: Artículo

This item appears in the following Collection(s)

Show full item record