arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1903.08693cs.ROcs.AIcs.LG
收藏

利用局部经验进行全局运动规划

Using Local Experiences for Global Motion Planning

Rice University(莱斯大学)

Constantinos Chamzas, Anshumali Shrivastava, Lydia E. Kavraki

摘要:

基于采样的规划器在许多现实世界的应用中是有效的,例如机器人操作,导航,甚至蛋白质建模。然而,在关键区域难以采样的环境中生成无冲突路径通常具有挑战性。在没有任何先验信息的情况下,基于抽样的规划者被迫统一或渐进地探索,这可能导致性能下降。提高性能的一种方法是使用环境的先验知识来使采样策略适应手头的问题。在这项工作中,我们将工作空间分解成本地原语,通过这些原语以本地采样器的形式存储本地经验,并将它们存储在数据库中。我们合成一个有效的全球采样器检索当地的经验相关的情况。我们的方法可以有效地在共享本地原语的不同环境之间传输知识,并显着提高性能。我们的研究结果表明,在解决时间方面,在两个传统的具有挑战性的高维问题相比,国家的最先进的方法的多个数量级的改进。

英文摘要:

Sampling-based planners are effective in many real-world applications such as robotics manipulation, navigation, and even protein modeling. However, it is often challenging to generate a collision-free path in environments where key areas are hard to sample. In the absence of any prior information, sampling-based planners are forced to explore uniformly or heuristically, which can lead to degraded performance. One way to improve performance is to use prior knowledge of environments to adapt the sampling strategy to the problem at hand. In this work, we decompose the workspace into local primitives, memorizing local experiences by these primitives in the form of local samplers, and store them in a database. We synthesize an efficient global sampler by retrieving local experiences relevant to the given situation. Our method transfers knowledge effectively between diverse environments that share local primitives and speeds up the performance dramatically. Our results show, in terms of solution time, an improvement of multiple orders of magnitude in two traditionally challenging high-dimensional problems compared to state-of-the-art approaches.

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

↑