Sciweavers

4817 search results - page 822 / 964
» Learning Models of Intelligent Agents
Sort
View
AAAI
2006
15 years 5 months ago
Compact, Convex Upper Bound Iteration for Approximate POMDP Planning
Partially observable Markov decision processes (POMDPs) are an intuitive and general way to model sequential decision making problems under uncertainty. Unfortunately, even approx...
Tao Wang, Pascal Poupart, Michael H. Bowling, Dale...
AAAI
2000
15 years 5 months ago
The Game of Hex: An Automatic Theorem Proving Approach to Game Programming
The game of Hex is a two-player game with simple rules, a deep underlying mathematical beauty, and a strategic complexity comparable to that of Chess and Go. The massive game-tree...
Vadim V. Anshelevich
AAAI
1998
15 years 5 months ago
Qualitative Analysis of Distributed Physical Systems with Applications to Control Synthesis
Manyimportant physical phenomena,such as temperature distribution, air flow, and acoustic waves,are describedas continuous,distributed parameterfields. Analyzingandcontrolling the...
Christopher Bailey-Kellogg, Feng Zhao
AAAI
1998
15 years 5 months ago
Solving Very Large Weakly Coupled Markov Decision Processes
We present a technique for computing approximately optimal solutions to stochastic resource allocation problems modeled as Markov decision processes (MDPs). We exploit two key pro...
Nicolas Meuleau, Milos Hauskrecht, Kee-Eung Kim, L...
AAAI
1997
15 years 5 months ago
Incremental Methods for Computing Bounds in Partially Observable Markov Decision Processes
Partially observable Markov decision processes (POMDPs) allow one to model complex dynamic decision or control problems that include both action outcome uncertainty and imperfect ...
Milos Hauskrecht