Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions

DOI10.1016/j.artint.2023.103968OpenAlexW4384701363MaRDI QIDQ6080639

Majid Khonji

Publication date: 4 October 2023

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

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

zbMATH Keywords

heuristic searchdurative actionsconstrained partially observable Markov decision processrisk-bounded planning

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Planning and acting in partially observable stochastic domains
• Constrained Discounted Markov Decision Processes and Hamiltonian Cycles
• Percentile Optimization for Markov Decision Processes with Parameter Uncertainty
• Complexity of finite-horizon Markov decision process problems
• The Complexity of Markov Decision Processes
• The Optimal Control of Partially Observable Markov Processes over the Infinite Horizon: Discounted Costs
• Constrained Discounted Dynamic Programming

This page was built for publication: Approximability and efficient algorithms for constrained fixed-horizon POMDPs with durative actions