Smoothed analysis of probabilistic roadmaps

[1]  Sergei Vassilvitskii,et al.  Worst-case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-means Method , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).

[2]  G. Swaminathan.  Robot Motion Planning , 2006 .

[3]  Jean-Claude Latombe,et al.  On the Probabilistic Foundations of Probabilistic Roadmap Planning , 2006, Int. J. Robotics Res..

[4]  Daniel A. Spielman,et al.  Improved smoothed analysis of the shadow vertex simplex method , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[5]  D. Spielman.  The Smoothed Analysis of Algorithms , 2002, FCT.

[6]  Christian Sohler,et al.  Extreme Points Under Random Noise , 2004, ESA.

[7]  Christian Sohler,et al.  Smoothed number of extreme points under uniform noise , 2004 .

[8]  Micha Sharir,et al.  Algorithmic motion planning , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[9]  Nancy M. Amato,et al.  A general framework for PRM motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[10]  Friedhelm Meyer auf der Heide,et al.  Smoothed Motion Complexity , 2003, ESA.

[11]  Kurt Mehlhorn,et al.  Smoothed Analysis of Three Combinatorial Problems , 2003, MFCS.

[12]  Shang-Hua Teng,et al.  Smoothed analysis of termination of linear programming algorithms , 2003, Math. Program..

[13]  John Dunagan,et al.  Smoothed analysis of the perceptron algorithm for linear programming , 2002, SODA '02.

[14]  Mark H. Overmars,et al.  A Comparative Study of Probabilistic Roadmap Planners , 2002, WAFR.

[15]  Vladlen Koltun,et al.  Almost tight upper bounds for vertical decompositions in four dimensions , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[16]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[17]  Jeff Erickson,et al.  Nice Point Sets Can Have Nasty Delaunay Triangulations , 2001, SCG '01.

[18]  Mark de Berg.  Linear Size Binary Space Partitions for Uncluttered Scenes , 2000, Algorithmica.

[19]  Marc Levoy,et al.  The digital Michelangelo project: 3D scanning of large statues , 2000, SIGGRAPH.

[20]  Russ Bubley,et al.  Randomized algorithms , 1995, CSUR.

[21]  Piotr Indyk,et al.  Geometric pattern matching: a performance study , 1999, SCG '99.

[22]  David E. Cardoze,et al.  Pattern matching for spatial point sets , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[23]  Angel P. del Pobil,et al.  Practical Motion Planning in Robotics: Current Approaches and Future Directions , 1998 .

[24]  Lydia E. Kavraki,et al.  Capturing the Connectivity of High-Dimensional Geometric Spaces by Parallelizable Random Sampling Techniques , 1998, IPPS/SPDP Workshops.

[25]  Lydia E. Kavraki,et al.  Probabilistic Roadmaps for Robot Path Planning , 1998 .

[26]  Lydia E. Kavraki,et al.  A Random Sampling Scheme for Path Planning , 1997, Int. J. Robotics Res..

[27]  Mark H. Overmars,et al.  Dynamic Motion Planning in Low Obstacle Density Environments , 1997, WADS.

[28]  Mark de Berg,et al.  Realistic input models for geometric algorithms , 1997, SCG '97.

[29]  Mark de Berg,et al.  Sparse Arrangements and the Number of Views of Polyhedral Scenes , 1997, Int. J. Comput. Geom. Appl..

[30]  Kenneth L. Clarkson,et al.  Nearest Neighbor Queries in Metric Spaces , 1997, STOC '97.

[31]  Rajeev Motwani,et al.  Path planning in expansive configuration spaces , 1997, Proceedings of International Conference on Robotics and Automation.

[32]  Joseph O'Rourke,et al.  Handbook of Discrete and Computational Geometry, Second Edition , 1997 .

[33]  Otfried Cheong,et al.  Range Searching in Low-Density Environments , 1996, Inf. Process. Lett..

[34]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[35]  B. Faverjon,et al.  Probabilistic Roadmaps for Path Planning in High-Dimensional Con(cid:12)guration Spaces , 1996 .

[36]  Micha Sharir,et al.  Computing Depth Orders for Fat Objects and Related Problems , 1995, Comput. Geom..

[37]  Mark de Berg,et al.  Linear Size Binary Space Partitions for Fat Objects , 1995, ESA.

[38]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[39]  Mark H. Overmars,et al.  Range Searching and Point Location among Fat Objects , 1994, J. Algorithms.

[40]  Mark H. Overmars,et al.  Motion planning amidst fat obstacles (extended abstract) , 1994, SCG '94.

[41]  A. Frank van der Stappen,et al.  Motion planning amidst fat obstacles , 1993 .

[42]  Micha Sharir,et al.  Castles in the air revisited , 1992, SCG '92.

[43]  Leonidas J. Guibas,et al.  A Singly Exponential Stratification Scheme for Real Semi-Algebraic Varieties and its Applications , 1991, Theor. Comput. Sci..

[44]  G. Pisier.  The volume of convex bodies and Banach space geometry , 1989 .