Probabilistic planning with clear preferences on missing information

DOI10.1016/J.ARTINT.2008.10.014zbMATH Open1191.68637OpenAlexW2123910366MaRDI QIDQ835829FDOQ835829

Authors: Maxim Likhachev, Anthony Stentz 

Publication date: 31 August 2009

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://repository.upenn.edu/grasp_papers/25

Recommendations

• scientific article; zbMATH DE number 1844461
• Probabilistic planning via heuristic forward search and weighted model counting
• Strong planning under partial observability
• Performance bounds for planning in unknown terrain
• Planning with incomplete information (invited paper)

zbMATH Keywords

partially observable Markov decision processesplanningheuristic searchplanning with uncertaintyplanning with missing information

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• The Complexity of Markov Decision Processes
• LAO*: A heuristic search algorithm that finds solutions with loops
• Anytime point-based approximations for large POMDPS
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Title not available (Why is that?)
• Computationally Feasible Bounds for Partially Observed Markov Decision Processes
• The factored policy-gradient planner

Cited In (4)

• Penalty-based algorithms for the stochastic obstacle scene problem
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• Collective motion planning for a group of robots using intermittent diffusion
• Optimal obstacle placement with disambiguations

This page was built for publication: Probabilistic planning with clear preferences on missing information

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