Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis

Autores
D'ippolito, Nicolás Roque; Rodriguez, Natalia; Sardina, Sebastian
Año de publicación
2018
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard “fairness” assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special “structural” properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.
Fil: D'ippolito, Nicolás Roque. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Rodriguez, Natalia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Sardina, Sebastian. RMIT University; Australia
Materia
Artificial intelligence
Planning
Controller synthesis
Reactive synthesis
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/100355
Acceder
id CONICETDig_ee90bfab7ab610b1ff1996e4f1e805c1
oai_identifier_str oai:ri.conicet.gov.ar:11336/100355
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling Fully Observable Non-deterministic Planning as Assumption-Based Reactive SynthesisD'ippolito, Nicolás RoqueRodriguez, NataliaSardina, SebastianArtificial intelligencePlanningController synthesisReactive synthesishttps://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard “fairness” assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special “structural” properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.Fil: D'ippolito, Nicolás Roque. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; ArgentinaFil: Rodriguez, Natalia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; ArgentinaFil: Sardina, Sebastian. RMIT University; AustraliaAI Access Foundation2018-03info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionhttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/100355D'ippolito, Nicolás Roque; Rodriguez, Natalia; Sardina, Sebastian; Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis; AI Access Foundation; Journal of Artificial Intelligence Research; 61; 3-2018; 593-6211076-9757CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://jair.org/index.php/jair/article/view/11183info:eu-repo/semantics/altIdentifier/doi/10.1613/jair.5562info:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2025-10-22T11:02:44Zoai:ri.conicet.gov.ar:11336/100355instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982025-10-22 11:02:44.331CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
title Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
spellingShingle Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
D'ippolito, Nicolás Roque
Artificial intelligence
Planning
Controller synthesis
Reactive synthesis
title_short Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
title_full Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
title_fullStr Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
title_full_unstemmed Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
title_sort Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
dc.creator.none.fl_str_mv D'ippolito, Nicolás Roque
Rodriguez, Natalia
Sardina, Sebastian
author D'ippolito, Nicolás Roque
author_facet D'ippolito, Nicolás Roque
Rodriguez, Natalia
Sardina, Sebastian
author_role author
author2 Rodriguez, Natalia
Sardina, Sebastian
author2_role author
author
dc.subject.none.fl_str_mv Artificial intelligence
Planning
Controller synthesis
Reactive synthesis
topic Artificial intelligence
Planning
Controller synthesis
Reactive synthesis
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard “fairness” assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special “structural” properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.
Fil: D'ippolito, Nicolás Roque. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigación en Ciencias de la Computación. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigación en Ciencias de la Computación; Argentina
Fil: Rodriguez, Natalia. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Departamento de Computación; Argentina
Fil: Sardina, Sebastian. RMIT University; Australia
description We contribute to recent efforts in relating two approaches to automatic synthesis, namely, automated planning and discrete reactive synthesis. First, we develop a declarative characterization of the standard “fairness” assumption on environments in non-deterministic planning, and show that strong-cyclic plans are correct solution concepts for fair environments. This complements, and arguably completes, the existing foundational work on non-deterministic planning, which focuses on characterizing (and computing) plans enjoying special “structural” properties, namely loopy but closed policy structures. Second, we provide an encoding suitable for reactive synthesis that avoids the naive exponential state space blowup. To do so, special care has to be taken to specify the fairness assumption on the environment in a succinct manner.
publishDate 2018
dc.date.none.fl_str_mv 2018-03
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/100355
D'ippolito, Nicolás Roque; Rodriguez, Natalia; Sardina, Sebastian; Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis; AI Access Foundation; Journal of Artificial Intelligence Research; 61; 3-2018; 593-621
1076-9757
CONICET Digital
CONICET
url http://hdl.handle.net/11336/100355
identifier_str_mv D'ippolito, Nicolás Roque; Rodriguez, Natalia; Sardina, Sebastian; Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis; AI Access Foundation; Journal of Artificial Intelligence Research; 61; 3-2018; 593-621
1076-9757
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://jair.org/index.php/jair/article/view/11183
info:eu-repo/semantics/altIdentifier/doi/10.1613/jair.5562
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
dc.publisher.none.fl_str_mv AI Access Foundation
publisher.none.fl_str_mv AI Access Foundation
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1846781242699153408
score 12.982451

Publicaciones similares