Sampling-based algorithms for optimal path planning problems
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2012. === Cataloged from PDF version of thesis. === Includes bibliographical references (p. 141-152). === Sampling-based motion planning received increasing attention during the last decade....
Main Author: | Karaman, Sertac |
---|---|
Other Authors: | Emilio Frazzoli. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2013
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/78449 |
Similar Items
-
Multi-Robot Path Planning Using Sampling-Based Algorithms and Reinforcement Learning
by: Alexander, Donald J
Published: (2021) -
Approximation algorithms for disjoint paths problems
by: Kleinberg, Jon M
Published: (2005) -
Unifying model-based programming and randomized path planning through optimal search
by: Walcott, Aisha, 1978-
Published: (2005) -
Algorithms for the shortest path problem with time windows and shortest path reoptimization in time-dependent networks
by: Glenn, Andrew M., 1978-
Published: (2014) -
Optimal path planning and high level control of an autonomous gliding underwater vehicle
by: Galea, Anna M., 1976-
Published: (2007)