Sciweavers

111 search results - page 10 / 23
» A Planning Algorithm for Predictive State Representations
Sort
View
GECCO
2004
Springer
101views Optimization» more  GECCO 2004»
14 years 27 days ago
Trap Avoidance in Strategic Computer Game Playing with Case Injected Genetic Algorithms
Abstract. We use case injected genetic algorithms to learn to competently play computer strategy games. Such games are characterized by player decision in anticipation of opponent ...
Chris Miles, Sushil J. Louis, Rich Drewes
AAAI
1996
13 years 8 months ago
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
Craig Boutilier, David Poole
RSS
2007
136views Robotics» more  RSS 2007»
13 years 9 months ago
The Stochastic Motion Roadmap: A Sampling Framework for Planning with Markov Motion Uncertainty
— We present a new motion planning framework that explicitly considers uncertainty in robot motion to maximize the probability of avoiding collisions and successfully reaching a ...
Ron Alterovitz, Thierry Siméon, Kenneth Y. ...
AIPS
2000
13 years 8 months ago
Admissible Heuristics for Optimal Planning
hsp and hspr are two recent planners that search the state-space using an heuristic function extracted from Strips encodings. hsp does a forward search from the initial state reco...
Patrik Haslum, Hector Geffner
IJCAI
2001
13 years 9 months ago
Complexity of Probabilistic Planning under Average Rewards
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...
Jussi Rintanen