Anytime algorithms for solving possibilistic MDPs and hybrid MDPs

DOI10.1007/978-3-319-30024-5_2zbMATH Open1475.68376OpenAlexW2379182181MaRDI QIDQ2807070FDOQ2807070

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

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

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)

Cited In (3)

• Lexicographic refinements in stationary possibilistic Markov decision processes
• Lexicographic refinements in possibilistic decision trees and finite-horizon Markov decision processes
• Title not available (Why is that?)

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)