Sampling-based algorithms for optimal motion planning
During the last decade, sampling-based path planning algorithms, such as probabilistic roadmaps (PRM) and rapidly exploring random trees (RRT), have been shown to work well in practice and possess theoretical guarantees such as probabilistic completeness. However, little effort has been devoted to t...
| Main Authors: | , |
|---|---|
| Other Authors: | , |
| Format: | Article |
| Language: | English |
| Published: |
Sage Publications,
2013-10-21T12:48:14Z.
|
| Subjects: | |
| Online Access: | Get fulltext |