- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
The factored policy-gradient planner
Artificial Intelligence 173 (5-6):722-747 (2009)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
Understanding planner behavior.Adele E. Howe & Paul R. Cohen - 1995 - Artificial Intelligence 76 (1-2):125-166.
Discovering hidden structure in factored MDPs.Andrey Kolobov, Mausam & Daniel S. Weld - 2012 - Artificial Intelligence 189 (C):19-47.
Solving factored MDPs using non-homogeneous partitions.Kee-Eung Kim & Thomas Dean - 2003 - Artificial Intelligence 147 (1-2):225-251.
Learning from planner performance.Mark Roberts & Adele Howe - 2009 - Artificial Intelligence 173 (5-6):536-561.
Stochastic dynamic programming with factored representations.Craig Boutilier, Richard Dearden & Moisés Goldszmidt - 2000 - Artificial Intelligence 121 (1-2):49-107.
Processes and continuous change in a SAT-based planner.Ji-Ae Shin & Ernest Davis - 2005 - Artificial Intelligence 166 (1-2):194-253.
Behavior Learning Based on a Policy Gradient Method: Separation of Environmental Dynamics and State Values in Policies.Seiji Ishihara & Harukazu Igarashi - 2008 - In Tu-Bao Ho & Zhi-Hua Zhou (eds.), PRICAI 2008: Trends in Artificial Intelligence. Springer. pp. 164--174.
Making compromises among antagonist constraints in a planner.Yannick Descotte & Jean-Claude Latombe - 1985 - Artificial Intelligence 27 (2):183-217.
Efficient solutions to factored MDPs with imprecise transition probabilities.Karina Valdivia Delgado, Scott Sanner & Leliane Nunes de Barros - 2011 - Artificial Intelligence 175 (9-10):1498-1527.
Computing programs for generalized planning using a classical planner.Javier Segovia-Aguas, Sergio Jiménez & Anders Jonsson - 2019 - Artificial Intelligence 272 (C):52-85.
Analytics
Added to PP
2020-12-22
Downloads
9 (#1,523,188)
6 months
6 (#856,140)
2020-12-22
Downloads
9 (#1,523,188)
6 months
6 (#856,140)
Historical graph of downloads
Citations of this work
Discovering hidden structure in factored MDPs.Andrey Kolobov, Mausam & Daniel S. Weld - 2012 - Artificial Intelligence 189 (C):19-47.
References found in this work
Fast planning through planning graph analysis.Avrim L. Blum & Merrick L. Furst - 1997 - Artificial Intelligence 90 (1-2):281-300.
Learning to act using real-time dynamic programming.Andrew G. Barto, Steven J. Bradtke & Satinder P. Singh - 1995 - Artificial Intelligence 72 (1-2):81-138.
LAO∗: A heuristic search algorithm that finds solutions with loops.Eric A. Hansen & Shlomo Zilberstein - 2001 - Artificial Intelligence 129 (1-2):35-62.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-667477cd97-9l5tj dc2