Anytime algorithms for solving possibilistic MDPs and hybrid MDPs

DOI10.1007/978-3-319-30024-5_2MaRDI QIDQ2807070zbMATH OpenOpenAlexFDO

Authors Kim Bauters, Weiru Liu, Lluís Godo

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

Mathematics Subject Classification ID

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

Recommendations

• Efficient policies for stationary possibilistic Markov decision processes
• Sequential decision-making under uncertainty using hybrid probability-possibility functions
• Lexicographic refinements in stationary possibilistic Markov decision processes
• Efficient solutions to factored MDPs with imprecise transition probabilities
• Real-time dynamic programming for Markov decision processes with imprecise probabilities

Cited in

(3)

• Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes
• Lexicographic refinements in stationary possibilistic Markov decision processes
• scientific article; zbMATH DE number 2086480 (Why is no real title available?)

This page was built for publication: Anytime algorithms for solving possibilistic MDPs and hybrid MDPs

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