MPLP:大规模可扩展的惰性规划
MPLP: Massively Parallelized Lazy Planning
摘要:
懒惰搜索算法已被开发出来,以有效地解决计算工作量由边缘评估成本主导的领域中的规划问题。现有的算法通过智能地平衡搜索图和评估边缘之间的计算工作来操作。但是,它们被设计为作为单个进程运行,并且不利用现代处理器的多线程功能。在这项工作中,我们提出了一个大规模并行化,有界次优,懒惰搜索算法(MPLP),利用现代多核处理器。在MPLP中,图的搜索和边缘评估是完全异步并行执行的,从而大大提高了规划时间。我们在两个不同的规划域:1)运动规划的三维人形导航和2)任务和运动规划的机器人装配任务中验证了所提出的算法。我们表明,MPLP优于国家的最先进的懒惰的搜索以及并行搜索算法。MPLP的开源代码可以在这里找到:https://github.com/shohinm/parallel_search
英文摘要:
Lazy search algorithms have been developed to efficiently solve planning problems in domains where the computational effort is dominated by the cost of edge evaluation. The existing algorithms operate by intelligently balancing computational effort between searching the graph and evaluating edges. However, they are designed to run as a single process and do not leverage the multithreading capability of modern processors. In this work, we propose a massively parallelized, bounded suboptimal, lazy search algorithm (MPLP) that harnesses modern multi-core processors. In MPLP, searching of the graph and edge evaluations are performed completely asynchronously in parallel, leading to a drastic improvement in planning time. We validate the proposed algorithm in two different planning domains: 1) motion planning for 3D humanoid navigation and 2) task and motion planning for a robotic assembly task. We show that MPLP outperforms the state-of-the-art lazy search as well as parallel search algorithms. The open-source code for MPLP is available here: https://github.com/shohinm/parallel_search
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。