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

DOI10.1613/JAIR.5562MaRDI QIDQ4639031zbMATH OpenOpenAlexFDO

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

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Analyzing generalized planning under nondeterminism
• A correctness result for synthesizing plans with loops in stochastic domains
• Fast strong planning for fully observable nondeterministic planning problems
• Flexible FOND Planning with Explicit Fairness Assumptions
• Fair -regular games
• Fair quantitative games
• Solving odd-fair parity games

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)