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

改进的安全实时的启发式搜索

Improved Safe Real-time Heuristic Search

University of New Hampshire(新罕布什尔大学)

Bence Cserna, Kevin C. Gall, Wheeler Ruml

摘要:

实时的【形】规划中的一个基本问题是状态空间中存在死胡同,从死胡同中无法到达目标。最近,SafeRTS算法被提出用于在这样的空间中进行搜索。SafeRTS利用用户提供的谓词来识别安全状态,从该状态可以达到目标,并尝试维护备份计划以始终达到安全状态。在本文中,我们研究了SafeRTS方法,确定其行为的某些属性,并设计了一个改进的框架,安全的实时的【形】搜索。我们证明,新的方法执行至少以及SafeRTS和目前的实验结果表明,它的承诺是在实践中实现。

英文摘要:

A fundamental concern in real-time planning is the presence of dead-ends in the state space, from which no goal is reachable. Recently, the SafeRTS algorithm was proposed for searching in such spaces. SafeRTS exploits a user-provided predicate to identify safe states, from which a goal is likely reachable, and attempts to maintain a backup plan for reaching a safe state at all times. In this paper, we study the SafeRTS approach, identify certain properties of its behavior, and design an improved framework for safe real-time search. We prove that the new approach performs at least as well as SafeRTS and present experimental results showing that its promise is fulfilled in practice.

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

↑