z-logo
open-access-imgOpen Access
Pruning for Monte Carlo Distributed Reinforcement Learning in Decentralized POMDPs
Author(s) -
Bikramjit Banerjee
Publication year - 2013
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v27i1.8670
Subject(s) - reinforcement learning , computer science , markov decision process , monte carlo tree search , partially observable markov decision process , bellman equation , monte carlo method , benchmark (surveying) , pruning , mathematical optimization , computation , sample (material) , artificial intelligence , observable , markov process , machine learning , markov chain , algorithm , mathematics , markov model , chemistry , biology , geodesy , chromatography , agronomy , statistics , geography , quantum mechanics , physics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom