Probabilistic planning with clear preferences on missing information
From MaRDI portal
Publication:835829
DOI10.1016/j.artint.2008.10.014zbMath1191.68637OpenAlexW2123910366MaRDI QIDQ835829
Anthony Stentz, Maxim Likhachev
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
planningheuristic searchplanning with uncertaintypartially observable Markov decision processesplanning with missing information
Related Items (4)
Optimal obstacle placement with disambiguations ⋮ Penalty-Based Algorithms for the Stochastic Obstacle Scene Problem ⋮ An AO* Based Exact Algorithm for the Canadian Traveler Problem ⋮ Collective motion planning for a group of robots using intermittent diffusion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The factored policy-gradient planner
- Computational complexity of planning and approximate planning in the presence of incompleteness
- The Complexity of Markov Decision Processes
- Computationally Feasible Bounds for Partially Observed Markov Decision Processes
- LAO*: A heuristic search algorithm that finds solutions with loops
This page was built for publication: Probabilistic planning with clear preferences on missing information
