Sciweavers

242 search results - page 10 / 49
» Provably Bounded Optimal Agents
Sort
View
AAAI
2006
13 years 9 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...
CIMCA
2005
IEEE
13 years 9 months ago
Fuzzy System Modeling with the Genetic and Differential Evolutionary Optimization
This paper compares the performance of two provably successful evolutionary optimization tools in the optimization of a Fuzzy-Rule-Base (FRB) for the three well known fuzzy modeli...
Mehmet Bodur, Adnan Acan, Talip Akyol
ICAART
2010
INSTICC
14 years 5 months ago
Complexity of Stochastic Branch and Bound Methods for Belief Tree Search in Bayesian Reinforcement Learning
There has been a lot of recent work on Bayesian methods for reinforcement learning exhibiting near-optimal online performance. The main obstacle facing such methods is that in most...
Christos Dimitrakakis
IJCAI
2001
13 years 9 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
CDC
2010
IEEE
130views Control Systems» more  CDC 2010»
13 years 2 months ago
Generalized efficiency bounds in distributed resource allocation
Game theory is emerging as a popular tool for distributed control of multiagent systems. In order to take advantage of these game theoretic tools the interactions of the autonomous...
Jason R. Marden, Tim Roughgarden