检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]中国科学院大学,北京100049 [2]中国科学院沈阳计算技术研究所高档数控国家工程中心,沈阳110168
出 处:《计算机辅助设计与图形学学报》2014年第9期1543-1549,共7页Journal of Computer-Aided Design & Computer Graphics
基 金:国家"九七三"重点基础研究发展计划项目(2011CB302400)
摘 要:为了避免现有NURBS曲线前瞻插补算法在确定自适应减速起始点时不够准确而产生的减速距离大于实际需要距离的问题,防止插补出现低速运行区域,提出一种基于反向插补的减速点确定方法.在该方法中,前瞻算法从减速区域的终止点开始,采用S型加减速规划进行逆向插补,以确立逆向插补曲线与自适应插补曲线的交区间,将交区间的起始点作为自适应减速区间的起始点,并再次进行前瞻插补,得到理想的减速区域速度规划方案.仿真实验结果表明,文中算法有效地避免了插补过程中的低速运行现象,提高了插补效率.The existing look-ahead algorithm for NURBS curves is not accurate in determining the starting point of adaptive deceleration area, and the deceleration distance produced is longer than the actual need. In order to avoid this problem, and to prevent the interpolation generates low-speed regions, a method based on reverse interpolation area is given to determine the starting point of deceleration area. In this method, the look-ahead algorithm using S-acceleration planning reversely interpolates the curve and establishes the cross-range with velocity curve of adaptive interpolation. Then the curve is re-interpolated from the starting point of the cross-range to obtain the ideal velocity planning scheme of the deceleration zone. Experimental simulation results show that the algorithm proposed in the paper can effectively avoid the phenomenon of low-speed region in the interpolation process, and improve the interpolation efficiency as well.
分 类 号:TP391[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.140.195.190