Fully observable non-deterministic planning as assumption-based reactive synthesis

DOI10.1613/JAIR.5562zbMATH Open1440.68252OpenAlexW2791893678MaRDI QIDQ4639031FDOQ4639031

Authors: Nicolas D'Ippolito, Natalia Rodríguez, Sebastian Sardiña 

Publication date: 2 May 2018

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.5562

Recommendations

• Environment Assumptions for Synthesis
• Weak, strong, and strong cyclic planning via symbolic model checking
• Fast strong planning for fully observable nondeterministic planning problems
• Conditional epistemic planning
• Constraint-based controller synthesis in non-deterministic and partially observable domains

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cited In (5)

• Flexible FOND Planning with Explicit Fairness Assumptions
• Analyzing generalized planning under nondeterminism
• A correctness result for synthesizing plans with loops in stochastic domains
• Fair \(\omega \)-regular games
• Fast strong planning for fully observable nondeterministic planning problems

This page was built for publication: Fully observable non-deterministic planning as assumption-based reactive synthesis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4639031)