Finding memoryless probabilistic relational policies for inter-task reuse

DOI10.1007/978-3-642-31715-6_13MaRDI QIDQ3143167zbMATH OpenOpenAlexFDO

Authors V. F. da Silva, Fernando A. Pereira, Anna Helena Reali Costa

Publication date 28 November 2012

Published in Communications in Computer and Information Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-31715-6_13

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Agent technology and artificial intelligence (68T42)

Recommendations

• Relational reinforcement learning
• Approximate policy iteration with a policy language bias: solving relational Markov decision processes
• First order decision diagrams for relational MDPS
• Planning in hybrid relational MDPs
• scientific article; zbMATH DE number 1775635

Cited in

(2)

• Bayesian policy reuse
• Approximate policy iteration with a policy language bias: solving relational Markov decision processes

This page was built for publication: Finding memoryless probabilistic relational policies for inter-task reuse

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3143167)