GePA*SE:用于慢求值的广义基于边的并行A*
GePA*SE: Generalized Edge-Based Parallel A* for Slow Evaluations
摘要:
并行搜索算法已被证明可以通过利用现代处理器的多线程能力来提高规划速度。一种这样的算法PA*SE通过并行化状态扩展来实现这一点,而另一种算法ePA*SE通过有效地并行化边缘评估来实现这一点。ePA*SE针对的是操作空间包含评估时间昂贵但相似的操作的领域。然而,在许多机器人领域,动作空间是异质的计算工作所需的评估成本的行动和它的结果。基于此,我们引入了GePA*SE:Generalized Edge-based Parallel A* for Slow Evaluations,它概括了PA*SE和ePA*SE的关键思想,即状态扩展和边缘评估的并行化。这将其适用性扩展到具有需要不同计算努力来评估它们的动作的域。GePA*SE的开源代码以及基线可在以下网站获取:https://github.com/shohinm/parallel_search
英文摘要:
Parallel search algorithms have been shown to improve planning speed by harnessing the multithreading capability of modern processors. One such algorithm PA*SE achieves this by parallelizing state expansions, whereas another algorithm ePA*SE achieves this by effectively parallelizing edge evaluations. ePA*SE targets domains in which the action space comprises actions with expensive but similar evaluation times. However, in a number of robotics domains, the action space is heterogenous in the computational effort required to evaluate the cost of an action and its outcome. Motivated by this, we introduce GePA*SE: Generalized Edge-based Parallel A* for Slow Evaluations, which generalizes the key ideas of PA*SE and ePA*SE i.e. parallelization of state expansions and edge evaluations respectively. This extends its applicability to domains that have actions requiring varying computational effort to evaluate them. The open-source code for GePA*SE along with the baselines is available here: https://github.com/shohinm/parallel_search
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。