Fast procedure for computing incremental growth distances

Robotica

Volumn 18, Issue 4, 2000, Pages 429-441

  Hong, Sun Mog ^a   Yeo, Joon Hyuek ^b   Park, Hae Wook ^c  

^a Kyungpook National University   (South Korea)

^b Hyundai Heavy Industries   (South Korea)

^c Brain Co Ltd   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COLLISION AVOIDANCE; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; COMPUTER SIMULATION; DISTANCE MEASUREMENT; EQUATIONS OF MOTION; MOTION PLANNING; THREE DIMENSIONAL;

GEOMETRIC ADJACENCY INFORMATION; GROWTH DISTANCE; INCREMENTAL DISTANCE; INTERFERENCE DETECTION;

ROBOTICS;

EID: 0034225439     PISSN: 02635747     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0263574799001939     Document Type: Article

References (13)

1. E.G. Gilbert and C.J. Ong, "New distances for the separation and penetration of objects" Proc. IEEE Int. Conf. on Robotics and Automation, San Diego, CA (May, 1994) pp. 579-586.
2. C.J. Ong and E.G. Gilbert, "Growth distances: new measures for object separation and penetration" IEEE Trans. on Robotics and Automation RA-12, No. 6, 888-903 (1996).
3. C.E. Buckley, "A proximity metric for continuum path planning" Proc. 9th Int. Conf. on Artificial Intelligence (1985) pp. 1096-1102.
4. C.E. Buckley, "A foundation for the 'flexible - trajectory' approach to numeric path planning" Int. J. Robotics Res. 8, No. 3, 44-64 (1989).
5. C.J. Ong and E.G. Gilbert, "Robot path planning with penetration growth distance" IEEE Int. Conf. on Robotics and Automation, San Diego, CA (May, 1994) pp. 2146-2152.
6. C.J. Ong and E. Huang, "An incremental version of growth distance" Proc. IEEE Int. Conf. on Robotics and Automation. Leuven, Belgium (May, 1998) pp. 3671-3677.
7. M.C. Lin and J.F. Canny, "A fast algorithm for incremental distance calculation" Proc. IEEE Int. Conf. on Robotics and Automation, Sacramento, CA (May, 1991) pp. 1008-1014.
8. S. Cameron, "Enhancing GJK: computing minimum and penetration distances between convex polyhedra" Proc. IEEE Int. Conf. on Robotics and Automation, Albuquerque, NM (May, 1997) pp.3112-3117.
9. S. Cameron, "A comparison of two fast algorithms for computing the distances between convex polyhedra" IEEE Trans. on Robotics and Automation RA-13, No 6, 915-920 (1997).
10. C.J. Ong and E.G. Gilbert, "The Gilbert-Johnson-Keerthi distance algorithm: a fast version for incremental motions" Proc. IEEE Int. Conf. on Robotics and Automation, Albuquerque, NM (May, 1997) pp.1183-1189.
11. R.T. Rockafellar, Convex Analysis (Princeton Univ. Press, Princeton, NJ, 1970).
12. M.J. Best and K. Ritter, Linear Programming: Active set Analysis and Computer Programs (Pretence-Hall, Englewood Cliffs, NJ, 1985).
13. K.S. Fu, R.C. Gonzalez and C.S.G. Lee, Robotics: Control, Sensing, Vision and Intelligence (McGraw-Hill, New York, 1987).