arXivDaily arXiv每日学术速递 周一至周五更新
arXiv cs/9806102cs.AI
收藏

一种选择性宏学习算法及其在NxN滑动拼图中的应用

A Selective Macro-learning Algorithm and its Application to the NxN Sliding-Tile Puzzle

L. Finkelstein, S. Markovitch

摘要:

用于加速问题解决的最常见机制之一是宏学习。宏是在解决问题过程中获得的基本运算符序列。宏被问题求解程序当作基本运算符来使用。宏学习的主要问题是可获取的宏数量太多。宏增加了搜索空间的分支因子,并可能严重降低问题求解效率。为了使宏学习有用,程序在获取和使用宏时必须是有选择的。本文介绍了一种选择性获取宏指令的一般方法。可解决的训练问题是按照难度递增的顺序生成的。获得的唯一宏是那些将问题求解器从局部最小值带到更好状态的宏。该方法的实用程序在几个领域,包括域的NxN滑动瓷砖拼图。在学习了小谜题之后,系统能够有效地解决任何大小的谜题。

英文摘要:

One of the most common mechanisms used for speeding up problem solvers is macro-learning. Macros are sequences of basic operators acquired during problem solving. Macros are used by the problem solver as if they were basic operators. The major problem that macro-learning presents is the vast number of macros that are available for acquisition. Macros increase the branching factor of the search space and can severely degrade problem-solving efficiency. To make macro learning useful, a program must be selective in acquiring and utilizing macros. This paper describes a general method for selective acquisition of macros. Solvable training problems are generated in increasing order of difficulty. The only macros acquired are those that take the problem solver out of a local minimum to a better state. The utility of the method is demonstrated in several domains, including the domain of NxN sliding-tile puzzles. After learning on small puzzles, the system is able to efficiently solve puzzles of any size.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