Solving minimum distance problems with convex or concave bodies using combinatorial global optimization algorithms

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Volumn 35, Issue 6, 2005, Pages 1144-1155

  Carretero, Juan A ^a   Nahon, Meyer A ^b  

^a UNIVERSITY OF NEW BRUNSWICK   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

Combinatorial optimization; Distance determination; Genetic algorithms applications; Path planning; Simulated annealing applications

Indexed keywords

COMBINATORIAL MATHEMATICS; COMPUTATIONAL GEOMETRY; CONVERGENCE OF NUMERICAL METHODS; GENETIC ALGORITHMS; MOTION PLANNING; SIMULATED ANNEALING;

COMBINATORIAL OPTIMIZATION; CONCAVE MINIMUM DISTANCE PROBLEM; DISTANCE DETERMINATION;

GLOBAL OPTIMIZATION;

ALGORITHM; ARTICLE; ARTIFICIAL INTELLIGENCE; AUTOMATED PATTERN RECOGNITION; COMPUTER ASSISTED DIAGNOSIS; COMPUTER SIMULATION; IMAGE ENHANCEMENT; INFORMATION RETRIEVAL; MATHEMATICAL COMPUTING; METHODOLOGY; ROBOTICS; STATISTICAL MODEL; THREE DIMENSIONAL IMAGING;

ALGORITHMS; ARTIFICIAL INTELLIGENCE; COMPUTER SIMULATION; IMAGE ENHANCEMENT; IMAGE INTERPRETATION, COMPUTER-ASSISTED; IMAGING, THREE-DIMENSIONAL; INFORMATION STORAGE AND RETRIEVAL; MODELS, STATISTICAL; NUMERICAL ANALYSIS, COMPUTER-ASSISTED; PATTERN RECOGNITION, AUTOMATED; ROBOTICS;

EID: 29144477585     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2005.850172     Document Type: Article

References (42)

