Smoothed analysis of probabilistic roadmaps
DOI10.1016/j.comgeo.2008.10.005zbMath1169.65052OpenAlexW1991435017MaRDI QIDQ1028227
Vladlen Koltun, Siddhartha Chaudhuri
Publication date: 30 June 2009
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2008.10.005
algorithmheuristicmotion planningcombinatorial complexitysmoothed analysislocally orthogonal decompositionprobabilistic roadmaprobot planning
Applications of statistics in engineering and industry; control charts (62P30) Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Complexity and performance of numerical algorithms (65Y20)
Related Items (2)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A singly exponential stratification scheme for real semi-algebraic varieties and its applications
- Nearest neighbor queries in metric spaces
- Castles in the air revisited
- Range searching in low-density environments
- Smoothed analysis of termination of linear programming algorithms
- Nice point sets can have nasty Delaunay triangulations
- Linear size binary space partitions for uncluttered scenes
- Realistic input models for geometric algorithms
- Computing depth orders for fat objects and related problems
- Almost tight upper bounds for vertical decompositions in four dimensions
- Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method
- Smoothed analysis of algorithms
- Range Searching and Point Location among Fat Objects
- Dynamic motion planning in low obstacle density environments
- Mathematical Foundations of Computer Science 2003
- Algorithms – ESA 2004
- Algorithms - ESA 2003
- Linear size binary space partitions for fat objects
This page was built for publication: Smoothed analysis of probabilistic roadmaps
