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

Nicolás D'Ippolito, Natalia Rodríguez, Sebastian Sardiña

JAIR 2018 pp. 593-621

doi:10.1613/JAIR.5562 /jair/2018/daposippolito2018jair-fully/

Abstract

Whereas previous work on non-deterministic planning has focused on characterizing (and computing) "loopy" but "closed" plans, we look here at the kind of environments that these plans are to be executed in. In particular, we provide a logical characterization of the standard "fairness" assumption used, and show that strong cyclic plans are correct solution concepts for fair environments. We argue then that such logical characterization allows us to recast non-deterministic planning as a reactive synthesis task, and show that for a special case, recent efficient synthesis techniques can be applied.

PDF JAIR Semantic Scholar

Cite

Text

D'Ippolito et al. "Fully Observable Non-Deterministic Planning as Assumption-Based Reactive Synthesis." Journal of Artificial Intelligence Research, 2018. doi:10.1613/JAIR.5562

Markdown

[D'Ippolito et al. "Fully Observable Non-Deterministic Planning as Assumption-Based Reactive Synthesis." Journal of Artificial Intelligence Research, 2018.](https://mlanthology.org/jair/2018/daposippolito2018jair-fully/) doi:10.1613/JAIR.5562

BibTeX

@article{daposippolito2018jair-fully,
  title     = {{Fully Observable Non-Deterministic Planning as Assumption-Based Reactive Synthesis}},
  author    = {D'Ippolito, Nicolás and Rodríguez, Natalia and Sardiña, Sebastian},
  journal   = {Journal of Artificial Intelligence Research},
  year      = {2018},
  pages     = {593-621},
  doi       = {10.1613/JAIR.5562},
  volume    = {61},
  url       = {https://mlanthology.org/jair/2018/daposippolito2018jair-fully/}
}