Growth distances: New measures for object separation and penetration

IEEE Transactions on Robotics and Automation

Volumn 12, Issue 6, 1996, Pages 888-903

  Ong, Chong Jin ^b   Gilbert, Elmer G ^a,c  

^a IEEE

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^c UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION AVOIDANCE; DISTANCE MEASUREMENT; EQUATIONS OF MOTION; LINEAR PROGRAMMING; POSITION CONTROL;

GROWTH DISTANCES; PENETRATION DISTANCES; SEPARATION DISTANCES; TRANSLATIONAL DISTANCES;

MOTION PLANNING;

EID: 0030413923     PISSN: 1042296X     EISSN: None     Source Type: Journal    
DOI: 10.1109/70.544772     Document Type: Article

References (35)

1. M. J. Best and K. Ritter, Linear Programming: Active Set Analysis and Computer Programs. Englewood Cliffs, NJ: Prentice-Hall, 1985.
2. 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, 1989.
3. R. A. Brooks and T. Lozano-Perez, "A subdivision algorithm in configuration space for findpath with rotation," IEEE Trans. Syst., Man, Cybern., vol. SMC-15, pp. 224-233, 1985.
4. C. E. Buckley, "A proximity metric for continuum path planning," in Proc. 9th Int. Conf. Artifcial Intelligence, 1985, pp. 1096-1102.
5. _, "A foundation for the 'flexible-trajectory' approach to numeric path planning," Int. J. Robot. Res., vol. 8, no. 3, pp. 44-64, 1989.
6. S. A. Cameron and R. K. Culley, "Determining the minimum translational distance between two convex polyhedra," in Proc. IEEE Int. Conf. Robotics Automation, San Francisco, CA, 1986, pp. 591-596.
7. F. H. Clarke, Optimization and Nonsmooth Analysis. New York: Wiley, 1983.
8. D. P. Dobkin, J. Hershberger, D. G. Kirkpatrick, and S. Suri, "Computing the intersection depth of polyhedra," Algorithmica, vol. 9, pp. 518-533, 1993.
9. 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.
10. [101 _, "Determining the separation of preprocessed polyhedra - A unified approach," in Proc. 17th ICALP, Lecture Notes Computer Sci., no. 443. Berlin: Springer-Verlag, 1990, pp. 400-412.
11. J. J. Dongarra, "Performance of various computers using standard linear equations software," Comput. Sci. Dept., Univ. Tenn., Knoxville, TN, Rep. CS-89-85, 1995.
12. R. Fletcher, Practical Methods of Optimization, 2nd ed. New York: Wiley, 1987.
13. E. G. Gilbert and D. W. Johnson, "Distance functions and their application to robot path planning in the presence of obstacles," IEEE J. Robot. Automat., vol. RA-1, pp. 21-30, 1985.
14. 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, pp. 193-203, 1988.
15. E. G. Gilbert and C. P. Foo, "Computing the distance between general convex objects in three-dimensional space." IEEE Trans. Robot. Automat., vol. 6, pp. 53-61, 1990.
16. E. G. Gilbert and C. J. Ong, "New distances for the separation and penetration of objects," in Proc. IEEE Conf. Robotics Automation, San Diego, CA, 1994, pp. 579-586.
17. S. S. Keerthi and K. Sridharan, "Measures of intensity of collision between convex objects and their efficient computation," in Proc. Int. Conf. Intelligent Robotics, Bangalore, India, 1991, pp. 266-275.
18. J. Latombe, Robot Motion Planning. Boston, MA: Kluwer, 1991.
19. S. R. Lay, Convex Sets and Their Applications. New York: Wiley. 1982.
20. D. Leven and M. Sharir, "Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams," Discrete Computational Geometry, vol. 2, pp. 9-31, 1987.
21. M. C. Lin and J. F. Canny, "A fast algorithm for incremental distance calculation," in Proc. IEEE Int. Conf. Robotics Automation, Sacramento, CA, 1991, pp. 1008-1014.
22. M. C. Lin, D. Manocha, and J. F. Canny, "Fast contact determination in dynamic environments," in Proc. IEEE Conf. Robotics Automation, San Diego, CA, 1994, pp. 602-608.
23. C. Y. Liu and R. Mayne, "Distance calculations in motion planning problems," in Proc. ASME 16th Design Auto. Conf., Chicago, TL, 1990, pp. 145-152.
24. N. Megiddo, "Linear programming in linear time when the dimension is fixed," J. ACM, vol. 31, pp. 114-127, 1984.
25. B. S. Mordukovich, Approximation Methods in Problems of Optimization and Control. Moscow: Nauka, 1988 (Engl. transl. in press, New York: Wiley-Interscience).
26. M. Nahon, "Determination of interference distance between two objects using optimization techniques," in Proc. ASME Design Auto. Conf., Minneapolis, MN, 1994, pp. 1-6.
27. C. J. Ong, "Penetration distances and their applications to robot path planning," Ph.D. dissertation, Dept. Mechanical Eng. Appl. Mechanics, Univ. Michigan, Ann Arbor, MI, 1993.
28. _, "Properties of penetration between general objects," in Proc. IEEE Conf. Robotics Automation, Nagoya, Japan, 1995, pp. 2293-2298.
29. C. J. Ong and E. G. Gilbert, "Robot path planning with penetration growth distance," in Proc. IEEE Conf. Robotics Automation, San Diego, CA, 1994, pp. 2146-2152.
30. R. T. Rockafellar, Convex Analysis. Princeton, NJ: Princeton Univ. Press, 1970.
31. N. K. Sancheti and S. S. Keerthi, "Computation of certain measures of proximity between convex objects," in Proc. IEEE Conf. Robotics Automation, Nice, France, 1992, pp. 2508-2513.
32. I. Sharf and M. Nahon, "Interference distance calculation for two objects bounded by quadratic surfaces," in Proc. ASME Design Auto. Conf., 1995, pp. 634-641.
33. K. Sridharan, H. E. Stephanou, K. C. Craig, and S. S. Keerthi, "Distance measures on intersecting objects and their applications," Inform. Proc. Lett., vol. 51, pp. 181-188, 1994.
34. S. Zeghloul, P. Rambeaud, and J. P. Lallemand, "A fast distance calculation between convex objects by optimization approach," in Proc. IEEE Conf. Robotics Automation, Nice, France, 1992, pp. 2520-2525.
35. K. Zikan and D. Curtis, "Intersections and separation of polytopes," Boeing Comput. Services, Rep. BCSTECH-93-031, Oct. 1993.