Autonomous mobile robot navigation is one of the most emerging areas of research by using swarm intelligence. Path planning and obstacle avoidance are most researched current topics like navigational challenges for mo...Autonomous mobile robot navigation is one of the most emerging areas of research by using swarm intelligence. Path planning and obstacle avoidance are most researched current topics like navigational challenges for mobile robot. The paper presents application and implementation of Firefly Algorithm(FA)for Mobile Robot Navigation(MRN) in uncertain environment. The uncertainty is defined over the changing environmental condition from static to dynamic. The attraction of one firefly towards the other firefly due to variation of their brightness is the key concept of the proposed study. The proposed controller efficiently explores the environment and improves the global search in less number of iterations and hence it can be easily implemented for real time obstacle avoidance especially for dynamic environment. It solves the challenges of navigation, minimizes the computational calculations, and avoids random moving of fireflies. The performance of proposed controller is better in terms of path optimality when compared to other intelligent navigational approaches.展开更多
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.展开更多
A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; s...A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.展开更多
Facing the challenges of a shorter product design a nd manufacturing lead-time, many mold companies are using 3-D CAD/CAM software s ystems in design and manufacturing. A new product file is often issued to the mo ld ...Facing the challenges of a shorter product design a nd manufacturing lead-time, many mold companies are using 3-D CAD/CAM software s ystems in design and manufacturing. A new product file is often issued to the mo ld design department before it is completely finalized and the design may have t o be iterated many times during the mold design and making processes. In practic e, if a mold has been modified, all the tool paths that cover the modified regio n must be re-generated, no matter how small the modified region may be. With th e available tool path generation systems, if a tool path needs to be re-generat ed, all the cutter location (CL) points must be re-calculated, and none of the original CL points can be re-used. It would require as much time to re-gen erate the modified tool path as in the original case. On the other hand, the mod ified region is usually quite small compared with the entire mold. The complete re-generation process is therefore highly unproductive and time-consuming. This paper proposes an efficient tool path re-generation approach for 3-axis d ie and mold machining. It is assumed in this research that a gouge-free too l path has been generated for the original mold and the same ball end-mill is to be used to generate the tool path for the modified mold. It is shown in th is work that if the boundary of the modified region is interference-free, the a ffected CL points are enclosed by a set of CL points which correspond to the poi nts on the boundary of the modified region. An efficient tool path re-generatio n algorithm was developed in this research. With this algorithm, a closed CL cur ve is first generated from the boundary of the affected region. The CL points fo r the original mold are then analyzed by comparing the x and y values with the b oundary of the affected CL points. If the CL points are not affected by the modi fication, they are output to the new CL file directly. Otherwise, they are remov ed and replaced by the new CL points. The algorithm has been tested using severa l industrial parts, and results show that it is efficient, robust, and the re-g enerated tool path is gouge-free and smooth.展开更多
针对双向快速随机扩展树(rapidly-exploring random trees-connect,RRT-Connect)算法的随机性强、搜索效率低、路径规划时间过长等问题,提出一种改进的RRT-Connect算法。该算法在起始点与目标点连线的中垂线上设置第三节点,采用高斯分...针对双向快速随机扩展树(rapidly-exploring random trees-connect,RRT-Connect)算法的随机性强、搜索效率低、路径规划时间过长等问题,提出一种改进的RRT-Connect算法。该算法在起始点与目标点连线的中垂线上设置第三节点,采用高斯分布限制第三节点的采样区域,避免第三采样节点距离中点较远导致的路径冗余。算法通过第三节点分别向起始点和目标点生成2棵随机树,结合贪婪算法思想以及引入动态步长的方法,提高算法的规划效率。仿真结果表明,改进的RRT-Connect算法相较于传统RRT-Connect算法,平均运行时间缩短了48.7%,平均迭代次数减少了38.9%,平均路径长度减少了25.2%。另外,针对传统的九点标定法精度的问题,提出一种改进的九点标定方法,该方法通过获取机械臂在空间同一点的多组位姿计算机械臂第六轴长度,在已知机械臂各关节角和轴长情况下,计算得到机械臂末端执行器安装后第六轴的长度,从而提高手眼标定的精度。试验结果表明,改进的方法相较于传统九点标定法其精度平均提高了2.09%。最后,在机械臂平台验证改进的RRT-Connect算法和改进的九点标定法,试验结果表明,改进的RRT-Connect算法相较于DRRT-Connect(dynamicRRT-Connect)算法在路径规划总时间和总长度上分别减少了8.28%和4.79%,改进的九点标定法相较于传统的九点标定法抓取精度提高了3%。展开更多
文摘Autonomous mobile robot navigation is one of the most emerging areas of research by using swarm intelligence. Path planning and obstacle avoidance are most researched current topics like navigational challenges for mobile robot. The paper presents application and implementation of Firefly Algorithm(FA)for Mobile Robot Navigation(MRN) in uncertain environment. The uncertainty is defined over the changing environmental condition from static to dynamic. The attraction of one firefly towards the other firefly due to variation of their brightness is the key concept of the proposed study. The proposed controller efficiently explores the environment and improves the global search in less number of iterations and hence it can be easily implemented for real time obstacle avoidance especially for dynamic environment. It solves the challenges of navigation, minimizes the computational calculations, and avoids random moving of fireflies. The performance of proposed controller is better in terms of path optimality when compared to other intelligent navigational approaches.
基金Supported by National Natural Science Foundation of P.R.China(50275150)National Research Foundation for the Doctoral Program of Higher Education of P.R.China(20040533035)
文摘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.
文摘A new static task scheduling algorithm named edge-zeroing based on dynamic critical paths is proposed. The main ideas of the algorithm are as follows: firstly suppose that all of the tasks are in different clusters; secondly, select one of the critical paths of the partially clustered directed acyclic graph; thirdly, try to zero one of graph communication edges; fourthly, repeat above three processes until all edges are zeroed; finally, check the generated clusters to see if some of them can be further merged without increasing the parallel time. Comparisons of the previous algorithms with edge-zeroing based on dynamic critical paths show that the new algorithm has not only a low complexity but also a desired performance comparable or even better on average to much higher complexity heuristic algorithms.
文摘Facing the challenges of a shorter product design a nd manufacturing lead-time, many mold companies are using 3-D CAD/CAM software s ystems in design and manufacturing. A new product file is often issued to the mo ld design department before it is completely finalized and the design may have t o be iterated many times during the mold design and making processes. In practic e, if a mold has been modified, all the tool paths that cover the modified regio n must be re-generated, no matter how small the modified region may be. With th e available tool path generation systems, if a tool path needs to be re-generat ed, all the cutter location (CL) points must be re-calculated, and none of the original CL points can be re-used. It would require as much time to re-gen erate the modified tool path as in the original case. On the other hand, the mod ified region is usually quite small compared with the entire mold. The complete re-generation process is therefore highly unproductive and time-consuming. This paper proposes an efficient tool path re-generation approach for 3-axis d ie and mold machining. It is assumed in this research that a gouge-free too l path has been generated for the original mold and the same ball end-mill is to be used to generate the tool path for the modified mold. It is shown in th is work that if the boundary of the modified region is interference-free, the a ffected CL points are enclosed by a set of CL points which correspond to the poi nts on the boundary of the modified region. An efficient tool path re-generatio n algorithm was developed in this research. With this algorithm, a closed CL cur ve is first generated from the boundary of the affected region. The CL points fo r the original mold are then analyzed by comparing the x and y values with the b oundary of the affected CL points. If the CL points are not affected by the modi fication, they are output to the new CL file directly. Otherwise, they are remov ed and replaced by the new CL points. The algorithm has been tested using severa l industrial parts, and results show that it is efficient, robust, and the re-g enerated tool path is gouge-free and smooth.
文摘针对双向快速随机扩展树(rapidly-exploring random trees-connect,RRT-Connect)算法的随机性强、搜索效率低、路径规划时间过长等问题,提出一种改进的RRT-Connect算法。该算法在起始点与目标点连线的中垂线上设置第三节点,采用高斯分布限制第三节点的采样区域,避免第三采样节点距离中点较远导致的路径冗余。算法通过第三节点分别向起始点和目标点生成2棵随机树,结合贪婪算法思想以及引入动态步长的方法,提高算法的规划效率。仿真结果表明,改进的RRT-Connect算法相较于传统RRT-Connect算法,平均运行时间缩短了48.7%,平均迭代次数减少了38.9%,平均路径长度减少了25.2%。另外,针对传统的九点标定法精度的问题,提出一种改进的九点标定方法,该方法通过获取机械臂在空间同一点的多组位姿计算机械臂第六轴长度,在已知机械臂各关节角和轴长情况下,计算得到机械臂末端执行器安装后第六轴的长度,从而提高手眼标定的精度。试验结果表明,改进的方法相较于传统九点标定法其精度平均提高了2.09%。最后,在机械臂平台验证改进的RRT-Connect算法和改进的九点标定法,试验结果表明,改进的RRT-Connect算法相较于DRRT-Connect(dynamicRRT-Connect)算法在路径规划总时间和总长度上分别减少了8.28%和4.79%,改进的九点标定法相较于传统的九点标定法抓取精度提高了3%。
