Computation of penetration between smooth convex objects in three-dimensional space

Journal of Robotic Systems

Volumn 13, Issue 5, 1996, Pages 303-315

  Ong, Chong Jin ^a  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CALCULATIONS; DYNAMICS; MATHEMATICAL MODELS; ROBOT APPLICATIONS;

GROWTH DISTANCE; PENETRATION; SMOOTH CONVEX OBJECTS; THREE DIMENSIONAL SPACE;

ROBOTICS;

EID: 0030151051     PISSN: 07412223     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-4563(199605)13:5<303::AID-ROB4>3.0.CO;2-U     Document Type: Article

References (18)

1. D. P. Dobkin and D. G. Kirkpatrick. "A linear time algorithm for determinating the separation of convex polyhedra." J. Algorithm, 6, 381-392, 1985.
2. H. Edelsbrunner, "Computing the extreme distances between two convex polygons," J. Algorithm, 6, 213-224, 1985.
3. E. G. Gilbert and D. W. Johnson, "Distance functions and their application to robot path planning in the presence of obstacles," IEEE. Trans. Rob. Autom., RA-1, 21-30, 1985.
4. 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. Rob. Autom., RA-4, 193-203, 1988.
5. E. G. Gilbert and C. P. Foo, "Computing the distance between general convex objects in 3-dimensional space." IEEE Trans. Rob. Autom., RA-6, 53-61, 1990.
6. C. E. Buckley, "A foundation for the flexible trajectory approach to numeric path planning," Int. J. Rob. Res., 8(3), 44-64, 1989.
7. S. A. Cameron and R. K. Culley, "Determining the minimum translation distance between two convex polyhedra," Proc. IEEE Int. Conf. Rob. Autom., 1986, pp. 591-596.
8. S. S. Keerthi and K. Sridharan, "Measures of intensity of collision between convex objects and their efficient computation," Proc. Int. Conf. Intel. Rob., Bangalore, India, 1991, pp. 266-272.
9. N. K. Sancheti and S. S. Keerthi, "Computation of certain measures of proximity between convex polytopes: A complexity viewpoint," Proc. IEEE Int. Conf. Rob. Autom., Nice, France, 1992, pp. 2508-2513.
10. E. G. Gilbert and C. J. Ong, "New distances for the separation and penetration of objects," Proc. IEEE Conf. Rob. Autom., San Diego, 1994, pp. 579-586.
11. C. J. Ong and E. G. Gilbert, "Robot path planning with penetration growth distance," Proc. IEEE Int. Conf. Rob. Autom., San Diego, 1994, pp. 2146-2152.
12. E. Rimon and S. P. Boyd, "Efficient distance computation using best ellipsoid fit," Proc. IEEE Int. Symp. Intel. Control, Glasgow, 1992, pp. 360-365.
13. S. R. Lay, Convex Sets and their Applications, John Wiley, New York 1982.
14. N. Megiddo, "Linear programming in linear time when the dimension is fixed," Journal of Association for Computing Machinery, 31(1), 1984.
15. R. Fletcher, Practical Methods of Optimization, John Wiley, New York 1987.
16. R. L. Crane, K. E. Hillstrom, and M. Minkoff, "Solution of the general nonlinear programming problem with subroutine VMCON," Argonne National Laboratory, IL, July 1980.
17. W. Murray, "Algorithms for large nonlinear problems," in Mathematical Programming, State of the Art 1994, Proc. Int. Symp. Math. Program., 1994, pp. 172-185.
18. D. G. Luenberger, Linear and Nonlinear Programming, Addison Wesley, Reading, MA, 1984.