离轴非球面形状不对称且其表面曲率变化非线性,给面形高精度测量带来挑战。为解决现有离轴非球面面形测量方法高度依赖待测件初始调整位姿和曲率变化难适应的问题,本文提出了一种基于空间约束的差动共焦离轴非球面自适应测量方法,以实...离轴非球面形状不对称且其表面曲率变化非线性,给面形高精度测量带来挑战。为解决现有离轴非球面面形测量方法高度依赖待测件初始调整位姿和曲率变化难适应的问题,本文提出了一种基于空间约束的差动共焦离轴非球面自适应测量方法,以实现对离轴非球面的无初始位姿依赖、曲率变化自适应、高精度测量。首先,根据平移-回转扫描测量原理和差动共焦技术抗表面倾角精准定焦的性能,从规划测量点和待测点之间的距离和倾角两个维度出发,构建了空间约束模型,基于该模型,对等面积准则下的螺旋扫描路径规划算法进行优化,实现对离轴非球面测量路径的曲率自适应动态调整。使用该方法对离轴非球面和20°倾斜平面进行测量实验,将测量结果与Zygo干涉仪的测量结果点对点作差,面形差别的均方根(Root Mean Square,RMS)值均优于10 nm,对应3σ优于5 nm,满足离轴非球面的高精度测量要求。展开更多
An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although ...An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.展开更多
文摘离轴非球面形状不对称且其表面曲率变化非线性,给面形高精度测量带来挑战。为解决现有离轴非球面面形测量方法高度依赖待测件初始调整位姿和曲率变化难适应的问题,本文提出了一种基于空间约束的差动共焦离轴非球面自适应测量方法,以实现对离轴非球面的无初始位姿依赖、曲率变化自适应、高精度测量。首先,根据平移-回转扫描测量原理和差动共焦技术抗表面倾角精准定焦的性能,从规划测量点和待测点之间的距离和倾角两个维度出发,构建了空间约束模型,基于该模型,对等面积准则下的螺旋扫描路径规划算法进行优化,实现对离轴非球面测量路径的曲率自适应动态调整。使用该方法对离轴非球面和20°倾斜平面进行测量实验,将测量结果与Zygo干涉仪的测量结果点对点作差,面形差别的均方根(Root Mean Square,RMS)值均优于10 nm,对应3σ优于5 nm,满足离轴非球面的高精度测量要求。
文摘An efficient QoS routing algorithm was proposed for multiple constrained path selection. Making use of efficient pruning policy, the algorithm reduces greatly the size of search space and the computing time. Although the proposed algorithm has exponential time complexity in the worst case, it can get the running results quickly in practical application. When the scale of network increases, the algorithm can efficiently control the size of search space by constraint conditions and prior queue. The results of simulation show that successful request ratio ( r ) of efficient algorithm for multi-constrained optimal path (EAMCOP) is better than that of heuristic algorithm for multi-constrained optimal path (H-MCOP), but average computing time ( t ) of EAMCOP is far less than that of H-MCOP. And it can be seen that the computing time of EAMCOP is only one fourth of that of H-MCOP in Advanced Research Projects Agency Network (ARPANet) topology.
