CMM sequence optimisation with collision detection Online publication date: Fri, 16-Jun-2006
by Ralph O. Buchal, An Wang
International Journal of Computer Applications in Technology (IJCAT), Vol. 26, No. 1/2, 2006
Abstract: This paper presents a method for finding optimal collision-free inspection sequences for Coordinate Measuring Machines (CMMs). The sequencing problem is formulated as a standard Travelling Salesperson Problem (TSP). During the network construction, collision detection is performed for each pair of measurement points using a novel image-based collision detection method. Penalties are added to path segments with collisions, and the nearest-neighbour TSP algorithm is applied. For the path segments with collisions, a heuristic algorithm is employed to make a detour around the interference volume. The proposed methods are implemented using the ACIS solid modelling kernel and OpenGL graphics library. The effectiveness of these methods is verified by simulations to demonstrate the collision-free path generation of parts with complex geometry and a comparison of the TSP solutions with and without the collision penalties is presented.
Online publication date: Fri, 16-Jun-2006
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computer Applications in Technology (IJCAT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com