Barycentric quantization for planning in continuous domains

DOI10.3233/AIC-150675MaRDI QIDQ4589112zbMATH OpenFDO

Authors Daniel Nikovski

Publication date 7 November 2017

Published in AI Communications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/AIC-150675

zbMATH Keywords

Markov decision processesplanning

Mathematics Subject Classification ID

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

Recommendations

• Efficient approximate planning in continuous space Markovian decision problems
• Point-based value iteration for continuous POMDPs
• Bisimulation metrics for continuous Markov decision processes
• Planning in partially-observable switching-mode continuous domains
• Constrained quantization

This page was built for publication: Barycentric quantization for planning in continuous domains

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