Computing programs for generalized planning using a classical planner

Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the planning as heuristic search paradigm to the particularities of GP, and presents the first native heur...

Descripción completa

Detalles Bibliográficos
Autores: Segovia-Aguas, Javier, Jiménez, Sergio, Jonsson, Anders
Tipo de recurso: artículo
Estado:Versión aceptada para publicación
Fecha de publicación:2019
País:España
Institución:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
Repositorio:Recercat. Dipósit de la Recerca de Catalunya
OAI Identifier:oai:recercat.cat:10230/69306
Acceso en línea:http://hdl.handle.net/10230/69306
https://doi.org/10.1016/j.artint.2018.10.006
Access Level:acceso abierto
Palabra clave:Computing programs
Heuristic search
Generalized planning
id ES_eddedf0f0fec6f5634a16908c862c5eb
oai_identifier_str oai:recercat.cat:10230/69306
network_acronym_str ES
network_name_str España
repository_id_str
spelling Computing programs for generalized planning using a classical plannerSegovia-Aguas, JavierJiménez, SergioJonsson, AndersComputing programsHeuristic searchGeneralized planningAlthough heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the planning as heuristic search paradigm to the particularities of GP, and presents the first native heuristic search approach to GP. First, the paper defines a program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our programbased solution space, and that is guided by different evaluation and heuristic functions.Elsevier202520252019info:eu-repo/semantics/articleinfo:eu-repo/semantics/acceptedVersionapplication/pdfapplication/pdfhttp://hdl.handle.net/10230/69306https://doi.org/10.1016/j.artint.2018.10.006reponame:Recercat. Dipósit de la Recerca de Catalunyainstname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)InglésArtif Intell. 2019 Jul;(272):52-85info:eu-repo/grantAgreement/ES/1PE/TIN2015-67959info:eu-repo/grantAgreement/ES/2PE/PCIN-2017-082info:eu-repo/grantAgreement/ES/1PE/RYC-2015-18009info:eu-repo/grantAgreement/ES/1PE/TIN2017-88476-C2-1-R© Elsevier http://dx.doi.org/10.1016/j.artint.2018.10.006info:eu-repo/semantics/openAccessoai:recercat.cat:10230/693062026-05-29T05:05:01Z
dc.title.none.fl_str_mv Computing programs for generalized planning using a classical planner
title Computing programs for generalized planning using a classical planner
spellingShingle Computing programs for generalized planning using a classical planner
Segovia-Aguas, Javier
Computing programs
Heuristic search
Generalized planning
title_short Computing programs for generalized planning using a classical planner
title_full Computing programs for generalized planning using a classical planner
title_fullStr Computing programs for generalized planning using a classical planner
title_full_unstemmed Computing programs for generalized planning using a classical planner
title_sort Computing programs for generalized planning using a classical planner
dc.creator.none.fl_str_mv Segovia-Aguas, Javier
Jiménez, Sergio
Jonsson, Anders
author Segovia-Aguas, Javier
author_facet Segovia-Aguas, Javier
Jiménez, Sergio
Jonsson, Anders
author_role author
author2 Jiménez, Sergio
Jonsson, Anders
author2_role author
author
dc.subject.none.fl_str_mv Computing programs
Heuristic search
Generalized planning
topic Computing programs
Heuristic search
Generalized planning
description Although heuristic search is one of the most successful approaches to classical planning, this planning paradigm does not apply straightforwardly to Generalized Planning (GP). This paper adapts the planning as heuristic search paradigm to the particularities of GP, and presents the first native heuristic search approach to GP. First, the paper defines a program-based solution space for GP that is independent of the number of planning instances in a GP problem, and the size of these instances. Second, the paper defines the BFGP algorithm for GP, that implements a best-first search in our programbased solution space, and that is guided by different evaluation and heuristic functions.
publishDate 2019
dc.date.none.fl_str_mv 2019
2025
2025
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/acceptedVersion
format article
status_str acceptedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/10230/69306
https://doi.org/10.1016/j.artint.2018.10.006
url http://hdl.handle.net/10230/69306
https://doi.org/10.1016/j.artint.2018.10.006
dc.language.none.fl_str_mv Inglés
language_invalid_str_mv Inglés
dc.relation.none.fl_str_mv Artif Intell. 2019 Jul;(272):52-85
info:eu-repo/grantAgreement/ES/1PE/TIN2015-67959
info:eu-repo/grantAgreement/ES/2PE/PCIN-2017-082
info:eu-repo/grantAgreement/ES/1PE/RYC-2015-18009
info:eu-repo/grantAgreement/ES/1PE/TIN2017-88476-C2-1-R
dc.rights.none.fl_str_mv © Elsevier http://dx.doi.org/10.1016/j.artint.2018.10.006
info:eu-repo/semantics/openAccess
rights_invalid_str_mv © Elsevier http://dx.doi.org/10.1016/j.artint.2018.10.006
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv Elsevier
publisher.none.fl_str_mv Elsevier
dc.source.none.fl_str_mv reponame:Recercat. Dipósit de la Recerca de Catalunya
instname:Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
instname_str Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya)
reponame_str Recercat. Dipósit de la Recerca de Catalunya
collection Recercat. Dipósit de la Recerca de Catalunya
repository.name.fl_str_mv
repository.mail.fl_str_mv
_version_ 1869423568044949504
score 15,812429

Similares en LA Referencia