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

多目标启发式搜索

Multiple-Goal Heuristic Search

Technion(以色列理工学院)

D. Davidov, S. Markovitch

摘要:

本文提出了一个新的框架,随时启发式搜索的任务是实现尽可能多的目标,尽可能在分配的资源。我们展示了传统的距离估计算法对于这种类型的任务的不足,并提出了更适合于多目标搜索的替代算法。特别是,我们引入了边际效用启发式,估计成本和效益探索一个搜索节点下面的子树。我们开发了两种方法的边际效用启发式的在线学习。一种是基于局部相似性的兄弟节点的部分边际效用,和其他广义边际效用的状态特征空间。我们应用我们的自适应和非自适应多目标搜索算法的几个问题,包括重点爬行,并显示其优于现有的方法。

英文摘要:

This paper presents a new framework for anytime heuristic search where the task is to achieve as many goals as possible within the allocated resources. We show the inadequacy of traditional distance-estimation heuristics for tasks of this type and present alternative heuristics that are more appropriate for multiple-goal search. In particular, we introduce the marginal-utility heuristic, which estimates the cost and the benefit of exploring a subtree below a search node. We developed two methods for online learning of the marginal-utility heuristic. One is based on local similarity of the partial marginal utility of sibling nodes, and the other generalizes marginal-utility over the state feature space. We apply our adaptive and non-adaptive multiple-goal search algorithms to several problems, including focused crawling, and show their superiority over existing methods.

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

↑