Sciweavers

698 search results - page 90 / 140
» A Deterministic Algorithm for Solving Imprecise Decision Pro...
Sort
View
GECCO
2006
Springer
208views Optimization» more  GECCO 2006»
14 years 24 days ago
Comparing evolutionary and temporal difference methods in a reinforcement learning domain
Both genetic algorithms (GAs) and temporal difference (TD) methods have proven effective at solving reinforcement learning (RL) problems. However, since few rigorous empirical com...
Matthew E. Taylor, Shimon Whiteson, Peter Stone
FLAIRS
1998
13 years 10 months ago
Analytical Design of Reinforcement Learning Tasks
Reinforcement learning (RL) problems constitute an important class of learning and control problems faced by artificial intelligence systems. In these problems, one is faced with ...
Robert E. Smith
ICML
2006
IEEE
14 years 10 months ago
Relational temporal difference learning
We introduce relational temporal difference learning as an effective approach to solving multi-agent Markov decision problems with large state spaces. Our algorithm uses temporal ...
Nima Asgharbeygi, David J. Stracuzzi, Pat Langley
CDC
2008
IEEE
118views Control Systems» more  CDC 2008»
14 years 3 months ago
A density projection approach to dimension reduction for continuous-state POMDPs
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...
Enlu Zhou, Michael C. Fu, Steven I. Marcus
IJCAI
2001
13 years 10 months ago
Symbolic Dynamic Programming for First-Order MDPs
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
Craig Boutilier, Raymond Reiter, Bob Price