Real-time decision making for large POMDPs

DOI10.1007/11424918_49MaRDI QIDQ5463892zbMATH OpenOpenAlexFDO

Authors Sébastien Paquet, Ludovic Tobin, Brahim Chaib-draa

Publication date 17 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b136277

Mathematics Subject Classification ID

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

Recommendations

• Online planning algorithms for POMDPS
• Optimal action criterion and algorithm improvement of real-time dynamic programming
• Heuristic anytime approaches to stochastic decision processes
• A fast approximation method for partially observable Markov decision processes
• Point-Based Online Value Iteration Algorithm for POMDPs

Cited in

(4)

• Dynamic decision making: a comparison of approaches
• Optimal action criterion and algorithm improvement of real-time dynamic programming
• Online planning algorithms for POMDPS
• Real-time decision problems: an operational research perspective

This page was built for publication: Real-time decision making for large POMDPs

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