Runtime reduction in optimal multi-query sampling-based motion planning
Sampling-based motion planning algorithms have been successfully applied to various types of high-dimensional planning tasks. Recently an extension of PRM algorithm called PRM∗ planner has been proposed which guarantees asymptotic optimal solutions in terms of path length. However, the high runtime...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | |
| Published: |
2018
|
| Online Access: | http://dspace.uniten.edu.my/jspui/handle/123456789/6958 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|