Localization algorithms: performance evaluation and reliability analysis

Workpiece localization plays a vital role in automation of many important manufacturing processes, such as workpiece setup, refixturing and dimensional inspection. In this paper, we provide a unified treatment of three geometric algorithms for workpiece localization, and develop new techniques to make these local algorithms globally convergent. We also study and analyze, along with extensive simulation results, their performance with respect to convergence and computational efficiency. Finally, we present a method for analyzing reliability of localization solutions and give a lower bound on the number of measurement points needed for reliable recovering of Euclidean transformations.

[1]  Xiaomin Li,et al.  An algebraic algorithm for workpiece localization , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[2]  R. Brockett Least squares matching problems , 1989 .

[3]  Zexiang Li,et al.  Performance analysis of localization algorithms , 1997, Proceedings of International Conference on Robotics and Automation.

[4]  Hong-Tzong Yau,et al.  Automated precision measurement of surface profile in CAD-directed inspection , 1992, IEEE Trans. Robotics Autom..

[5]  R. A. Fox,et al.  Introduction to Mathematical Statistics , 1947 .