Abstract
In this paper we develop two adaptive algorithms for programming co-ordinate measuring machines assuming fixed sampling budget. Two different costs are considered: the travelling cost of the machine probe, and the sampling cost to read and store all measurements. Simulation is used to compare the average performance of the proposed algorithms under the assumption of Wiener measure on the space of all surface contours of the manufactured parts. Expected value of the probability of Type II error is the criterion that we use to characterize algorithms performance. Analysis shows that placing sample points according to the criterion of maximizing the expected gain demonstrates a substantial improvement in the average performance. Copyright © 1999 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
