Probabilistic planning with clear preferences on missing information
type: Item
instance of: scholarly article
title: Probabilistic planning with clear preferences on missing information
zbMATH Open document ID: 1191.68637
author: Maxim Likhachev
author: Anthony Stentz
published in: Artificial Intelligence
publication date: 2009-08-31T00:00:00Z
full work available at URL: https://repository.upenn.edu/grasp_papers/25
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5600152
zbMATH Keywords: planning with uncertainty
zbMATH Keywords: planning with missing information
zbMATH Keywords: partially observable Markov decision processes
zbMATH Keywords: planning
zbMATH Keywords: heuristic search
MaRDI profile type: Publication
OpenAlex ID: W2123910366
cites work: The Complexity of Markov Decision Processes
cites work: Computational complexity of planning and approximate planning in the presence of incompleteness
cites work: Q4315289
cites work: LAO*: A heuristic search algorithm that finds solutions with loops
cites work: The factored policy-gradient planner
cites work: Q3624036
cites work: Computationally Feasible Bounds for Partially Observed Markov Decision Processes
cites work: Q4940940
DOI: 10.1016/J.ARTINT.2008.10.014
description: scientific article; zbMATH DE number 5600152