Publications on Planning
, Tom Dean, and Steve Hanks( firstname.lastname@example.org)
Planning under uncertainty: Structural assumptions and computational
Proceedings, 2nd European Planning Workshop, 1995
( gzipped Postscript - 90 KB)
The problem of planning under uncertainty has been addressed by
researchers in many different field...
Craig, R. Dearden, and M. Goldszmidt
structure in policy construction
Proceedings of the Fourteenth IJCAI, 1995
( gzipped Postscript - 51 KB)
Markov decision processes (MDPs) have recently been applied to the
problem of modeling decision-the...
, Martin L. Puterman
Planning and Average-Reward Optimality
( gzipped Postscript - 47 KB)
We argue that many AI planning problems should be viewed as
process-oriented, where the aim...
, Samy Bengio( email@example.com)
Gradient Estimates of Return
IDIAP Research Report (abridged version presented at PASCAL workshop on principled methods of trading exploration and exploitation)
( gzipped Postscript - 185KB)
The exploration-exploitation trade-off that arises when one considers
simple point estimates of exp...
, Steve Hanks and Daniel Weld( firstname.lastname@example.org)
Probabilistic Planning with Information Gathering and Contingent
Proceedings, 2nd Conference on AI Planning Systems, June 1994
(compressed Postscript - )
Most AI representations and algorithms for plan generation have not
included the concept of informa...
, Michael L. Littman and Greg A. Keim( email@example.com)
Safely: Multi-criteria optimization in probabilistic planning
Proceedings of the Fourteenth National Conference on Artificial
(Postscript - 63KB)
racetrack problem, risk aversion...
, Michael L. Littman, Martin Mundhenk( goldsmit at cs.uky.edu)
The Complexity of Plan Existence and Evaluation in Probabilistic Domains
Proceedings of the Thirteenth Annual Conference on Uncertainty in
Artificial Intelligence (UAI--97)
(Postscript - 277KB)
We examine the computational complexity of testing and finding small
plans in probabilistic plannin...
( goldsmit at cs.uky.edu)
, Steve Hanks and Daniel Weld( firstname.lastname@example.org)
An algorithm for probabilistic planning
Artificial Intelligence, 76(1-2), 1995
(compressed Postscript - 300 KB)
We define the probabilistic planning problem in terms of a probability
distribution over initial wo...
Probabilistic Propositional Planning: Representations and Complexity
Proceedings of the Fourteenth
National Conference on Artificial Intelligence
(Postscript - 360KB)
Many representations for probabilistic propositional planning problems
have been studied. This pap...
Efficient Approximate Planning in Continuous Space Markovian Decision Problems
( gzipped Postscript - 128)
In this article we consider Monte-Carlo planning algorithms for planning in continuous state-space, ...