首页 | 本学科首页   官方微博 | 高级检索  
     


Learning to search: From weak methods to domain-specific heuristics
Authors:Pat Langley
Affiliation:The Robotics Institute Carnegie-Mellon University USA
Abstract:Learning from experience involves three distinct components—generating behavior, assigning credit, and modifying behavior. We discuss these components in the context of learning search heuristics, along with the types of learning that can occur. We then focus on SAGE, a system that improves its search strategies with practice. The program is implemented as a production system, and learns by creating and strengthening rules for proposing moves. SAGE incorporates five different heuristics for assigning credit and blame, and employs a discrimination process to direct its search through the space of rules. The system has shown its generality by learning heuristics for directing search in six different task domains. In addition to improving its search behavior on practice problems, SAGE is able to transfer its expertise to scaled-up versions of a task, and in one case, transfers its acquired search strategy to problems with different initial and goal states.
Keywords:Correspondence and requests for reprints should be sent to Pat Langley   Department of Information and Computer Science   University of California   Irvine   CA 92717.
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号