Probabilistic planning with clear preferences on missing information

DOI10.1016/J.ARTINT.2008.10.014MaRDI QIDQ835829zbMATH OpenOpenAlexFDO

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

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)

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)

Cites work

• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1407685 (Why is no real title available?)
• Anytime point-based approximations for large POMDPS
• Computational complexity of planning and approximate planning in the presence of incompleteness
• Computationally Feasible Bounds for Partially Observed Markov Decision Processes
• LAO*: A heuristic search algorithm that finds solutions with loops
• The Complexity of 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)