The factored policy-gradient planner
From MaRDI portal
Publication:835832
DOI10.1016/J.ARTINT.2008.11.008zbMATH Open1192.68636OpenAlexW2172261094WikidataQ113442975 ScholiaQ113442975MaRDI QIDQ835832FDOQ835832
Authors: Olivier Buffet, Douglas Aberdeen
Publication date: 31 August 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2008.11.008
Recommendations
Cites Work
- Title not available (Why is that?)
- Fast planning through planning graph analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Complexity of Decentralized Control of Markov Decision Processes
- Simple statistical gradient-following algorithms for connectionist reinforcement learning
- The FF planning system: Fast plan generation through heuristic search
- Natural actor-critic algorithms
- LAO*: A heuristic search algorithm that finds solutions with loops
- Variance reduction techniques for gradient estimates in reinforcement learning
- Relational reinforcement learning
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Practical solution techniques for first-order MDPs
- Approximate policy iteration with a policy language bias: solving relational Markov decision processes
- The factored policy-gradient planner
Cited In (7)
- Probabilistic planning with clear preferences on missing information
- The factored policy-gradient planner
- Discovering hidden structure in factored MDPs
- Practical solution techniques for first-order MDPs
- Planning in artificial intelligence
- Real-time dynamic programming for Markov decision processes with imprecise probabilities
- Title not available (Why is that?)
Uses Software
This page was built for publication: The factored policy-gradient planner
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q835832)