Collision-free path planning for efficient inspection of free-form surface by using a trigger probe

被引:0
作者
Zhengcai Zhao
Yao Li
Yucan Fu
机构
[1] Nanjing University of Aeronautics and Astronautics,College of Mechanical and Electrical Engineering
[2] Nanjing University of Aeronautics and Astronautics,Jiangsu Key Laboratory of Precision and Micro
来源
The International Journal of Advanced Manufacturing Technology | 2022年 / 120卷
关键词
OMP; Path planning; Collision-free; Traveling-salesman problem;
D O I
暂无
中图分类号
学科分类号
摘要
Measurement path planning plays an essential role in on-machine measurement, which is often required to be time-saving and collision-free. This paper proposes a novel path planning methodology and develops an automatic collision avoidance strategy for measurement. Measurement points are generated by contour section sampling, grid mesh sampling, and locally dense sampling from the free-form surface based on the usage. Afterwards, a shortest-path algorithm and a non-interference path algorithm are developed to solve the sequence planning results. In order to simplify the calculation expense of collision-free paths, the safe-plane-based method (SPM) is introduced. Moreover, the optimized SPM is proposed to minimize the whole measurement path of SPM. The simulations show that the proposed methods can reduce the total measurement distance to nearly 15% than the zigzag method and the safe-plane-based method.
引用
收藏
页码:2183 / 2200
页数:17
相关论文
共 41 条
[1]  
Zhang Y(2018)Sweep scan path planning for five-axis inspection of free-form surfaces Robot Comput Integr Manuf 49 335-348
[2]  
Zhou Z(1995)New inspection planning strategy for sculptured surfaces using coordinate measuring machine Int J Prod Res 33 427-444
[3]  
Tang K(2002)Automatic sampling for CMM inspection planning of free-form surfaces Int J Prod Res 40 2653-2676
[4]  
Cho MW(2019)Optimization of the measurement path for the car body parts inspection Measurement 146 15-23
[5]  
Kim K(2016)Ants colony optimisation of a measuring path of prismatic parts on a CMM Metrol Meas Syst 23 119-132
[6]  
Elkott DF(2019)Path planning optimization for mechatronic systems with the use of genetic algorithm and ant colony IOP Conf Ser Mater Sci Eng 564 12051-89
[7]  
Elmaraghy HA(1982)A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation Eur J Oper Res 9 83-346
[8]  
Elmaraghy WH(2019)A branch-and-bound approach to the traveling salesman problem with a drone INFORMS J Comput 31 335-265
[9]  
Teodor VG(2014)Ones assignment method for solving traveling salesman problem J Math Comput Sci 10 258-144380
[10]  
Stojadinovic SM(2019)Enhanced list-based simulated annealing algorithm for large-scale traveling salesman problem IEEE Access 7 144366-210