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

HyP-DESPOT:一种不确定性在线规划的混合并行算法

HyP-DESPOT: A Hybrid Parallel Algorithm for Online Planning under Uncertainty

Panpan Cai, Yuanfu Luo, David Hsu, Wee Sun Lee

摘要:

不确定性下的规划是机器人在不确定、动态环境中实现鲁棒性能的关键,但其计算代价很高。最先进的在线搜索算法,如DESPOT,大大提高了不确定性下规划的计算效率,使其成为机器人实践中的一个有价值的工具。这项工作通过利用CPU和GPU并行化更进一步,以便为具有大型状态,动作和观察空间的复杂任务实现近实时在线规划性能。具体来说,我们提出了混合并行DESPOT(HyP-DESPOT),一个大规模并行在线规划算法,集成了CPU和GPU的并行性在一个多层次的计划。它通过使用多核CPU同时遍历多个独立路径来执行并行DESPOT树搜索,并使用GPU在搜索树的叶节点处执行并行Monte-Carlo模拟。实验结果表明,HyP-DESPOT加快了高达几百倍的在线规划,与原来的DESPOT算法相比,在几个具有挑战性的机器人任务的仿真。

英文摘要:

Planning under uncertainty is critical for robust robot performance in uncertain, dynamic environments, but it incurs high computational cost. State-of-the-art online search algorithms, such as DESPOT, have vastly improved the computational efficiency of planning under uncertainty and made it a valuable tool for robotics in practice. This work takes one step further by leveraging both CPU and GPU parallelization in order to achieve near real-time online planning performance for complex tasks with large state, action, and observation spaces. Specifically, we propose Hybrid Parallel DESPOT (HyP-DESPOT), a massively parallel online planning algorithm that integrates CPU and GPU parallelism in a multi-level scheme. It performs parallel DESPOT tree search by simultaneously traversing multiple independent paths using multi-core CPUs and performs parallel Monte-Carlo simulations at the leaf nodes of the search tree using GPUs. Experimental results show that HyP-DESPOT speeds up online planning by up to several hundred times, compared with the original DESPOT algorithm, in several challenging robotic tasks in simulation.

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

↑