检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘振忠[1] 王太勇[1] 任成祖[1] 刘清建[1]
出 处:《机械设计》2012年第3期89-92,共4页Journal of Machine Design
基 金:国家科技重大专项基金资助项目(2009ZX04014-101-05);国家自然科学基金资助项目(50975193)
摘 要:针对在高速加工、快速检测等高速进给条件下,传统速度控制方法容易导致工件过切、机床抖动等问题,提出了基于离散衔接点曲率加权累加的速度前瞻程序段数动态选择的方法。首先,分析了基于5次样条曲线拟合离散衔接点方法,然后推导了到各衔接点的曲率表达式,最后根据各点曲率加权累加值进行动态速度前瞻程序段控制,并进行了仿真验证。仿真结果表明,动态速度前瞻避免了前瞻路径过短不能完成减速要求和前瞻段数过多占用系统资源,一定程度上解决了速度和精度的冲突问题,提高了系统的性能和加工效率。As the problems of workpiece over-cut and machine chopping easily caused by conventional speed control under high speed feeding conditions as high speed machining and rapid detec- tion, a dynamic selection method of velocity look-ahead block num- ber was proposed based on curvature weighted accumulation of discrete points. First, the fitting of discrete joint point method was an alyzed based on quintic splines. Then, curvature expressions to va- rious discrete joint points were derived. At last, dynamic blocks of look-ahead velocity control were carried out based on curvature weighted accumulation of discrete point, and the simulation verifi- cation was conducted. The simulation resuh shows that the dynamic velocity lookahead can avoid the speed reduction requirement could not complete due to overshort of the look-ahead path and the system resource is occupied due to too much number of lookahead blocks, solving the conflict problem of speed and accuracy at some extent, and improving system performance and processing efficiency.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.173