A correctness result for synthesizing plans with loops in stochastic domains

DOI10.1016/j.ijar.2019.12.005zbMath1434.68549arXiv1905.07028OpenAlexW2996257663WikidataQ126586464 ScholiaQ126586464MaRDI QIDQ2300450

Laszlo Treszkai, Vaishak Belle

Publication date: 27 February 2020

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1905.07028

zbMATH Keywords

stochastic algorithmsloops in plans and programsplan and program synthesisplanning in roboticsstochastic domains

Mathematics Subject Classification ID

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

Related Items (3)

Analyzing generalized planning under nondeterminism ⋮ Special issue on probabilistic logic programming (PLP 2018) ⋮ Unnamed Item

Uses Software

• POMDP

Cites Work

• Weak, strong, and strong cyclic planning via symbolic model checking
• What robots can do: robot programs and effective achievability
• Strong planning under partial observability
• A Deductive Approach to Program Synthesis
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item

This page was built for publication: A correctness result for synthesizing plans with loops in stochastic domains