Deterministic sampling methods for spheres and SO(3)

This paper addresses the problem of generating uniform deterministic samples over the spheres and the three-dimensional rotation group, SO(3). The target applications include motion planning, optimization, and verification problems in robotics and in related areas, such as graphics, control theory and computational biology. We introduce an infinite sequence of samples that is shown to achieve: 1) low-dispersion, which aids in the development of resolution complete algorithms, 2) lattice structure, which allows easy neighbor identification that is comparable to what is obtained for a grid in /spl Ropf//sup d/, and 3) incremental quality, which is similar to that obtained by random sampling. The sequence is demonstrated in a sampling-based motion planning algorithm.

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

[2]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[3]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[4]  Gerald B. Folland,et al.  Real Analysis: Modern Techniques and Their Applications , 1984 .

[5]  J. Halton.  On the efficiency of certain quasi-random sequences of points in evaluating multi-dimensional integrals , 1960 .

[6]  Nancy M. Amato,et al.  A randomized roadmap method for path and manipulation planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[7]  Jean-Claude Latombe,et al.  A Monte-Carlo algorithm for path planning with many degrees of freedom , 1990, Proceedings., IEEE International Conference on Robotics and Automation.

[8]  Thierry Siméon,et al.  Visibility-based probabilistic roadmaps for motion planning , 2000, Adv. Robotics.

[9]  Ken Shoemake,et al.  Animating rotation with quaternion curves , 1985, SIGGRAPH.

[10]  Oussama Khatib,et al.  Real-Time Obstacle Avoidance for Manipulators and Mobile Robots , 1985, Autonomous Robot Vehicles.

[11]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[12]  Yong Yu,et al.  On sensor-based roadmap: a framework for motion planning for a manipulator arm in unknown environments , 1998, Proceedings. 1998 IEEE/RSJ International Conference on Intelligent Robots and Systems. Innovations in Theory, Practice and Applications (Cat. No.98CH36190).

[13]  A. G. Sukharev.  Optimal strategies of the search for an extremum , 1971 .

[14]  James Arvo,et al.  Stratified sampling of spherical triangles , 1995, SIGGRAPH.

[15]  Steven M. LaValle,et al.  Quasi-randomized path planning , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[16]  Ken Shoemake,et al.  Uniform Random Rotations , 1992, Graphics Gems III.

[17]  Harald Niederreiter,et al.  Random number generation and Quasi-Monte Carlo methods , 1992, CBMS-NSF regional conference series in applied mathematics.

[18]  M. Blümlinger.  Slice discrepancy and irregularities of distribution on spheres , 1991 .

[19]  Steven M. LaValle,et al.  Incremental low-discrepancy lattice methods for motion planning , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).