广度优先搜索与重启随机游走在逃离无信息启发式区域中的对比
Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions
AI总结:
本文对比了广度优先搜索(BrFS)与重启随机游走(RRWs)在逃离无信息启发式区域(UHRs)的表现,推导其期望运行时间并确定RRWs更优的场景,实验验证EHC-RRW变体在相关基准上的有效性。
摘要:
像贪婪最佳优先搜索(GBFS)和强制爬山法(EHC)这样的贪婪搜索方法在遇到无信息启发式区域(UHRs)(如启发式局部最小值或平台)时往往会陷入困境。在这项工作中,我们从理论和实证两方面比较了两种用于逃离UHRs的常用方法:广度优先搜索(BrFS)和重启随机游走(RRWs)。我们首先基于UHR的性质和随机游走过程,推导了使用BrFS和RRWs逃离UHR的期望运行时间,然后利用这些结果确定RRWs在期望上比BrFS更快的情况。接着,我们通过比较使用BrFS逃离UHR的标准EHC与使用RRWs的EHC变体(称为EHC-RRW),评估了这些方法在逃离UHRs中的表现。研究表明,在EHC已被证明有效的情况下,EHC-RRW具有很强的期望运行时间保证。我们还在PDDL规划基准上对这些方法进行了实验,以更好地理解它们在逃离UHRs方面的相对有效性。
英文摘要:
Greedy search methods like Greedy Best-First Search (GBFS) and Enforced Hill-Climbing (EHC) often struggle when faced with Uninformed Heuristic Regions (UHRs) like heuristic local minima or plateaus. In this work, we theoretically and empirically compare two popular methods for escaping UHRs in breadth-first search (BrFS) and restarting random walks (RRWs). We first derive the expected runtime of escaping a UHR using BrFS and RRWs, based on properties of the UHR and the random walk procedure, and then use these results to identify when RRWs will be faster in expectation than BrFS. We then evaluate these methods for escaping UHRs by comparing standard EHC, which uses BrFS to escape UHRs, to variants of EHC called EHC-RRW, which use RRWs for that purpose. EHC-RRW is shown to have strong expected runtime guarantees in cases where EHC has previously been shown to be effective. We also run experiments with these approaches on PDDL planning benchmarks to better understand their relative effectiveness for escaping UHRs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。