Proximity queries between convex objects: An interior point approach for implicit surfaces

IEEE Transactions on Robotics

Volumn 24, Issue 1, 2008, Pages 211-220

  Chakraborty, Nilanjan ^a   Peng, Jufeng ^a,b   Akella, Srinivas ^a   Mitchell, John E ^c  

^a Rensselaer Polytechnic Institute   (United States)

^b Progressive Corporation   (United States)

^c Rensselaer Polytechnic Institute   (United States)

Author keywords

Closest points; Collision detection; Implicit surfaces; Interior point algorithms; Proximity query

Indexed keywords

COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; CONVERGENCE OF NUMERICAL METHODS; OPTIMIZATION; POLYNOMIALS;

CLOSEST POINTS; CONVEX OPTIMIZATION PROBLEM; IMPLICIT SURFACES; INTERIOR POINT ALGORITHMS; PROXIMITY QUERY;

MOTION PLANNING;

EID: 40949151209     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2007.914851     Document Type: Article

References (48)

1. D. Baraff, "Curved surfaces and coherence for nonpenetrating rigid body simulation," Comput. Graph., vol. 24, no. 4, pp. 19-28, Aug. 1990.
2. A. H. Barr, "Superquadrics and angle-preserving transformations," IEEE Comput. Graph. Appl., vol. 1, no. 1, pp. 11-23, Jan. 1981.
3. M. S. Bazaraa, H. D. Sherali, and C. M. Shetty, Nonlinear Programming: Theory and Algorithms, 2nd ed. New York: Wiley, 1993.
4. J. E. Bobrow, "A direct minimization approach for obtaining the distance between convex polyhedra," Int. J. Robot. Res., vol. 8, no. 3, pp. 65-76, Jun. 1989.
5. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge, U.K.: Cambridge Univ. Press, 2004.
6. M. Buss and T. Schlegl, "A discrete-continuous control approach to dextrous manipulation," in Proc. IEEE Int. Conf. Robot. Autom., 2000, pp. 276-281.
7. R. Byrd, J. Nocedal, and R. A. Waltz, "Knitro: An integrated package for nonlinear optimization," in Large Scale Nonlinear Optimization G. de Pillo and M. Roma, Eds. New York: Springer-Verlag, 2006, pp. 35-59.
8. S. Cameron, "Collision detection by four-dimensional intersection testing," IEEE Trans. Robot. Autom., vol. 6, no. 3, pp. 291-302, Jun. 1990.
9. S. Cameron, "A comparison of two fast algorithms for computing the distance between convex polyhedra," IEEE Trans. Robot. Autom., vol. 13, no. 6, pp. 915-920, Dec. 1997.
10. M.-P. Cani-Gascuel and M. Desbrun, "Animation of deformable models using implicit surfaces," IEEE Trans. Vis. Comput. Graph., vol. 3, no. 1, pp. 39-50, Jan.-Mar. 1997.
11. J. Canny, "Collision detection for moving polyhedra," IEEE Trans. Pattern Anal. Mach. Intell., vol. 8, no. 2, pp. 200-209, Mar. 1986.
12. N. Chakraborty, J. Peng, S. Akella, and J. Mitchell, "Proximity queries between convex objects: An interior point approach for implicit surfaces," in Proc. IEEE Int. Conf. Robot. Autom., Orlando, FL, May 2006, pp. 1910-1916.
13. D. Constantinescu, S. Salcudean, and E. Croft, "Haptic rendering of rigid contacts using impulsive and penalty forces," IEEE Trans. Robot., vol. 21, no. 3, pp. 309-323, Jun. 2005.
14. V. Copolla and J. Woodburn, "Determination of close approaches based on ellipsoidal threat volumes," in Proc. Adv. Astron. Sci.: Spaceflight Mech., 1999, vol. 102, pp. 1013-1024.
15. J. Czyzyk, M. Mesnier, and J. More. (1998). The NEOS server. IEEE J. Comput. Sci. Eng. [Online]. 5, pp. 68-75. Available: http:// www.mcs.anl.gov/neos/Server/
16. D. P. Dobkin and D. G. Kirkpatrick, "A linear algorithm for determining the separation of convex polyhedra," J. Algorithms, vol. 6, pp. 381-392, 1985.
17. T. Duff, "Interval arithmetic and recursive subdivision for implicit functions and constructive solid geometry," Comput. Graph., vol. 26, no. 2, pp. 131-138, 1992.
18. E. G. Gilbert and C.-P. Foo, "Computing the distance between general convex objects in three-dimensional space," IEEE Trans. Robot. Autom., vol. 6, no. 1, pp. 53-61, Feb. 1990.
19. E. G. Gilbert, D. W. Johnson, and S. S. Keerthi, "A fast procedure for computing the distance between complex objects in three-dimensional space," IEEE Trans. Robot. Autom., vol. 4, no. 2, pp. 193-203, Apr. 1988.
20. P. E. Gill, W. Murray, and M. A. Saunders, "SNOPT: An SQP algorithm for large-scale constrained optimization," SIAM J. Optim., vol. 12, no. 4, pp. 979-1006, 2002.
21. p-norm optimization," J. Optim. Theory Appl., vol. 122, no. 2, pp. 285-307, Aug. 2004.
22. A. J. Hanson, "Hyperquadrics: Smoothly deformable shapes with convex polyhedral bounds," Comput. Vis., Graph., Image Process., vol. 44, no. 2, pp. 191-210, Nov. 1988.
23. P. Jimenez, F. Thomas, and C. Torras, "3-D collision detection: A survey," Comput. Graph., vol. 25, no. 2, pp. 269-285, 2001.
24. E. Larsen, S. Gottschalk, M. Lin, and D. Manocha, "Fast distance queries using rectangular swept sphere volumes," in Proc. IEEE Int. Conf. Robot. Autom., San Francisco, CA, Apr. 2000, pp. 3719-3726.
25. C. Lennerz and E. Schömer, "Efficient distance computation for quadratic curves and surfaces," in Proc. Geom. Modeling Process. (GMP 2002), Saitama, Japan, Jul., pp. 60-69.
26. A. Lin and S.-P. HaD, "On the distance between two ellipsoids," SIAM J. Optim., vol. 13, no. 1, pp. 298-308, 2003.
27. M. Lin and D. Manocha, "Efficient contact determination in dynamic environments," Int. J. Comput. Geom. Appl., vol. 7, no. 1/2, pp. 123-151, 1997.
28. M. C. Lin and J. F. Canny, "A fast algorithm for incremental distance calculation," in Proc. IEEE Int. Conf. Robot. Autom., Sacramento, CA, Apr. 1991, vol. 2, pp. 1008-1014.
29. M. C. Lin and D. Manocha, "Collision and proximity queries," in Handbook of Discrete and Computational Geometry, J. E. Goodman and J. O. Rourke, Eds., 2nd ed. Boca Raton, FL: Chapman and Hall/CRC Press, 2004, pp. 787-808.
30. Q. Luo and J. Xiao, "Physically accurate haptic rendering with dynamic effects," IEEE Comput. Graph. Appl., vol. 24, no. 6, pp. 60-69, Nov./Dec. 2004.
31. B. Mirtich, "V-Clip: Fast and robust polyhedral collision detection," ACM Trans. Graph., vol. 17, no. 3, pp. 177-208, Jul. 1998.
32. B. Mirtich and J. Canny, "Impulse-based dynamic simulation," in Algorithmic Foundations of Robotics, K. Y. Goldberg, D. Halperin, J.-C. Latombe, and R. H. Wilson, Eds. Wellesley, MA: A. K. Peters, 1995.
33. J. Nocedal and S. J. Wright, Numerical Optimization. New York: Springer-Verlag, 1999.
34. J. Peng, "Multiple robot coordination: A mathematical programming approach," Ph.D. dissertation, Dept. Math. Sci., Rensselaer Polytechnic Institute, Troy, NY, May 2005.
35. S. Quinlan, "Efficient distance computation between non-convex objects," in Proc. IEEE Int. Conf. Robot. Autom., San Diego, CA, May 1994, pp. 3324-3329.
36. S. Redon, A. Kheddar, and S. Coquillart, "Fast continuous collision detection between rigid bodies," Comput. Graph. Forum (Eurographics 2002 Proc.), vol. 21, no. 3, pp. 279-287, 2002.
37. S. Redon, Y. J. Kim, M. C. Lin, and D. Manocha, "Fast continuous collision detection for articulated models," presented at the ACM Symp. Solid Modeling Appl., Genova, Italy, 2004.
38. J. Snyder, A. Woodbury, K. Fleischer, B. Currin, and A. Barr, "Interval methods for multi-point collisions between time-dependent curved surfaces," Comput. Graph., vol. 27, no. 2, pp. 321-334, 1993.
39. K.-A. Sohn, B. Juttler, M.-S. Kim, and W. Wang, "Computing the distance between two surfaces via line geometry," in Proc. 10th Pacific Conf. Comput. Graph. Appl., 2002, pp. 236-245.
40. D. E. Stewart and J. C. Trinkle, "An implicit time-stepping scheme for rigid body dynamics with inelastic collisions and Coulomb friction," Int. J. Numer. Methods Eng., vol. 39, pp. 2673-2691, 1996.
41. G. van den Bergen, "A fast and robust GJK implementation for collision detection of convex objects," J. Graph. Tools, vol. 4, no. 2, pp. 7-25, 1999.
42. G. van den Bergen, Collision Detection in Interactive 3-D Environments. San Mateo, CA: Morgan Kaufmann, 2004.
43. G. van den Bergen. (2004). Ray casting against general convex objects with application to continuous collision detection. [Online]. Available: http://www.detecta.com
44. R. J. Vanderbei and D. Shanno, "An interior-point algorithm for nonconvex nonlinear programming," Comput. Optim. Appl., vol. 13, pp. 231-252, 1999.
45. A. Wachter and L. T. Biegler, "On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming," Math. Program., vol. 106, no. 1, pp. 25-57, 2006.
46. R. A. Waltz and T. D. Plantenga, Knitro 5.0 User's Manual. Evanston, IL: Ziena Optimization, Inc., Jun. 2006.
47. P. G. Xavier, "Fast swept-volume distance for robust collision detection," in Proc. IEEE Int. Conf. Robot. Autom., Albuquerque, NM, Apr. 1997, pp. 1162-1169.
48. S. Zeghloul, P. Rambeaud, and J. Lallemand, "A fast distance calculation between convex objects by optimization approach," in Proc. IEEE Int. Conf. Robot. Autom., Nice, France, May 1992, pp. 2520-2525.