Analyzing generalized planning under nondeterminism

DOI10.1016/J.ARTINT.2022.103696MaRDI QIDQ2124464zbMATH OpenOpenAlexFDO

Authors Vaishak Belle

Publication date 11 April 2022

Published in Artificial Intelligence (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

cognitive roboticsiterative planningknowledge representationplans with loopsreasoning about action

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites work

• A Concise Introduction to Models and Methods for Automated Planning
• A correctness result for synthesizing plans with loops in stochastic domains
• A Deductive Approach to Program Synthesis
• A logical theory of localization
• Ability and knowing how in the situation calculus
• An axiomatic basis for computer programming
• Dynamic programming and optimal control. Vol. 2.
• Fully observable non-deterministic planning as assumption-based reactive synthesis
• scientific article; zbMATH DE number 3664335 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1820675 (Why is no real title available?)
• scientific article; zbMATH DE number 765034 (Why is no real title available?)
• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• scientific article; zbMATH DE number 2201583 (Why is no real title available?)
• scientific article; zbMATH DE number 3359806 (Why is no real title available?)
• scientific article; zbMATH DE number 2238781 (Why is no real title available?)
• Knowledge, action, and the frame problem
• On knowledge-based programming with sensing in the situation calculus
• On the semantics of deliberation in IndiGolog -- from theory to implementation
• Planning and acting in partially observable stochastic domains
• Planning with Markov decision processes. An AI perspective
• POMDPs under probabilistic semantics
• Reasoning about discrete and continuous noisy sensors and effectors in dynamical systems
• Reasoning about noisy sensors and effectors in the situation calculus
• Robot location estimation in the situation calculus
• Strong planning under partial observability
• Weak, strong, and strong cyclic planning via symbolic model checking
• What robots can do: robot programs and effective achievability

Cited in

(4)

• Epistemic planning: perspectives on the special issue
• Hierarchical decompositions and termination analysis for generalized planning
• Knowing how to plan about planning: higher-order and meta-level epistemic planning
• Toward a logical theory of fairness and bias

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

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