arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.08256cs.AI
收藏

基于积木块的实时的的启发式搜索算法

Evolving Real-Time Heuristics Search Algorithms with Building Blocks

University of Alberta(阿尔伯塔大学)

Md Solimul Chowdhury, Victor Silva

摘要:

在实时的【形】搜索领域,产生了很多算法。在实时的【形】算法搜索研究领域,我们经常会发现,在一组问题上表现得比算法Y好的算法X,在另一组问题上表现得比算法Y差。如果将这些已发表的算法组合起来,生成一个更强大的算法空间,那么这个新的算法空间可能会更有效地解决一系列问题。基于这种直觉,最近的工作Bulitko 2016已经定义了寻找一个组合的搜索算法作为生存任务的任务。在这种进化方法中,算法的空间被定义在一组已发布的算法的构建块上,并且模拟进化被用于重组这些构建块以从该算法空间中找出最佳算法。在本文中,我们扩展了一组积木,增加了一个已发表的算法,即前瞻性的A-星形局部搜索空间生成方法从LSSLRTA-星,加上一个未发表的新的策略,以产生局部搜索空间与贪婪最佳优先搜索。然后在新的算法空间中进行实验,结果表明进化过程选择的最优算法具有如下性质:算法的前瞻深度越深,其次优性和擦洗复杂度越低。

英文摘要:

The research area of real-time heuristics search has produced quite many algorithms. In the landscape of real-time heuristics search research, it is not rare to find that an algorithm X that appears to perform better than algorithm Y on a group of problems, performed worse than Y for another group of problems. If these published algorithms are combined to generate a more powerful space of algorithms, then that novel space of algorithms may solve a distribution of problems more efficiently. Based on this intuition, a recent work Bulitko 2016 has defined the task of finding a combination of heuristics search algorithms as a survival task. In this evolutionary approach, a space of algorithms is defined over a set of building blocks published algorithms and a simulated evolution is used to recombine these building blocks to find out the best algorithm from that space of algorithms. In this paper, we extend the set of building blocks by adding one published algorithm, namely lookahead based A-star shaped local search space generation method from LSSLRTA-star, plus an unpublished novel strategy to generate local search space with Greedy Best First Search. Then we perform experiments in the new space of algorithms, which show that the best algorithms selected by the evolutionary process have the following property: the deeper is the lookahead depth of an algorithm, the lower is its suboptimality and scrubbing complexity.

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

↑