Sciweavers

206 search results - page 13 / 42
» Learning Heuristic Functions from Relaxed Plans
Sort
View
AAAI
2006
14 years 11 months ago
Value-Function-Based Transfer for Reinforcement Learning Using Structure Mapping
Transfer learning concerns applying knowledge learned in one task (the source) to improve learning another related task (the target). In this paper, we use structure mapping, a ps...
Yaxin Liu, Peter Stone
ECAI
2000
Springer
15 years 2 months ago
Towards Real-Time Search with Inadmissible Heuristics
Real-time search has two aspects, one as an efficient search method (in a single problem solving trial), and the other as an overall problem solving architecture with learning abi...
Masashi Shimbo, Toru Ishida
IJRR
2010
177views more  IJRR 2010»
14 years 8 months ago
Learning from Demonstration for Autonomous Navigation in Complex Unstructured Terrain
Rough terrain autonomous navigation continues to pose a challenge to the robotics community. Robust navigation by a mobile robot depends not only on the individual performance of ...
David Silver, J. Andrew Bagnell, Anthony Stentz
JAIR
2010
131views more  JAIR 2010»
14 years 8 months ago
Automatic Induction of Bellman-Error Features for Probabilistic Planning
Domain-specific features are important in representing problem structure throughout machine learning and decision-theoretic planning. In planning, once state features are provide...
Jia-Hong Wu, Robert Givan
DCOSS
2011
Springer
13 years 9 months ago
Planning the trajectories of multiple mobile sinks in large-scale, time-sensitive WSNs
—Controlled sink mobility has been shown to be very beneficial in lifetime prolongation of wireless sensor networks (WSNs) by avoiding the typical hot-spot problem near the sink...
Wint Yi Poe, Michael Beck, Jens B. Schmitt