Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search

DOI10.1002/acs.2387zbMath1331.93226arXiv1208.4773OpenAlexW1783718104MaRDI QIDQ2795793

Louis Wehenkel, Tobias Jung, Damien Ernst, Francis Maes

Publication date: 22 March 2016

Published in: International Journal of Adaptive Control and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.4773

zbMATH Keywords

optimal controlreinforcement learningdirect policy searchlook-ahead tree search

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Optimal stochastic control (93E20)

Related Items (1)

Some recent advances in learning and adaptation for uncertain feedback control systems

Uses Software

• Approxrl
• PILCO

Cites Work

• Learning heuristic functions for large state spaces
• Lipschitzian optimization without the Lipschitz constant
• Dynamic multidrug therapies for HIV: Optimal and STI control approaches
• A taxonomy of global optimization methods based on response surfaces
• Real-time heuristic search
• Learning Tetris Using the Noisy Cross-Entropy Method
• Approximate Dynamic Programming
• PROGRESSIVE STRATEGIES FOR MONTE-CARLO TREE SEARCH
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search