Analyzing generalized planning under nondeterminism

DOI10.1016/j.artint.2022.103696OpenAlexW4220672229MaRDI QIDQ2124464

Vaishak Belle

Publication date: 11 April 2022

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

Full work available at URL: https://doi.org/10.1016/j.artint.2022.103696

zbMATH Keywords

knowledge representationcognitive roboticsreasoning about actionplans with loopsiterative planning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (1)

Epistemic planning: perspectives on the special issue

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• A logical theory of localization
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• Knowledge, action, and the frame problem
• Weak, strong, and strong cyclic planning via symbolic model checking
• Robot location estimation in the situation calculus
• What robots can do: robot programs and effective achievability
• Reasoning about noisy sensors and effectors in the situation calculus
• Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
• Ability and knowing how in the situation calculus
• A correctness result for synthesizing plans with loops in stochastic domains
• POMDPs under probabilistic semantics
• Strong planning under partial observability
• Planning with Markov Decision Processes: An AI Perspective
• A Concise Introduction to Models and Methods for Automated Planning
• A Deductive Approach to Program Synthesis
• Fully Observable Non-deterministic Planning as Assumption-Based Reactive Synthesis
• An axiomatic basis for computer programming
• On knowledge-based programming with sensing in the situation calculus

This page was built for publication: Analyzing generalized planning under nondeterminism