Certifying Bimanual RRT Motion Plans in a Second (2310.16603v2)
Abstract: We present an efficient method for certifying non-collision for piecewise-polynomial motion plans in algebraic reparametrizations of configuration space. Such motion plans include those generated by popular randomized methods including RRTs and PRMs, as well as those generated by many methods in trajectory optimization. Based on Sums-of-Squares optimization, our method provides exact, rigorous certificates of non-collision; it can never falsely claim that a motion plan containing collisions is collision-free. We demonstrate that our formulation is practical for real world deployment, certifying the safety of a twelve degree of freedom motion plan in just over a second. Moreover, the method is capable of discriminating the safety or lack thereof of two motion plans which differ by only millimeters.
- S. Cameron, “A study of the clash detection problem in robotics,” in Proceedings. 1985 IEEE International Conference on Robotics and Automation, vol. 2, pp. 488–493.
- L. He and J. van den Berg, “Efficient exact collision-checking of 3-d rigid body motions using linear transformations and distance computations in workspace,” in 2014 IEEE International Conference on Robotics and Automation (ICRA), pp. 2059–2064.
- M. Lin and S. Gottschalk, “Collision detection between geometric models: A survey,” in Proc. of IMA conference on mathematics of surfaces, vol. 1, 1998, pp. 602–608.
- P. M. Hubbard, “Collision detection for interactive graphics applications,” IEEE Transactions on Visualization and Computer Graphics, vol. 1, no. 3, pp. 218–230, 1995.
- M. I. Shamos and D. Hoey, “Geometric intersection problems,” in 17th Annual Symposium on Foundations of Computer Science. IEEE, 1976, pp. 208–215.
- M. C. Lin, D. Manocha, and Y. J. Kim, “Collision and proximity queries,” in Handbook of discrete and computational geometry. Chapman and Hall/CRC, 2017, pp. 1029–1056.
- J. Pan, S. Chitta, and D. Manocha, “Fcl: A general purpose library for collision and proximity queries,” in 2012 IEEE International Conference on Robotics and Automation, 2012, pp. 3859–3866.
- S. Tarbouriech and W. Suleiman, “On bisection continuous collision checking method: Spherical joints and minimum distance to obstacles,” in 2018 IEEE International Conference on Robotics and Automation (ICRA), 2018, pp. 7613–7619.
- P. Jiménez, F. Thomas, and C. Torras, “3d collision detection: a survey,” Computers & Graphics, vol. 25, no. 2, pp. 269–285, 2001.
- C. L. Jackins and S. L. Tanimoto, “Oct-trees and their use in representing three-dimensional objects,” Computer Graphics and Image Processing, vol. 14, no. 3, pp. 249–270, 1980.
- M. Tang, Y. J. Kim, and D. Manocha, “Ccq: Efficient local planning using connection collision query,” in Algorithmic Foundations of Robotics IX: Selected Contributions of the Ninth International Workshop on the Algorithmic Foundations of Robotics. Springer, 2011, pp. 229–247.
- J. Pan, L. Zhang, D. Manocha, and U. Hill, “Collision-free and curvature-continuous path smoothing in cluttered environments,” Robotics: science and systems VII, vol. 17, p. 233, 2012.
- F. Schwarzer, M. Saha, and J.-C. Latombe, “Exact collision checking of robot paths,” in Algorithmic foundations of robotics V. Springer, 2004, pp. 25–41.
- X. Zhang, S. Redon, M. Lee, and Y. J. Kim, “Continuous collision detection for articulated models using taylor models and temporal culling,” ACM Transactions on Graphics (TOG), vol. 26, no. 3, pp. 15–es, 2007.
- J. Canny, “Collision detection for moving polyhedra,” IEEE Transactions on Pattern Analysis and Machine Intelligence, no. 2, pp. 200–209, 1986.
- A. Schweikard, “Polynomial time collision detection for manipulator paths specified by joint motions,” IEEE Transactions on robotics and automation, vol. 7, no. 6, pp. 865–870, 1991.
- H. Dai, A. Amice, P. Werner, A. Zhang, and R. Tedrake, “Certified polyhedral decompositions of collision-free configuration space,” arXiv preprint arXiv:2302.12219, 2023.
- C. W. Wampler and A. J. Sommese, “Numerical algebraic geometry and algebraic kinematics,” Acta Numerica, vol. 20, 2011.
- A. Amice, H. Dai, P. Werner, A. Zhang, and R. Tedrake, “Finding and optimizing certified, collision-free regions in configuration space for robot manipulators,” in Algorithmic Foundations of Robotics XV: Proceedings of the Fifteenth Workshop on the Algorithmic Foundations of Robotics. Springer, 2022, pp. 328–348.
- T. Roh and L. Vandenberghe, “Discrete transforms, semidefinite programming, and sum-of-squares representations of nonnegative polynomials,” SIAM Journal on Optimization, vol. 16, no. 4, pp. 939–964, 2006.
- M.-D. Choi, T.-Y. Lam, and B. Reznick, “Real zeros of positive semidefinite forms. i,” Mathematische Zeitschrift, vol. 171, pp. 1–26, 1980.
- K. Mamou and F. Ghorbel, “A simple and efficient approach for 3d mesh approximate convex decomposition,” in 2009 16th IEEE international conference on image processing (ICIP), 2009, pp. 3501–3504.
- R. Tedrake and the Drake Development Team, “Drake: Model-based design and verification for robotics,” 2019. [Online]. Available: https://drake.mit.edu
- S. Redon, M. C. Lin, D. Manocha, and Y. J. Kim, “Fast continuous collision detection for articulated models,” 2005.
- C. Yuan, “Polynomial structure in semidefinite relaxations and non-convex formulations,” Ph.D. dissertation, Massachusetts Institute of Technology, 2022.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.