Hit-and-Run for Sampling and Planning in Non-Convex Spaces

We propose the Hit-and-Run algorithm for planning and sampling problems in non- convex spaces. For sampling, we show the first analysis of the Hit-and-Run algorithm in non-convex spaces and show that it mixes fast as long as certain smoothness conditions are satisfied. In particular, our analysis reveals an intriguing connection between fast mixing and the existence of smooth measure-preserving mappings from a convex space to the non-convex space. For planning, we show advantages of Hit-and- Run compared to state-of-the-art planning methods such as Rapidly-Exploring Random Trees.

[1]  Robert L. Smith,et al.  Efficient Monte Carlo Procedures for Generating Points Uniformly Distributed over Bounded Regions , 1984, Oper. Res..

[2]  I. Fonseca,et al.  Equilibrium configurations of defective crystals , 1992 .

[3]  Miklós Simonovits,et al.  Random Walks in a Convex Body and an Improved Volume Algorithm , 1993, Random Struct. Algorithms.

[4]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[5]  László Lovász,et al.  Hit-and-run mixes fast , 1999, Math. Program..

[6]  Steven M. LaValle,et al.  Randomized Kinodynamic Planning , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[7]  Santosh S. Vempala,et al.  Hit-and-run from a corner , 2004, STOC '04.

[8]  Santosh S. Vempala,et al.  The geometry of logconcave functions and sampling algorithms , 2007, Random Struct. Algorithms.

[9]  S. Vempala.  Geometric Random Walks: a Survey , 2007 .

[10]  J. Griepentrog,et al.  A bi-Lipschitz continuous, volume preserving map from the unit ball onto a cube , 2008 .

[11]  Santosh S. Vempala,et al.  Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families , 2009, ArXiv.

[12]  Csaba Szepesvári,et al.  Extending rapidly-exploring random trees for asymptotically optimal anytime motion planning , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Emilio Frazzoli,et al.  Incremental Sampling-based Algorithms for Optimal Motion Planning , 2010, Robotics: Science and Systems.

[14]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..