检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:李栋栋 李树军[1] 曾一健 贺志辉 桑涛 LI Dongdong;LI Shujun;ZENG Yijian;HE Zhihui;SANG Tao(School of Mechanical and Electrical Engineering,Northwestern Polytechnical University,Xi’an 710072,China;Shaanxi Aircraft Industry Co.Ltd.,Hanzhong 723000,China)
机构地区:[1]西北工业大学机电学院,西安710072 [2]陕西飞机工业有限责任公司,汉中723000
出 处:《南京航空航天大学学报》2023年第5期905-913,共9页Journal of Nanjing University of Aeronautics & Astronautics
摘 要:发动机叶片长期在高温、高压和高速下工作,工作过程中有异物进入,不可避免地会发生损坏。对于弯扭叶片边缘破损曲面的修复,本文采用基于邻近破损域未破损区域的完整叶片截面线与破损域叶片截面线的完好部分配准,获得边缘破损处的叶片截面线点云特征,实现破损曲面再生重构。同时,采用迭代最近点((Iterative closest point,ICP))配准算法,克服了搜索最近点集耗时较长的缺点。本文提出的基于建立辅助圆邻域的最近点集对搜索方法,大大降低了配准时间成本。最后对破损域再生曲面进行了光顺性分析,验证本文所提出的边缘破损曲面再生修复方法的可行性。Engine blades work at high temperature,high pressure and high speed for a long time.Foreign bodies enter during the working process,and inevitably damage occurs.For the repair of damaged surface at the edge of curved and twisted blades,this paper adopts the allocation criterion based on the intact section line of intact blade in the adjacent undamaged area and the intact part of the blade section line in the damaged area to obtain the point cloud feature of the blade section line at the damaged edge and realize the regeneration and reconstruction of damaged surface.At the same time,the iterative closest point(ICP)registration algorithm is used to overcome the shortcoming of searching the nearest point set for a long time.The closest point pair search method based on auxiliary circular neighborhood is proposed to reduce the registration time cost.Finally,the smoothness of the damaged surface is analyzed to verify the feasibility of the method proposed in this paper.
关 键 词:发动机叶片 叶片截面线配准 最近点集搜索 辅助圆邻域 破损曲面再生
分 类 号:V232.4[航空宇航科学与技术—航空宇航推进理论与工程] TP391.7[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:13.58.192.154