具有轴向速度和加速度规定界限的直角数控机床沿曲线路径的时间最优进给速度

S. Timar, R. Farouki, Casey L. Boyadjieff
{"title":"具有轴向速度和加速度规定界限的直角数控机床沿曲线路径的时间最优进给速度","authors":"S. Timar, R. Farouki, Casey L. Boyadjieff","doi":"10.2316/Journal.206.2007.2.206-2896","DOIUrl":null,"url":null,"abstract":"The authors consider the problem of specifying the feedrate variation along a curved path, that yields the minimum traversal time for a multi-axis CNC machine subject to given bounds on the feasible velocity and acceleration along each axis. The torque-speed characteristics of the axis drive motors are first discussed, and are used to determine constraints on the velocity and acceleration for each axis. For a path specified by a polynomial parametric curve r(ξ), it is shown that (the square of) the time-optimal feedrate can be determined as a piecewise-rational function of the curve parameter ξ, with break-points that correspond to the roots of certain polynomials. In general, each feedrate segment is characterized by the saturation of either velocity or acceleration on one machine axis at each instant throughout the motion. The feedrate function admits a real-time interpolator algorithm that can drive the machine from the analytic curve description, eliminating the need for piecewise-linear/circular G code approximations. The theoretical and computational aspects of such time-optimal feedrates are presented, along with experimental results from implementation on a three-axis CNC mill driven by an open-architecture software controller. Compared to prior time-optimal feedrate algorithms (based on acceleration bounds only), the new algorithms give physically valid feedrates at high speeds, where the motor voltage ratings become a limiting factor.","PeriodicalId":206015,"journal":{"name":"Int. J. Robotics Autom.","volume":"171 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Time-Optimal feedrates along Curved Paths for Cartesian CNC Machines with prescribed Bounds on Axis velocities and Accelerations\",\"authors\":\"S. Timar, R. Farouki, Casey L. Boyadjieff\",\"doi\":\"10.2316/Journal.206.2007.2.206-2896\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The authors consider the problem of specifying the feedrate variation along a curved path, that yields the minimum traversal time for a multi-axis CNC machine subject to given bounds on the feasible velocity and acceleration along each axis. The torque-speed characteristics of the axis drive motors are first discussed, and are used to determine constraints on the velocity and acceleration for each axis. For a path specified by a polynomial parametric curve r(ξ), it is shown that (the square of) the time-optimal feedrate can be determined as a piecewise-rational function of the curve parameter ξ, with break-points that correspond to the roots of certain polynomials. In general, each feedrate segment is characterized by the saturation of either velocity or acceleration on one machine axis at each instant throughout the motion. The feedrate function admits a real-time interpolator algorithm that can drive the machine from the analytic curve description, eliminating the need for piecewise-linear/circular G code approximations. The theoretical and computational aspects of such time-optimal feedrates are presented, along with experimental results from implementation on a three-axis CNC mill driven by an open-architecture software controller. Compared to prior time-optimal feedrate algorithms (based on acceleration bounds only), the new algorithms give physically valid feedrates at high speeds, where the motor voltage ratings become a limiting factor.\",\"PeriodicalId\":206015,\"journal\":{\"name\":\"Int. J. Robotics Autom.\",\"volume\":\"171 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Robotics Autom.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2316/Journal.206.2007.2.206-2896\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Robotics Autom.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2316/Journal.206.2007.2.206-2896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在给定的可行速度和加速度边界下,研究了多轴数控机床沿曲线路径的最小进给速度变化问题。首先讨论了轴向驱动电机的转矩-转速特性,并用于确定对每个轴的速度和加速度的约束。对于由多项式参数曲线r(ξ)指定的路径,证明了(的平方)时间最优进料速度可以确定为曲线参数ξ的分段有理函数,断点对应于某些多项式的根。一般来说,每个进给速度段的特征是在整个运动的每个瞬间在一个机器轴上的速度或加速度的饱和。进给函数允许一个实时插值算法,可以从解析曲线描述驱动机器,消除了分段线性/圆G代码近似的需要。提出了这种时间最优进给率的理论和计算方面,以及在开放式架构软件控制器驱动的三轴数控铣床上实现的实验结果。与之前的时间最优馈电算法(仅基于加速度边界)相比,新算法在高速下提供物理有效的馈电,其中电机额定电压成为限制因素。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Time-Optimal feedrates along Curved Paths for Cartesian CNC Machines with prescribed Bounds on Axis velocities and Accelerations
The authors consider the problem of specifying the feedrate variation along a curved path, that yields the minimum traversal time for a multi-axis CNC machine subject to given bounds on the feasible velocity and acceleration along each axis. The torque-speed characteristics of the axis drive motors are first discussed, and are used to determine constraints on the velocity and acceleration for each axis. For a path specified by a polynomial parametric curve r(ξ), it is shown that (the square of) the time-optimal feedrate can be determined as a piecewise-rational function of the curve parameter ξ, with break-points that correspond to the roots of certain polynomials. In general, each feedrate segment is characterized by the saturation of either velocity or acceleration on one machine axis at each instant throughout the motion. The feedrate function admits a real-time interpolator algorithm that can drive the machine from the analytic curve description, eliminating the need for piecewise-linear/circular G code approximations. The theoretical and computational aspects of such time-optimal feedrates are presented, along with experimental results from implementation on a three-axis CNC mill driven by an open-architecture software controller. Compared to prior time-optimal feedrate algorithms (based on acceleration bounds only), the new algorithms give physically valid feedrates at high speeds, where the motor voltage ratings become a limiting factor.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On solving the kinematics and Controlling of Origami Box-shaped robot, 405-415. Si Consensus of Multi-Agent Systems using Back-tracking and History following Algorithms Stabilizing control Algorithm for nonholonomic wheeled Mobile robots using adaptive integral sliding mode A velocity compensation Visual servo method for oculomotor control of bionic eyes On-Line trajectory Generation considering kinematic motion Constraints for robot manipulators
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1