Skip to main content
Log in

Near Optimal Measuring Sequence Planning and Collision-Free Path Planning with a Dynamic Programming Method

  • Published:
The International Journal of Advanced Manufacturing Technology Aims and scope Submit manuscript

A near optimal measuring sequence was introduced to complete the entire measuring process and reduce the measuring time of a coordinate measuring machine (CMM) for a workpiece whose shape consists of several geometric elements. The number and positions of the measuring points of the workpiece were planned by a CAD/CAM software system. A weight matrix of the number of probe spins and the concept of the angle difference matrix were proposed for the measured feature face using the assumptions in this paper, for the purpose of dynamic programming. First, a dynamic programming method was carried out to plan the optimal measuring sequence of the feature face of the geometric elements. Then, a measuring point distance difference matrix was established for an individual feature face. Then, a dynamic programming method was 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 for paths with interference. The entire measuring path planning was thus completed. With the help of CAD/CAM software and the powerful computation and analytical capability of computers, the system was able to achieve an appropriate measuring sequence in a short time.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lin, ZC., Chow, JJ. Near Optimal Measuring Sequence Planning and Collision-Free Path Planning with a Dynamic Programming Method. Int J Adv Manuf Technol 18, 29–43 (2001). https://doi.org/10.1007/s001700170091

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001700170091

Navigation