A fast growth distance algorithm for incremental motions

IEEE Transactions on Robotics and Automation

Volumn 16, Issue 6, 2000, Pages 880-890

  Ong, Chong Jin ^a,b   Huang, Eugene ^b   Hong, Sun Mog ^a,c  

^a IEEE   (Singapore)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c Kyungpook National University   (South Korea)

Author keywords

Collison detection; Distance computation; Penetration distance

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LINEAR PROGRAMMING; ROBOTICS;

EUCLIDEAN SEPARATION DISTANCES;

MOTION PLANNING;

EID: 0034472492     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.897801     Document Type: Article

References (37)

1. C. B. Barber, D. P. Dobkin, and H. T. Huhdanpaa, "The Quickhull algorithm for convex hulls," ACM Trans on Mathematical Software, Dec. 1996.
2. M. J. Best and K. Ritter, Linear Programming: Active Set Analysis and Computer Programs Englewood Cliffs, NJ: Prentice-Hall, 1985.
3. J. E. Bobrow, "A direct minimization approach for obtaining the distance between convex polyhedra," Int. J. Robot. Res., vol. 8, pp. 65-76, 1989.
4. R. G. Bland, "New finite pivoting pivoting rules for the simplex method," Math. Oper. Res., vol. 2, pp. 103-107, 1977.
5. C. E. Buckley, "A proximity metric for continuum path planning," in Proc. 9th Int. Conf. Artificial Intelligence, 1985, pp. 224-233.
6. B. Chazelle and D. P. Dobkin, "Intersection of convex objects in two and three dimensions," J. ACM, vol. 34, no. 1, 1987.
7. K. C. T. Chung, "An efficient collision detection algorithm for polytopes in virtual environments," M.Phil thesis, Univ. Hong Kong, 1996.
8. D. J. Cohen, M. C. Lin, D. Manocha, and M. Ponamgi, "I-Collide: An interactive and exact collision detection system for large-scale environments," in Proc. Symp. Interactive 3D Graphics, 1995, pp. 189-196.
9. S. Cameron, "Enhancing GJK: Computing minimum and penetration distances between convex polyhedra," in Proc. IEEE Int. Conf. Robotics and Automation, 1997, pp. 3112-3117.
10. _, "A comparison of two fast algorithms for computing the distance between convex polyhedra," IEEE Trans. Robot. Automat., vol. 13, pp. 915-919, Dec. 1997.
11. S. Cameron and R. K. Culley, "Determining the minimum translational distance between two convex polyhedra," in Proc. IEEE Int. Conf. Robotics and Automation, 1986, pp. 591-596.
12. D. P. Dobkin, J. Hershberger, D. G. Kirkpatrick, and S. Suri, "Computing the intersection depth of polyhedra," Algorithmica, vol. 9, pp. 518-533, 1993.
13. D. P. Dobkin and D. G. Kirkpatick, "A linear time algorithm for determining the separation of convex polyhedra," J. Algorithms, vol. 6, pp. 381-392, 1985.
14. B. Faverjon and P. Tournassoud, "A local based approach for path planning of manipulators with a high number of degrees of freedom," in Proc. IEEE Int. Conf. Robotics and Automation, 1987, pp. 1152-1159.
15. E. G. Gilbert and S. M. Hong, "A new algorithm for detecting the collision of moving objects," in Proc. IEEE Int. Conf. Robotics and Automation, 1989, pp. 8-14.
16. E. G. Gilbert and D. W. Johnson, "Distance functions and their applications to robot path planning in the presence of obstacles," IEEE J. Robot. Automat., vol. RA-1, pp. 21-30, 1985.
17. 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 J. Robot. Automat., vol. 4, no. 2, pp. 193-203, 1988.
18. D. E. Johnson and E. Cohen, "A framework for efficient minimum distance computations," in Proc. IEEE Int. Conf. Robotics and Automation, 1998, pp. 3678-3684.
19. M. C. Lin and J. F. Canny, "A fast algorithm for incremental distance calculation," in Proc. IEEE Int. Conf. Robotics and Automation, Sacramento, CA, 1991, pp. 1008-1014.
20. N. Meggido, "Linear programming in linear time when the dimension is fixed," J. ACM, vol. 31, no. 1, Jan. 1984.
21. Mitsubishi Elect. Res Lab., Tech. Rep. TR97-05, 1997.
22. C. J. Ong and E. G. Gilbert, "Growth distances: New measures for object separation and penetration," IEEE Trans. Robot. Automat., vol. 12, Dec. 1996.
23. _, "The Gilbert-Johnson-Keerthi distance algorithm: A fast version for incremental motions," in Proc. IEEE Int. Conf. Robotics and Automation, 1997, pp. 1183-1189.
24. _, "Robot path planning with penetration growth distance," J. Robot. Syst., vol. 15, no. 1, pp. 57-74, 1998.
25. C. J. Ong, "On the quantification of penetration between general objects," Int. J. Robot. Res, vol. 16, no. 3, pp. 400-409, 1997.
26. N. K. Sancheti and S. S. Keerthi, "Computation of certain measures of proximity between convex objects," in Proc. IEEE Conf. Robotics and Automation, 1992, pp. 2508-2513.
27. S. Quinlan, "Efficient distance computation between nonconvex objects," in Proc. IEEE Int. Conf. Robotics and Automation, 1994, pp. 3324-3329.
28. P. G. Xavier, "Fast swept-volume distance for robust collision detection," in Proc. IEEE Int. Conf. Robotics and Automation, 1997, pp. 1162-1169.
29. J. Xiao and L. Liu, "Contact states Representation and recognizability in the presence of uncertainties," in Proc. IEEE/RSJ Int. Conf. Intelligent Robots and Systems, 1998.
30. S. Zeghloul, P. Rambeaud, and J. P. Lallemand, "A fast distance calculation between convex objects by optimization approach," in Proc. IEEE Conf. Robotics and Automation, 1992, pp. 2520-2525.
31. S. M. Hong, J. H. Yeo, and H. W. Park, "A fast procedure for computing incremental growth distances," Robotica, vol. 18, no. 4, pp. 429-441, July 2000.
32. B. B. Goeree, E. D. Fasse, and M. M. Marefat, "An optimization based approach for determining whether a set of elementary contacts is geometrically feasible," in Proc. ASME Dyn. Syst. Contr., vol. DSC-67, 1999, pp. 883-889.
33. B. Mirtich, "Efficient algorithms for two-phase collision detection," in Practical Motion Planning in Robotics, K. Gupta and A. P. del Pobil, Eds. New York: Wiley, 1998.
34. M. K. Ponamgi, D. Manocha, and M. C. Lin, "Incremental algorithms for collision detection between solid models," in Proc. 3rd ACM Symp. Solid Modeling and Applications, pp. 293-304.
35. M. Lin and D. Manocha, "Interference detection between curved objects for computer animation," in Models and Techniques in Computer Animation. New York: Springer-Verlag, 1993, pp. 431-457.
36. S. Gottschalk, M. Lin, and D. Manocha, "Obb-tree: A hierarchical structure for rapid interference detection," in Comput. Graphics, Annu. Conf. Series Proc. of SIGGRAPH, 1996.
37. C. J. Ong and E. Huang, "A fast growth distance algorithm for incremental motions," Dept. Mech. Eng., National Univ. Singapore, http://guppy.mpe.nus.edu.sg/~mpeongcj.