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: | Karaman, Sertac (Contributor), Frazzoli, Emilio (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Sage Publications,
2013-10-21T12:48:14Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Optimal Kinodynamic Motion Planning using Incremental Sampling-based Methods
by: Karaman, Sertac, et al.
Published: (2011) -
Sampling-based motion planning with deterministic u-calculus specifications
by: Karaman, Sertac, et al.
Published: (2010) -
Sampling-based motion planning with deterministic mu-calculus specifications
by: Karaman, Sertac, et al.
Published: (2010) -
An incremental sampling-based algorithm for stochastic optimal control
by: Huynh, Vu Anh, et al.
Published: (2018) -
Incremental Sampling-Based Algorithms for a Class of Pursuit-Evasion Games
by: Karaman, Sertac, et al.
Published: (2013)