.png){kind=icon}
返回
Parallel Motion Planning Using Poisson-Disk Sampling
.png){kind=icon}
OA
AI
DOI：10.1109/TRO.2016.2632160.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We present a rapidly exploring-random-tree-based parallel motion planning algorithm that uses the maximal Poisson-disk sampling scheme. Our approach exploits the free-disk property of the maximal Poisson-disk samples to generate nodes and perform tree expansion. Furthermore, we use an adaptive scheme to generate more samples in challenging regions of the configuration space. The Poisson-disk sampling results in improved parallel performance and we highlight the performance benefits on multicore central processing units as well as manycore graphics processing units on different benchmarks.
Keyword:
Motion planning
parallel algorithm
Poisson-disk sampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
引用论文
.png){kind=icon}
Recurrent Prolonged Erections and Priapism as a Sequela of Priapism: Pathophysiology and Management
PREAI
分享收藏
查看更多内容