58 search results - page 11 / 12 » Using Learned Policies in Heuristic-Search Planning |
ICML
2008
IEEE
14 years 6 months ago
2008
IEEE
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
AAAI
2010
13 years 7 months ago
2010
Embedded systems consisting of collaborating agents capable of interacting with their environment are becoming ubiquitous. It is crucial for these systems to be able to adapt to t...
JMLR
2010
13 years 7 days ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
HRI
2007
ACM
13 years 9 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...