Sciweavers

4973 search results - page 852 / 995
» Probabilistic Algorithms in Robotics
Sort
View
ICML
2003
IEEE
16 years 5 months ago
Planning in the Presence of Cost Functions Controlled by an Adversary
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
H. Brendan McMahan, Geoffrey J. Gordon, Avrim Blum
KDD
2006
ACM
163views Data Mining» more  KDD 2006»
16 years 5 months ago
New EM derived from Kullback-Leibler divergence
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
Longin Jan Latecki, Marc Sobel, Rolf Lakämper
AIIA
2007
Springer
15 years 11 months ago
Reinforcement Learning in Complex Environments Through Multiple Adaptive Partitions
The application of Reinforcement Learning (RL) algorithms to learn tasks for robots is often limited by the large dimension of the state space, which may make prohibitive its appli...
Andrea Bonarini, Alessandro Lazaric, Marcello Rest...
ATAL
2007
Springer
15 years 11 months ago
Reducing the complexity of multiagent reinforcement learning
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
Andriy Burkov, Brahim Chaib-draa
ROBOCUP
2007
Springer
153views Robotics» more  ROBOCUP 2007»
15 years 10 months ago
Model-Based Reinforcement Learning in a Complex Domain
Reinforcement learning is a paradigm under which an agent seeks to improve its policy by making learning updates based on the experiences it gathers through interaction with the en...
Shivaram Kalyanakrishnan, Peter Stone, Yaxin Liu