Near optimal measuring sequence planning and collision-free path planning with a dynamic programming method

Authors
Citation
Zc. Lin et Jj. Chow, Near optimal measuring sequence planning and collision-free path planning with a dynamic programming method, INT J ADV M, 18(1), 2001, pp. 29-43
Citations number
15
Categorie Soggetti
Engineering Management /General
Journal title
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
ISSN journal
02683768 → ACNP
Volume
18
Issue
1
Year of publication
2001
Pages
29 - 43
Database
ISI
SICI code
0268-3768(2001)18:1<29:NOMSPA>2.0.ZU;2-8
Abstract
A near optimal measuring sequence was introduced to complete the entire mea suring process and reduce the measuring time of a coordinate measuring mach ine (CMM) for a work-piece whose shape consists of several geometric elemen ts. The number and positions of the measuring points of the work-piece were planned by a CAD/CAM software system. A weight matrix of the number of pro be spins and the concept of the angle difference matrix were proposed for t he measured feature face using the assumptions in this paper, for the purpo se of dynamic programming. First, a dynamic programming method was carried out to plan the optimal measuring sequence of the feature face of the geome tric elements. Then, a measuring point distance difference matrix was estab lished for an individual feature face. Then, a dynamic programming method w as used to plan the measuring path of the measuring points for solving the approximated shortest path. A collision-free interference inspection method established in this paper was also used to include a collision-free path f or paths with interference. The entire measuring path planning was thus com pleted. With the help of CAD/CAM software and the powerful computation and analytical capability of computers, the system was able to achieve an appro priate measuring sequence in a short time.