1. C. Y. Liu and R. W. Mayne, "Distance calculations in motion planning problems with interference situations," in Proc. ASME DETC- 16th Design Autom.Conf., Chicago, IL, Sep. 1990, pp. 145-152.
2. M. Nahon, O. Ma, J.-C. Piedbœuf, and J. DeCarufel, "A distance determination algorithm for real-time simulation of contact dynamics," in Proc. 7th CASI Conf. Astronautics, vol. 1, Ottawa, ON, Canada, Nov. 1998, pp. 1-7.
3. M. Lin and D. Manocha, "Collision and proximity queries," in Handbook of Discrete and Computational Geometry, Second ed, J. E. Goodman and J. O'Rourke, Eds. Boca Raton, FL: CRC, 2003, ch. 35, pp. 787-808.
4. P. Jiménez, F. Thomas, and C. Torras, "3D collision detection: A survey," Comput. Graphics, vol. 25, no. 2, pp. 269-285, Apr. 2001.
5. K. A. Maruyama, "A procedure to determine intersection between polyhedral objects," Int. J. Comput. Inf. Sci., vol. 1, no. 3, pp. 255-266, 1972.
6. J. W. Boyse, "Interference detection among solids and surfaces," Commun. ACM, vol. 22, no. 1, pp. 3-9, 1979.
7. W. Meyer, "Distance between boxes: Applications to collision detection and clipping," in Proc. IEEE Conf. Robotics Automation, San Francisco, CA, Apr. 1986, pp. 597-602.
8. M. C. Lin and J. F. Canny, "A fast algorithm for incremental distance determination," in Proc. IEEE Conf. Robotics Autom., Sacramento, CA, Apr. 1991, pp. 1008-1014.
9. 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. Robotics Autom., vol. 4, no. 2, pp. 193-203, Apr. 1988.
10. S. Gottschalk, M. Lin, and D. Manocha, "OBB-tree: A hierarchical structure for rapid interference detection," in Proc. Computer Graphics, Annu. Conf. Series, vol. 30, 1996, pp. 171-180.
11. J. E. Bobrow, "A direct minimization approach for obtaining the distance between convex polyhedra," Int. J. Robotics Res., vol. 8, no. 3, pp. 65-76, Jun. 1989.
12. O. Ma and M. Nahon, "A general method for computing the distance between two moving objects using optimization techniques," in Proc. ASME Conf. Adv. Design Autom., vol. 1, Phoenix, AZ, 1992, pp. 109-117.
13. B. Llanas, M. F. de Sevilla, and V. Feliü, "Minimum distance between the faces of two convex polyhedra: A sufficient condition," J.Global Optim., vol. 26, no. 4, pp. 361-385, 2003.
14. M. K. Ponamgi, D. Manocha, and M. C. Lin, "Incremental algorithms for collision detection between polygonal models," IEEE Trans. Visual. Comput. Graphics, vol. 3, no. 1, pp. 51-64, Jan.-Mar. 1997.
15. S. A. Ehmann and M. C. Lin, "Accurate and fast proximity queries between polyhedra using surface decomposition," in Proc. Eurographics (Computer Graphics Forum), vol. 20, Manchester, U.K., Sep. 4-7, 2001, p. 11.
16. A. Guéziec, "'Meshsweeper': Dynamic point-to-polygonal mesh distance and applications," IEEE Trans. Visual. Comput. Graphics, vol. 7, no. 1, pp. 47-61, Jan.-Mar. 2001.
17. S. Redon, Y. J. Kim, M. C. Lin, and D. Manocha, "Fast continuous collision detection for articulated models," in Proc. ACM Symp. Solid Modeling Applications, Genova, Italy, Jun. 2004.
18. I. Lotan, F. Schwarzer, D. Halperin, and J.-C. Latombe, "Efficient maintenance and self-collision testing for kinematic chains," in Proc. Symp. Comput. Geometry, Barcelona, Spain, Jun. 5-7, 2002.
19. K. A. Abdel-Malek and P. Burton, "Interference detection of nonconvex solids for manipulators," in Proc. ASME Conf. Advances in Design Automation, Flexible Assembly Syst., vol. DE-73 Minneapolis, MN, 1994, pp. 85-95.
20. P. Jiménez and C. Torras, "Benefits of applicability constraints in decomposition-free interference detection between nonconvex polyhedral models," in Proc. IEEE Int. Conf. Robotics Autom., Detroit, MI, May 1999, pp. 1856-1862.
21. J. A. Carretero and M. A. Nahon, "A genetic algorithm for calculating minimum distance between convex and concave bodies," in Proc. 6th Int. Symp. Artificial Intell., Robotics Autom. in Space: A New Space Odyssey, Saint-Hubert (Montréal), QC, Canada, Jun. 18-22, 2001.
22. B. Joe, "Triangular meshes for regions of complicated shape," Int. J. Numerical Methods Eng., vol.23, pp.751-778, 1986.
23. (2003) CIMNE, GiD - The Personal Pre and Postprocessor. International Center for Numerical Methods in Engineering, Barcelona, Spain. [Online]. Available: http://gid.cimne.upc.es/
24. A. S. Tanenbaum, Computer Networks, Third ed. Upper Saddle River, NJ: Prentice-Hall PTR, 1996.
25. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, vol. 1, pp. 269-271, 1959.
26. J. A. Carretero, M. A. Nahon, and O. Ma, "Solving the minimum distance problem between convex or concave bodies using simulated annealing," in Proc. IEEE Int. Conf. Intell. Robots Syst., Maui, HI, Oct. 2001.
27. D. E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
28. E. Aarts and J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing. Chichester, UK: Wiley, 1989, Wiley-Interscience Series in Discrete Mathematics and Optimization.
29. J. A. Carretero, R. P. Podhorodeski, M. A. Nahon, and C. M. Gosselin, "Kinematic analysis and optimization of a new three degree-of-freedom spatial parallel manipulator," J. Mech. Des., vol. 122, no. 1, pp. 17-24, Mar. 2000.
30. L. Davis and M. Steenstrup, "Genetic algorithms and simulated annealing: An overview," in Genetic Algorithms and Simulated Annealing, L. Davis, Ed. London, UK: Pitman, 1987, Research Notes in Artificial Intelligence, pp. 1-11.
31. S. Kirkpatrick, C. D. Gelatt, Jr., and M. P. Vecchi, "Optimization by simulated annealing," Science, vol. 4598, no. 220, pp. 671-680, May 1983.
32. R. A. Rutenbar, "Simulated annealing algorithms: An overview," IEEE Circuits Devices Mag., vol. 5, no. 1, pp. 19-26, Jan. 1989.
33. R. O. Buchal, D. B. Cherchas, F. Sassani, and J. P. Duncan, "Simulated off-line programming of welding robots," Int. J. Robotics Res., vol. 8, no. 3, pp. 31-43, 1989.
34. H. Martinez-Alfaro, H. Valdez, and J. Ortega, "Linkage synthesis of a four bar mechanism for n precision points using simulated annealing," in Proc. ASME DETCConf., Atlanta, GA, Sep. 1998, p. 7.
35. J. H. Holland, Adaptation in Natural and Artryicial Systems. Ann Arbor, MI: The Univ. Michigan Press, 1975.
36. J. J. Grefenstette, Genetic Algorithms and Their Applications (ICGA'87). Mahwah, NJ: Lawrence Erlbaum, 1987.
37. D. Beasley, D. R. Bull, and R. R. Martin, "An overview of genetic algorithms: Part 1, fundamentals," Univ. Comput., vol. 15, no. 2, pp. 58-69, 1993.
38. D. Beasley, D. R. Bull, and R. R. Martin, "An overview of genetic algorithms: Part 2, research topics," Univ. Comput., vol. 15, no. 4, pp. 170-181, 1993.
39. J. E. Baker, "Adaptive selection methods for genetic algorithms," in Proce. Second Int. Conf. Genetic Algorithms, J. J. Grefenstette, Ed., Cambridge, MA, Jul. 28-31, 1987, pp. 100-111.
40. M. Nahon, "Determination of the minimum distance between moving objects including velocity information," in Proc. ASME Conf. Adv. Design Automat., vol. 1, 1993, pp. 693-698.
41. D. Whitley, V. S. Gordon, and K. Mathias, "Lamarckian evolution, the Baldwin effect and function optimization," in Proc. Parallel Problem Solving From Nature, PPSN III: Int. Conf. Evol. Comput., Jerusalem, Israel, Oct. 9-14, 1994, pp. 6-15.
42. J. A. Carretero, "Distance Determination Algorithms for Convex and Concave Objects," Ph.D. dissertation, Univ. Victoria, Dept. Mechanical Eng., Victoria, BC, Canada, 2002.