Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance

@inproceedings{Janson2015DeterministicSM,
  title={Deterministic Sampling-Based Motion Planning: Optimality, Complexity, and Performance},
  author={Lucas Janson and Brian Ichter and Marco Pavone},
  booktitle={ISRR},
  year={2015}
}
Probabilistic sampling-based algorithms, such as the probabilistic roadmap (PRM) and the rapidly-exploring random tree (RRT) algorithms, represent one of the most successful approaches to robotic motion planning, due to their strong theoretical properties (in terms of probabilistic completeness or even asymptotic optimality) and remarkable practical performance. Such algorithms are probabilistic in that they compute a path by connecting independently and identically distributed (i.i.d.) random… CONTINUE READING
Highly Cited
This paper has 32 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

Learning Sampling Distributions for Robot Motion Planning

2018 IEEE International Conference on Robotics and Automation (ICRA) • 2018
View 4 Excerpts
Highly Influenced

A virtual bug planning technique for 2D robot path planning

2018 Annual American Control Conference (ACC) • 2018
View 1 Excerpt

Group Marching Tree: Sampling-Based Approximately Optimal Motion Planning on GPUs

2017 First IEEE International Conference on Robotic Computing (IRC) • 2017
View 3 Excerpts
Method Support