- -

FLAP: Applying Least-Commitment in Forward-Chaining Planning

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by


FLAP: Applying Least-Commitment in Forward-Chaining Planning

Show full item record

Sapena Vercher, O.; Onaindia De La Rivaherrera, E.; Torreño Lerma, A. (2015). FLAP: Applying Least-Commitment in Forward-Chaining Planning. AI Communications. 28(1):5-20. doi:10.3233/AIC-140613

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

Files in this item

Item Metadata

Title: FLAP: Applying Least-Commitment in Forward-Chaining Planning
Author: Sapena Vercher, Oscar Onaindia de la Rivaherrera, Eva Torreño Lerma, Alejandro
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
In this paper, we present FLAP, a partial-order planner that accurately applies the least-commitment principle that governs traditional partial-order planning. FLAP fully exploits the partial ordering among actions of a ...[+]
Subjects: Planning , Partial-order plan , Least commitment , Forward-chaining search , Heuristics
Copyrigths: Reserva de todos los derechos
AI Communications. (issn: 0921-7126 )
DOI: 10.3233/AIC-140613
IOS Press
Publisher version: http://dx.doi.org/ 10.3233/AIC-140613
Project ID:
info:eu-repo/grantAgreement/MEC//CSD2007-00022/ES/Agreement Technologies/
Valencian Prometeo project/II/2013/019
This work has been partly supported by the Spanish MICINN under projects Consolider Ingenio 2010 CSD2007-00022 and TIN2011-27652-C03-01, the Valencian Prometeo project II/2013/019.
Type: Artículo



This item appears in the following Collection(s)

Show full item record