Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs
From MaRDI portal
Publication:2807070
DOI10.1007/978-3-319-30024-5_2zbMath1475.68376OpenAlexW2379182181MaRDI QIDQ2807070
Lluís Godo, Kim Bauters, Weiru Liu
Publication date: 19 May 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://pureadmin.qub.ac.uk/ws/files/17738946/paper_26.pdf
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items
Lexicographic refinements in stationary possibilistic Markov decision processes ⋮ Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes
