Sciweavers

58 search results - page 5 / 12
» Using Learned Policies in Heuristic-Search Planning
Sort
View
ATAL
2009
Springer
15 years 4 months ago
Point-based incremental pruning heuristic for solving finite-horizon DEC-POMDPs
Recent scaling up of decentralized partially observable Markov decision process (DEC-POMDP) solvers towards realistic applications is mainly due to approximate methods. Of this fa...
Jilles Steeve Dibangoye, Abdel-Illah Mouaddib, Bra...
ROBOCUP
2007
Springer
153views Robotics» more  ROBOCUP 2007»
15 years 3 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
ICML
1997
IEEE
15 years 10 months ago
Robot Learning From Demonstration
The goal of robot learning from demonstration is to have a robot learn from watching a demonstration of the task to be performed. In our approach to learning from demonstration th...
Christopher G. Atkeson, Stefan Schaal
NIPS
2003
14 years 11 months ago
Approximate Planning in POMDPs with Macro-Actions
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
Georgios Theocharous, Leslie Pack Kaelbling
JAIR
2011
144views more  JAIR 2011»
14 years 4 months ago
Non-Deterministic Policies in Markovian Decision Processes
Markovian processes have long been used to model stochastic environments. Reinforcement learning has emerged as a framework to solve sequential planning and decision-making proble...
Mahdi Milani Fard, Joelle Pineau