Pseudo minimum translational distance between convex polyhedra(I) - Definition and properties

Science in China, Series E: Technological Sciences

Volumn 44, Issue 2, 2001, Pages 216-224

  Zhu, Xiangyang ^a   Ding, Han ^b   Xiong, Youlun ^b  

^a SOUTHEAST UNIVERSITY   (China)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

Convex polyhedra; Differentiability; Pseudo minimum translational distance

Indexed keywords

EID: 0035309046     PISSN: 10069321     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (19)

1. Bobrow, J. E. , A direct minimization approach for obtaining the distance between convex polyhedra, Int. J. Robotics Research, 1989, 8(3): 65-76.
2. Gilbert, E. G. , Foo, C. P., Computing the distance between general convex objects in three-dimensional space, IEEE Trans. Robotics Automation, 1990, RA-6: 53-61.
3. Gilbert, E. G. , Johnson, D. W. , Distance functions and their application to robot path planning in the presence of obstacles, IEEE J. Robotics Automation, 1985, RA-1(1): 21-30.
4. Gilbert, E. G., Johnson, D. W., Keerthi, S. S. , A fast procedure for computing the distance between complex objects in three-dimensional space, IEEE J. Robotics Automation, 1988, RA-4: 193-203.
5. Cameron, S. A. , A comparison of two fast algorithms for computing the distance between convex polyhedra, IEEE Trans. Robotics Automation, 1997, RA-13: 915-920.
6. Lin, M. C. , Canny, J. F. , A fast algorithm for incremental distance calculation, in Proc. IEEE int. Conf. Robotics Automation, Sacramento, CA, 1991, 266-275.
7. Sato, Y. , Hirata, M. , Maruyama, T. et al. Efficient collision detection using fast distance calculation algorithms for convex and nonconvex objects, in Proc. IEEE Int. Conf. Robotics Automation, Minneapolis, MN, 1996, 771-778.
8. Buckley, C. E. , A foundation for the flexible-trajectory approach to numeric path planning, Int. J. Robotics Research, 1989, 8(3): 44-64.
9. Cameron, S. A. , Enhancing GJK: computing minimum and penetration distance between convex polyhedra, in Proc. IEEE Int. Conf. Robotics Automation, Albuquerque, NM, 1997, 3112-3117.
10. Cameron, S. A., Culley, R. K. , Determining the minimum translational distance between two convex polyhedra, in Proc. IEEE Int. Conf. Robotics Automation, San Francisco CA, 1986, 591-596.
11. Sridharan, K. , Stephanou, H. E. , Craig, K. C. et al. , Distance measures on intersecting objects and their applications, Information Processing Letters, 1994, 51: 181-188.
12. Keerthi, S. S. , Sridharan, K. , Measures of intensity of collision between convex objects and their efficient computation, in Proc. Int. Conf. Intelligent Robotics, Bangalore, 1991, 266-275.
13. Ong, C. J. , Gilbert, E. G., Growth distance: new measures for object separation and penetration, IEEE Trans. Robotics Automation, 1996, RA-12: 888-903.
14. Zhu, X. Y. , Zhu, L. M. , Zhong, B. L. , Robot collision-free path planning utilizing gauge function, Science in China, Ser. E, 1997, 40(5): 546-552.
15. Latombe, J. C., Robot Motion Planning, Dordrecht: Kluwer Academic Publishers, 1991.
16. Hoang, T. , Convex Analysis and Global Optimization, Dordrecht: Kluwer Academic Publishers, 1998.
17. Clarke, F. H. , Optimization and Nonsmooth Analysis, New York: John Wiley & Sons, 1983.
18. Megiddo, N. , Linear programming in linear time when the dimension is fixed, J. ACM, 1984, 31: 114-127.
19. Rothenberg, R. I. , Linear Programming, Amsterdam: Elsevier North Holland, 1979.