In this paper, a new computation method and an optimization algorithm are presented for feedrate scheduling of five-axis machining in compliance with both machine drive limits and process limits. Five-axis machine too...In this paper, a new computation method and an optimization algorithm are presented for feedrate scheduling of five-axis machining in compliance with both machine drive limits and process limits. Five-axis machine tool with its ability of controlling tool orientation to follow the sculptured surface contour has been widely used in modern manufacturing industry. Feedrate scheduling serving as a kernel of CNC control system plays a critical role to ensure the required machining accuracy and reliability for five-axis machining. Due to the nonlinear coupling effects of all involved drive axes and the saturation limit of servo motors, the feedrate scheduling for multi-axis machining has long been recognized and remains as a critical challenge for achieving five-axis machine tools’ full capacity and advantage. To solve the nonlinearity nature of the five-axis feedrate scheduling problems, a relaxation mathematical process is presented for relaxing both the drive motors’ physical limitations and the kinematic constraints of five-axis tool motions. Based on the primary optimization variable of feedrate, the presented method analytically linearizes the machining-related constraints, in terms of the machines’ axis velocities, axis accelerations and axis jerks. The nonlinear multi-constrained feedrate scheduling problem is transformed into a manageable linear programming problem. An optimization algorithm is presented to find the optimal feedrate scheduling solution for the five-axis machining problems. Both computer implementation and laboratorial experiment testing by actual machine cutting were conducted and presented in this paper. The experiment results demonstrate that the proposed method can effectively generate efficient feedrate scheduling for five-axis machining with constraints of the machine tool physical constraints and limits. Compared with other existing numerical methods, the proposed method is able to find an accurate analytical solution for the nonlinear constrained five-axis feedrate scheduling problems without compromising the efficiency of the machining processes.展开更多
Maximizing the lifetime of wireless sensor networks(WSNs) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor networ...Maximizing the lifetime of wireless sensor networks(WSNs) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor network is one of the most effective approaches to prolong the lifetime of wireless sensor networks. However, the existing mobile sink scheduling methods either require a great amount of computational time or lack effectiveness in finding high-quality scheduling solutions. To address the above issues, this paper proposes a novel hyperheuristic framework, which can automatically construct high-level heuristics to schedule the sink movements and prolong the network lifetime. In the proposed framework, a set of low-level heuristics are defined as building blocks to construct high-level heuristics and a set of random networks with different features are designed for training. Further, a genetic programming algorithm is adopted to automatically evolve promising high-level heuristics based on the building blocks and the training networks. By using the genetic programming to evolve more effective heuristics and applying these heuristics in a greedy scheme, our proposed hyper-heuristic framework can prolong the network lifetime competitively with other methods, with small time consumption. A series of comprehensive experiments, including both static and dynamic networks,are designed. The simulation results have demonstrated that the proposed method can offer a very promising performance in terms of network lifetime and response time.展开更多
Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and diff...Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and difficult task. Insufficient design, illogical code structure, short documents will enhance the comprehensive difficulty. Developing Web application is usually a process with quick implementation and delivery. In addition, generally a Web application is coded by combining mark language statements with some embedded applets. Such programming mode affects comprehension of Web applications disadvantageously. This paper proposes a method to improving understanding Web by dependence analysis and slice technology. Key words Web application comprehension - program dependence - hyper graph - pogram slicing CLC number TP 311 Foundation item: Supported in part by the Young Scientist’s Fund of NSFC (60373066, 60303024). National Grand Fundamental Research 973 Program of China (2002CB312000) and National Research Foundation for the Doctoral Program of Higher Education of ChinaBiography: WU Jun-hua (1965-), female, Ph. D. research direction: software engineering.展开更多
基金supported by the National Natural Science Foundation of China (Grant No. 51525501)the Science Challenge Project (Grant No. TZ2016006-0102)+1 种基金the Dalian Science and Technology Project (Grant No. 2016RD08)Dr. Y.S. Lee was partially supported by the National Science Foundation (Grant No. CMMI-1547105) to North Carolina State University
文摘In this paper, a new computation method and an optimization algorithm are presented for feedrate scheduling of five-axis machining in compliance with both machine drive limits and process limits. Five-axis machine tool with its ability of controlling tool orientation to follow the sculptured surface contour has been widely used in modern manufacturing industry. Feedrate scheduling serving as a kernel of CNC control system plays a critical role to ensure the required machining accuracy and reliability for five-axis machining. Due to the nonlinear coupling effects of all involved drive axes and the saturation limit of servo motors, the feedrate scheduling for multi-axis machining has long been recognized and remains as a critical challenge for achieving five-axis machine tools’ full capacity and advantage. To solve the nonlinearity nature of the five-axis feedrate scheduling problems, a relaxation mathematical process is presented for relaxing both the drive motors’ physical limitations and the kinematic constraints of five-axis tool motions. Based on the primary optimization variable of feedrate, the presented method analytically linearizes the machining-related constraints, in terms of the machines’ axis velocities, axis accelerations and axis jerks. The nonlinear multi-constrained feedrate scheduling problem is transformed into a manageable linear programming problem. An optimization algorithm is presented to find the optimal feedrate scheduling solution for the five-axis machining problems. Both computer implementation and laboratorial experiment testing by actual machine cutting were conducted and presented in this paper. The experiment results demonstrate that the proposed method can effectively generate efficient feedrate scheduling for five-axis machining with constraints of the machine tool physical constraints and limits. Compared with other existing numerical methods, the proposed method is able to find an accurate analytical solution for the nonlinear constrained five-axis feedrate scheduling problems without compromising the efficiency of the machining processes.
基金supported by the National Natural Science Foundation of China(61602181,61876025)Program for Guangdong Introducing Innovative and Entrepreneurial Teams(2017ZT07X183)+2 种基金Guangdong Natural Science Foundation Research Team(2018B030312003)the Guangdong–Hong Kong Joint Innovation Platform(2018B050502006)the Fundamental Research Funds for the Central Universities(D2191200)
文摘Maximizing the lifetime of wireless sensor networks(WSNs) is an important and challenging research problem. Properly scheduling the movements of mobile sinks to balance the energy consumption of wireless sensor network is one of the most effective approaches to prolong the lifetime of wireless sensor networks. However, the existing mobile sink scheduling methods either require a great amount of computational time or lack effectiveness in finding high-quality scheduling solutions. To address the above issues, this paper proposes a novel hyperheuristic framework, which can automatically construct high-level heuristics to schedule the sink movements and prolong the network lifetime. In the proposed framework, a set of low-level heuristics are defined as building blocks to construct high-level heuristics and a set of random networks with different features are designed for training. Further, a genetic programming algorithm is adopted to automatically evolve promising high-level heuristics based on the building blocks and the training networks. By using the genetic programming to evolve more effective heuristics and applying these heuristics in a greedy scheme, our proposed hyper-heuristic framework can prolong the network lifetime competitively with other methods, with small time consumption. A series of comprehensive experiments, including both static and dynamic networks,are designed. The simulation results have demonstrated that the proposed method can offer a very promising performance in terms of network lifetime and response time.
文摘Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and difficult task. Insufficient design, illogical code structure, short documents will enhance the comprehensive difficulty. Developing Web application is usually a process with quick implementation and delivery. In addition, generally a Web application is coded by combining mark language statements with some embedded applets. Such programming mode affects comprehension of Web applications disadvantageously. This paper proposes a method to improving understanding Web by dependence analysis and slice technology. Key words Web application comprehension - program dependence - hyper graph - pogram slicing CLC number TP 311 Foundation item: Supported in part by the Young Scientist’s Fund of NSFC (60373066, 60303024). National Grand Fundamental Research 973 Program of China (2002CB312000) and National Research Foundation for the Doctoral Program of Higher Education of ChinaBiography: WU Jun-hua (1965-), female, Ph. D. research direction: software engineering.
