A 3D measuring path planning strategy for intelligent CMMs based on an improved ant colony algorithm

Coordinate measuring machines (CMMs) are being subjected to an increasing number of intelligent requirements due to mass manufacturing in the industry. It is important to plan the 3D measuring path for a CMM to meet the requirements of multi-objective measurements. A stable and fast three-dimensiona...

Full description

Saved in:
Bibliographic Details
Published in:International journal of advanced manufacturing technology 2017-10, Vol.93 (1-4), p.1487-1497
Main Authors: Han, Zhenhua, Liu, Shugui, Yu, Fei, Zhang, Xiaodong, Zhang, Guoxiong
Format: Article
Language:English
Subjects:
Algorithms
Ant colony optimization
CAE) and Design
Computer simulation
Computer-Aided Engineering (CAD
Coordinate measuring machines
Dimensional stability
Engineering
Industrial and Production Engineering
Mechanical Engineering
Media Management
Original Article
Path planning
Product design
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Coordinate measuring machines (CMMs) are being subjected to an increasing number of intelligent requirements due to mass manufacturing in the industry. It is important to plan the 3D measuring path for a CMM to meet the requirements of multi-objective measurements. A stable and fast three-dimensional (3D) path planning algorithm is desirable to improve the detection efficiency of a CMM. This paper establishes a 3D ant colony map for the measurement space. Then, an improved ant colony algorithm that can converge to the optimal path more rapidly than the standard ant colony algorithm is proposed. Finally, a new path re-optimization algorithm (RE-OP) and the new space collision detection algorithm are proposed. The simulation experiments show that the improved ant colony algorithm can steadily and rapidly obtain the optimal security path and can improve the detection efficiency of CMMs.
ISSN:0268-3768
1433-3015
DOI:10.1007/s00170-017-0503-y