Assembly sequence planning will be more difficult due to the increasingcomplexity of products.An integrated approach to assembly sequence planning of complex productsapplying de-composition-planning-combination strate...Assembly sequence planning will be more difficult due to the increasingcomplexity of products.An integrated approach to assembly sequence planning of complex productsapplying de-composition-planning-combination strategy is presented.First,an assembly is decomposedinto a hierarchical structure using an assembly structure representation based on connectors.Then,an assembly planning system is used to generate the sequences that are locally optimal for eachleaf partition hi the structure hierarchy.By combining the local sequences systematically in abottom-up manner and choosing suitable ones from the merged sequences,the assembly sequence of eachparent structure including the whole assembly is generated.An integrated system has beencompleted.A complex product is given to illustrate the feasibility and the practicality of theapproach.展开更多
Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassem...Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.展开更多
An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the as...An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.展开更多
Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a produc...Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.展开更多
It is well-recognized that obsolete or discarded products can cause serious environmental pollution if they are poorly be handled.They contain reusable resource that can be recycled and used to generate desired econom...It is well-recognized that obsolete or discarded products can cause serious environmental pollution if they are poorly be handled.They contain reusable resource that can be recycled and used to generate desired economic benefits.Therefore,performing their efficient disassembly is highly important in green manufacturing and sustainable economic development.Their typical examples are electronic appliances and electromechanical/mechanical products.This paper presents a survey on the state of the art of disassembly sequence planning.It can help new researchers or decision makers to search for the right solution for optimal disassembly planning.It reviews the disassembly theory and methods that are applied for the processing,repair,and maintenance of obsolete/discarded products.This paper discusses the recent progress of disassembly sequencing planning in four major aspects:product disassembly modeling methods,mathematical programming methods,artificial intelligence methods,and uncertainty handling.This survey should stimulate readers to be engaged in the research,development and applications of disassembly and remanufacturing methodologies in the Industry 4.0 era.展开更多
In this paper an assembly sequence planning model inspired by natural immune and genetic algorithm (ASPIG) based on the part degrees of freedom matrix (PDFM) is proposed, and a proto system — DSFAS based on the ASPIG...In this paper an assembly sequence planning model inspired by natural immune and genetic algorithm (ASPIG) based on the part degrees of freedom matrix (PDFM) is proposed, and a proto system — DSFAS based on the ASPIG is introduced to solve assembly sequence problem. The concept and generation of PDFM and DSFAS are also discussed. DSFAS can prevent premature convergence, and promote population diversity, and can accelerate the learning and convergence speed in behavior evolution problem.展开更多
Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products ar...Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.展开更多
Selecting appropriate tourist attractions to visit in real time is an important problem for travellers.Since recommenders proactively suggest items based on user preference,they are a promising solution for this probl...Selecting appropriate tourist attractions to visit in real time is an important problem for travellers.Since recommenders proactively suggest items based on user preference,they are a promising solution for this problem.Travellers visit tourist attractions sequentially by considering multiple attributes at the same time.Therefore,it is desirable to consider this when developing recommenders for tourist attractions.Using GRU4REC,we proposed RNN-based sequence-aware recommenders(RNN-SARs)that use multiple sequence datasets for training the recommended model,named multi-RNN-SARs.We proposed two types of multi-RNN-SARs-concatenate-RNN-SARs and parallel-RNN-SARs.In order to evaluate multi-RNN-SARs,we compared hit rate(HR)and mean reciprocal rank(MRR)of the item-based collaborative filtering recommender(item-CFR),RNN-SAR with the single-sequence dataset(basic-RNN-SAR),multi-RNN-SARs and the state-of-the-art SARs using a real-world travel dataset.Our research shows that multi-RNN-SARs have significantly higher performances compared to item-CFR.Not all multi-RNNSARs outperform basic-RNN-SAR but the best multi-RNN-SAR achieves comparable performance to that of the state-of-the-art algorithms.These results highlight the importance of using multiple sequence datasets in RNN-SARs and the importance of choosing appropriate sequence datasets and learning methods for implementing multi-RNN-SARs in practice.展开更多
Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly s...Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly sequence of each structure level can be obtained by sequence-by-sequence search. As a result, a better assembly sequence of the product can be generated by combining the assembly sequences of all hierarchical structures, which provides more parallelism and flexibility for assembly operations. An industrial example is solved by this new approach.展开更多
Flexible transfer line(FTL)is now widely used in ma ny manufacturing domains to realize efficiently,high quantity and economic prod uction.These manufacturing domains include automobile,tractor,internal-combu stion en...Flexible transfer line(FTL)is now widely used in ma ny manufacturing domains to realize efficiently,high quantity and economic prod uction.These manufacturing domains include automobile,tractor,internal-combu stion engine,and so on.In today’s competitive business environment,it is vit ally important for machine tool manufacturers to design flexible transfer line m ore effectively and efficiently according to a wider variety of customer demand s.This paper proposes an approach to a bidding-based flexible transfer line sc hematic design system.By analyzing manual FTL design process,the architecture o f flexible transfer line schematic design system(FTLSDS)is established.The syst em consists:of four processes:part feature modeling,process planning,FTL fac i lity layout and FTL evaluation. For FTL schematic design.a five-level proces s planning strategy named hierarchical process planning method is proposed.This method includes selection of manufacturing feature machining operation;part se t-up planning,feature sequencing,operation sequencing and process plan genera ting.The major decision relies on setup planning.According to the proceeding o f the hierarchical process planning,the structure of reasoning is proposed base d on blackboard.Under this paradigm,a cooperative effort between a hybrid coll ection of knowledge sources is possible.Total reasoning task can be divided int o some subtasks,and recursive-reasoning system is formed.It is convenient for process planning with step-by-step solution.Meanwhile,the blackboard is use d as the global data exchange area during all reasoning process.By using modula r technology,special purpose machine tools can be designed more efficiently and rapidly.The framework of machine modular design system to support machine requ irement design for FTL is established.By synthesizing the FTL evaluation criter ia.five evaluation criteria of flexible transfer 1ine schematic design are take n into account.An exampie is supplied to demonstrate and verify the validity an d feasibility of flexible transfer line schematic design approach.展开更多
For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarc...For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.展开更多
This paper attempts to optimize optimal capacities, block routing and mine sequencing problems in a mining system. The solution approach is based on a heuristics and the mixed integer programming (MIP). Unlike previou...This paper attempts to optimize optimal capacities, block routing and mine sequencing problems in a mining system. The solution approach is based on a heuristics and the mixed integer programming (MIP). Unlike previous sequential solution approaches, the problems are herein solved at the same time. Furthermore, the proposed approach guarantees practical solutions because it considers ore material distribution within orebody. The paper has two main contributions: (a) the proposed approach generates production rates in a manner that the capacities are satisfied; (b) the proposed approach does not use pre-defined marginal cut-off grades. Thus, idle capacity problem is eliminated and different scheduling combinations are allowed. To see the performance of the approach proposed, a case study is carried out using a gold data. The schedule generated shows that the approach can determine optimal production rates, block destination and sequencing effectively.展开更多
Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-comp...Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-complete problem.The purpose of this study is to research intelligent multiUAVs reconnaissance mission planning and online re-planning algorithm under various constraints in mission areas.For numerous targets scattered in the wide area,a reconnaissance mission planning and re-planning system is established,which includes five modules,including intelligence analysis,sub-mission area division,mission sequence planning,path smoothing,and online re-planning.The intelligence analysis module depicts the attribute of targets and the heterogeneous characteristic of UAVs and computes the number of sub-mission areas on consideration of voyage distance constraints.In the sub-mission area division module,an improved K-means clustering algorithm is designed to divide the reconnaissance mission area into several sub-mission areas,and each sub-mission is detected by the UAV loaded with various detective sensors.To control reconnaissance cost,the sampling and iteration algorithms are proposed in the mission sequence planning module,which are utilized to solve the optimal or approximately optimal reconnaissance sequence.In the path smoothing module,the Dubins curve is applied to smooth the flight path,which assure the availability of the planned path.Furthermore,an online re-planning algorithm is designed for the uncertain factor that the UAV is damaged.Finally,reconnaissance planning and re-planning experiment results show that the algorithm proposed in this paper are effective and the algorithms designed for sequence planning have a great advantage in solving efficiency and optimality.展开更多
A method for hub assembly sequence planning oriented to the fixed position layout is proposed.An assembly relationship model was constructed to describe the relationship between hub assembly components and workstation...A method for hub assembly sequence planning oriented to the fixed position layout is proposed.An assembly relationship model was constructed to describe the relationship between hub assembly components and workstations,considering the layout of the hub assembly line and process constraints,including the assembly precedence matrix,workstation assembly capability table and criticality table of components.The evaluation mechanism for the assembly sequence was established.Values from the evaluation functions with engineering significance were used to select the optimal assembly sequence from the perspective of assembly time,assembly index and assembly path distance.In function,the criticality of components was introduced into the traditional assemblability index,comparing the multi-objective dragonfly algorithm(MODA)with non-dominated sorting genetic algorithm-Ⅱ(NSGA-Ⅱ)to complete the assembly sequence planning and assignment for workstations.The optimized results show that the presented method is feasible and efficient for solving the hub assembly sequence planning problem.展开更多
Shutting down a link for the purposes of a scheduled routine maintenance does cause the forwarding path to change. If these changes are not done in a required order will cause not only transient micro loops but also a...Shutting down a link for the purposes of a scheduled routine maintenance does cause the forwarding path to change. If these changes are not done in a required order will cause not only transient micro loops but also an overload in some links. Currently, some ISP operators use a graceful link shutdown procedure by first setting up the Interior Gateway Protocol (IGP) link metric to MAX_METRIC -1 and then shutdown the link. In this paper, we present a Pythagorean Triple Metric Sequence as a method to use to shutdown a link during such network operations. Conducting a link shutdown of any desired link for maintenance purpose is a very delicate duty that requires extreme care to prevent transient loops during such topological changes. We thus wish to demonstrate that there exists a Pythagorean Triple Metric Sequence for any given link that can be used to shutdown a link during the routine maintenance by ISPs.展开更多
Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the...Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the least amount of radiation.This study proposes a discrete Rao-combined artificial bee colony(ABC)algorithm for planning inspection paths with minimum exposure doses in radioactive environments with obstacles.In this algorithm,retaining the framework of the traditional ABC algorithm,we applied the directional solution update rules of Rao algorithms at the employed bee stage and onlooker bee stage to increase the exploitation ability of the algorithm and implement discretion using the swap operator and swap sequence.To increase the randomness of solution generation,the chaos algorithm was used at the initialization stage.The K-opt operation technique was introduced at the scout bee stage to increase the exploration ability of the algorithm.For path planning in an environment with complex structural obstacles,an obstacle detour technique using a recursive algorithm was applied.To evaluate the performance of the proposed algorithm,we performed experimental simulations in three hypothetical environments and compared the results with those of improved particle swarm optimization,chaos particle swarm optimization,improved ant colony optimization,and discrete Rao’s algorithms.The experimental results show the high performance of the proposed discrete Rao-combined ABC algorithm and its obstacle detour capability.展开更多
The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storin...The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storing,and retrieving essential information from the manufacturing stage.Data collected at sites are shared with others where execution automatedly occurs.The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process.However,information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern.The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process.An optimal disassembly sequence plan(DSP)can possess valid information to organize the necessary actions in manufacturing.However,finding an optimal DSP is complex because of its combinatorial nature.The genetic algorithm(GA)is a widely preferred artificial intelligence(AI)algorithm to obtain a near-optimal solution for the DSP problem.The converging nature at local optima is a limitation in the traditional GA.This study improvised the GA workability by integrating with the proposed priori crossover operator.An optimality function is defined to reduce disassembly effort by considering directional changes as parameters.The enhanced GA method is tested on a real-time product to evaluate the performance.The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes.The proposed method’s solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product.The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.展开更多
Aiming at the former formalized methods of robot planning should give the environment state, can not obtain the new knowledge of the environment. In order to improve the reason ability for obtaining new knowledge of t...Aiming at the former formalized methods of robot planning should give the environment state, can not obtain the new knowledge of the environment. In order to improve the reason ability for obtaining new knowledge of the environment state, the actions in the process of planning such as external action and sensing action are formalized. A formalized reasoning method—CPNI (Colored Petri Net for Planning in incomplete environment) based on two kinds of actions is proposed, and the reasoning rule as Fluent Calculus in incomplete environment is applied. Robot planning experiment is modeled and simulated by using the tool CPNTools and the result shows the state knowledge of the door and the action sequence to reach the goal can be generated automatically in the CPNI net system.展开更多
Due to the increasing complexity of products and for the distributed product development, more closely collaborative work among designers is required. A collaborative assembly planning approach is proposed to support ...Due to the increasing complexity of products and for the distributed product development, more closely collaborative work among designers is required. A collaborative assembly planning approach is proposed to support assembly planning in a networked environment. The working procedure is depicted and the key techniques including collaborative-planning-oriented assembly decomposition modeling, assembly assignment modeling, and sub-plans merging are addressed. By incorporating visual models at client side with assembly application models at server side, a web-based supporting environment for collaborative assembly planning has been developed using VRML and Java-EAI techniques. A case study is given to illustrate the feasibility and validity of the idea.展开更多
基金supported by National Natural Science Foundation of China(No.59990470-2).
文摘Assembly sequence planning will be more difficult due to the increasingcomplexity of products.An integrated approach to assembly sequence planning of complex productsapplying de-composition-planning-combination strategy is presented.First,an assembly is decomposedinto a hierarchical structure using an assembly structure representation based on connectors.Then,an assembly planning system is used to generate the sequences that are locally optimal for eachleaf partition hi the structure hierarchy.By combining the local sequences systematically in abottom-up manner and choosing suitable ones from the merged sequences,the assembly sequence of eachparent structure including the whole assembly is generated.An integrated system has beencompleted.A complex product is given to illustrate the feasibility and the practicality of theapproach.
基金supported by the National High Technology Research and Development Program of China(2006AA04Z427).
文摘Disassembly sequence planning （DSP） plays a significant role in maintenance planning of the aircraft. It is used during the design stage for the analysis of maintainability of the aircraft. To solve product disassembly sequence planning problems efficiently, a product disassembly hybrid graph model, which describes the connection, non-connection and precedence relationships between the product parts, is established based on the characteristic of disassembly. Farther, the optimization model is provided to optimize disassembly sequence. And the solution methodology based on the genetic/simulated annealing algorithm with binaxy-tree algorithm is given. Finally, an example is analyzed in detail, and the result shows that the model is correct and efficient.
基金This project is supported by National Natural Science Foundation of China(No.59990470,No.59725514,No.59985004)and Robotics Laboratory,Chinese Academy of Sciences Foundation(No.RL200006)
文摘An integrated approach to generation of precedence relations and precedencegraphs for assembly sequence planning is presented, which contains more assembly flexibility. Theapproach involves two stages. Based on the assembly model, the components in the assembly can bedivided into partially constrained components and completely con-strained components in the firststage, and then geometric precedence relation for every component is generated automatically.According to the result of the first stage, the second stage determines and constructs allprecedence graphs. The algorithms of these two stages proposed are verified by two assemblyexamples.
文摘Based on the bat algorithm(BA), this paper proposes a discrete BA(DBA) approach to optimize the disassembly sequence planning(DSP) problem, for the purpose of obtaining an optimum disassembly sequence(ODS) of a product with a high degree of automation and guiding maintenance operation. The BA for solving continuous problems is introduced, and combining with mathematical formulations, the BA is reformed to be the DBA for DSP problems. The fitness function model(FFM) is built to evaluate the quality of disassembly sequences. The optimization performance of the DBA is tested and verified by an application case, and the DBA is compared with the genetic algorithm(GA), particle swarm optimization(PSO) algorithm and differential mutation BA(DMBA). Numerical experiments show that the proposed DBA has a better optimization capability and provides more accurate solutions than the other three algorithms.
基金the Research Foundation of China(L2019027)Liaoning Revitalization Talents Program(XLYC1907166)the Deanship of Scientific Research(DSR)at King Abdulaziz University,Jeddah(KEP-2-135-39)。
文摘It is well-recognized that obsolete or discarded products can cause serious environmental pollution if they are poorly be handled.They contain reusable resource that can be recycled and used to generate desired economic benefits.Therefore,performing their efficient disassembly is highly important in green manufacturing and sustainable economic development.Their typical examples are electronic appliances and electromechanical/mechanical products.This paper presents a survey on the state of the art of disassembly sequence planning.It can help new researchers or decision makers to search for the right solution for optimal disassembly planning.It reviews the disassembly theory and methods that are applied for the processing,repair,and maintenance of obsolete/discarded products.This paper discusses the recent progress of disassembly sequencing planning in four major aspects:product disassembly modeling methods,mathematical programming methods,artificial intelligence methods,and uncertainty handling.This survey should stimulate readers to be engaged in the research,development and applications of disassembly and remanufacturing methodologies in the Industry 4.0 era.
基金This Research was Supported by Shanghai Natural Science and Technology project(01Zf14004)
文摘In this paper an assembly sequence planning model inspired by natural immune and genetic algorithm (ASPIG) based on the part degrees of freedom matrix (PDFM) is proposed, and a proto system — DSFAS based on the ASPIG is introduced to solve assembly sequence problem. The concept and generation of PDFM and DSFAS are also discussed. DSFAS can prevent premature convergence, and promote population diversity, and can accelerate the learning and convergence speed in behavior evolution problem.
文摘Disassembly sequence planning is an important step of mechanical maintenance. This article presents an integrated study about the generation and optimizing algorithm of the disassembly sequence. Mechanical products are divided into two categories of components and connectors. The article uses component-joint graph to represent assembly constraints, including the incidence constraints are represented by incidence matrix and the interference constraints are represented by interference constraints. The inspiring factor and pheromone matrix are calculated according to assembly constraints. Then the ant generates its own disassembly sequences one by one and updates the inspiring factor and pheromone matrix. After all iterations, the best disassembly sequence planning of components and connectors are given. Finally, an application instance of the disassembly sequence of the jack is presented to illustrate the validity of this method.
文摘Selecting appropriate tourist attractions to visit in real time is an important problem for travellers.Since recommenders proactively suggest items based on user preference,they are a promising solution for this problem.Travellers visit tourist attractions sequentially by considering multiple attributes at the same time.Therefore,it is desirable to consider this when developing recommenders for tourist attractions.Using GRU4REC,we proposed RNN-based sequence-aware recommenders(RNN-SARs)that use multiple sequence datasets for training the recommended model,named multi-RNN-SARs.We proposed two types of multi-RNN-SARs-concatenate-RNN-SARs and parallel-RNN-SARs.In order to evaluate multi-RNN-SARs,we compared hit rate(HR)and mean reciprocal rank(MRR)of the item-based collaborative filtering recommender(item-CFR),RNN-SAR with the single-sequence dataset(basic-RNN-SAR),multi-RNN-SARs and the state-of-the-art SARs using a real-world travel dataset.Our research shows that multi-RNN-SARs have significantly higher performances compared to item-CFR.Not all multi-RNNSARs outperform basic-RNN-SAR but the best multi-RNN-SAR achieves comparable performance to that of the state-of-the-art algorithms.These results highlight the importance of using multiple sequence datasets in RNN-SARs and the importance of choosing appropriate sequence datasets and learning methods for implementing multi-RNN-SARs in practice.
基金the Natural Science Foundation of China (59990470, 59725514, 59985004), andRobotics Laboratory, Chinese Academy of Sciences fo
文摘Using group and subassembly cluster methods, the hierarchical structure of a product is ?generated automatically, which largely reduces the complexity of planning. Based on genetic algorithm, the optimal of assembly sequence of each structure level can be obtained by sequence-by-sequence search. As a result, a better assembly sequence of the product can be generated by combining the assembly sequences of all hierarchical structures, which provides more parallelism and flexibility for assembly operations. An industrial example is solved by this new approach.
文摘Flexible transfer line(FTL)is now widely used in ma ny manufacturing domains to realize efficiently,high quantity and economic prod uction.These manufacturing domains include automobile,tractor,internal-combu stion engine,and so on.In today’s competitive business environment,it is vit ally important for machine tool manufacturers to design flexible transfer line m ore effectively and efficiently according to a wider variety of customer demand s.This paper proposes an approach to a bidding-based flexible transfer line sc hematic design system.By analyzing manual FTL design process,the architecture o f flexible transfer line schematic design system(FTLSDS)is established.The syst em consists:of four processes:part feature modeling,process planning,FTL fac i lity layout and FTL evaluation. For FTL schematic design.a five-level proces s planning strategy named hierarchical process planning method is proposed.This method includes selection of manufacturing feature machining operation;part se t-up planning,feature sequencing,operation sequencing and process plan genera ting.The major decision relies on setup planning.According to the proceeding o f the hierarchical process planning,the structure of reasoning is proposed base d on blackboard.Under this paradigm,a cooperative effort between a hybrid coll ection of knowledge sources is possible.Total reasoning task can be divided int o some subtasks,and recursive-reasoning system is formed.It is convenient for process planning with step-by-step solution.Meanwhile,the blackboard is use d as the global data exchange area during all reasoning process.By using modula r technology,special purpose machine tools can be designed more efficiently and rapidly.The framework of machine modular design system to support machine requ irement design for FTL is established.By synthesizing the FTL evaluation criter ia.five evaluation criteria of flexible transfer 1ine schematic design are take n into account.An exampie is supplied to demonstrate and verify the validity an d feasibility of flexible transfer line schematic design approach.
文摘For a surface mounting machine (SMM) in printed circuit board (PCB) assembly line, there are four problems, e.g. CAD data conversion, nozzle selection, feeder assignment and placement sequence determination. A hierarchical planning for them to maximize the throughput rate of an SMM is presented here. To minimize set-up time, a CAD data conversion system was first applied that could automatically generate the data for machine placement from CAD design data files. Then an effective nozzle selection approach was implemented to minimize the time of nozzle changing. And then, to minimize picking time, an algorithm for feeder assignment was used to make picking multiple components simultaneously as much as possible. Finally, in order to shorten pick-and-place time, a heuristic algorithm was used to determine optimal component placement sequence according to the decided feeder positions. Experiments were conducted on a four head SMM. The experimental results were used to analyse the assembly line performance.
文摘This paper attempts to optimize optimal capacities, block routing and mine sequencing problems in a mining system. The solution approach is based on a heuristics and the mixed integer programming (MIP). Unlike previous sequential solution approaches, the problems are herein solved at the same time. Furthermore, the proposed approach guarantees practical solutions because it considers ore material distribution within orebody. The paper has two main contributions: (a) the proposed approach generates production rates in a manner that the capacities are satisfied; (b) the proposed approach does not use pre-defined marginal cut-off grades. Thus, idle capacity problem is eliminated and different scheduling combinations are allowed. To see the performance of the approach proposed, a case study is carried out using a gold data. The schedule generated shows that the approach can determine optimal production rates, block destination and sequencing effectively.
文摘Reconnaissance mission planning of multiple unmanned aerial vehicles(UAVs)under an adversarial environment is a discrete combinatorial optimization problem which is proved to be a non-deterministic polynomial(NP)-complete problem.The purpose of this study is to research intelligent multiUAVs reconnaissance mission planning and online re-planning algorithm under various constraints in mission areas.For numerous targets scattered in the wide area,a reconnaissance mission planning and re-planning system is established,which includes five modules,including intelligence analysis,sub-mission area division,mission sequence planning,path smoothing,and online re-planning.The intelligence analysis module depicts the attribute of targets and the heterogeneous characteristic of UAVs and computes the number of sub-mission areas on consideration of voyage distance constraints.In the sub-mission area division module,an improved K-means clustering algorithm is designed to divide the reconnaissance mission area into several sub-mission areas,and each sub-mission is detected by the UAV loaded with various detective sensors.To control reconnaissance cost,the sampling and iteration algorithms are proposed in the mission sequence planning module,which are utilized to solve the optimal or approximately optimal reconnaissance sequence.In the path smoothing module,the Dubins curve is applied to smooth the flight path,which assure the availability of the planned path.Furthermore,an online re-planning algorithm is designed for the uncertain factor that the UAV is damaged.Finally,reconnaissance planning and re-planning experiment results show that the algorithm proposed in this paper are effective and the algorithms designed for sequence planning have a great advantage in solving efficiency and optimality.
基金Supported by the National Natural Science Foundation of China(51965034,51565028)the Fundamental Research Funds for the Lanzhou City Innovation and Entrepreneurship Project(2018-RC-25)。
文摘A method for hub assembly sequence planning oriented to the fixed position layout is proposed.An assembly relationship model was constructed to describe the relationship between hub assembly components and workstations,considering the layout of the hub assembly line and process constraints,including the assembly precedence matrix,workstation assembly capability table and criticality table of components.The evaluation mechanism for the assembly sequence was established.Values from the evaluation functions with engineering significance were used to select the optimal assembly sequence from the perspective of assembly time,assembly index and assembly path distance.In function,the criticality of components was introduced into the traditional assemblability index,comparing the multi-objective dragonfly algorithm(MODA)with non-dominated sorting genetic algorithm-Ⅱ(NSGA-Ⅱ)to complete the assembly sequence planning and assignment for workstations.The optimized results show that the presented method is feasible and efficient for solving the hub assembly sequence planning problem.
文摘Shutting down a link for the purposes of a scheduled routine maintenance does cause the forwarding path to change. If these changes are not done in a required order will cause not only transient micro loops but also an overload in some links. Currently, some ISP operators use a graceful link shutdown procedure by first setting up the Interior Gateway Protocol (IGP) link metric to MAX_METRIC -1 and then shutdown the link. In this paper, we present a Pythagorean Triple Metric Sequence as a method to use to shutdown a link during such network operations. Conducting a link shutdown of any desired link for maintenance purpose is a very delicate duty that requires extreme care to prevent transient loops during such topological changes. We thus wish to demonstrate that there exists a Pythagorean Triple Metric Sequence for any given link that can be used to shutdown a link during the routine maintenance by ISPs.
文摘Workers who conduct regular facility inspections in radioactive environments will inevitably be affected by radiation.Therefore,it is important to optimize the inspection path to ensure that workers are exposed to the least amount of radiation.This study proposes a discrete Rao-combined artificial bee colony(ABC)algorithm for planning inspection paths with minimum exposure doses in radioactive environments with obstacles.In this algorithm,retaining the framework of the traditional ABC algorithm,we applied the directional solution update rules of Rao algorithms at the employed bee stage and onlooker bee stage to increase the exploitation ability of the algorithm and implement discretion using the swap operator and swap sequence.To increase the randomness of solution generation,the chaos algorithm was used at the initialization stage.The K-opt operation technique was introduced at the scout bee stage to increase the exploration ability of the algorithm.For path planning in an environment with complex structural obstacles,an obstacle detour technique using a recursive algorithm was applied.To evaluate the performance of the proposed algorithm,we performed experimental simulations in three hypothetical environments and compared the results with those of improved particle swarm optimization,chaos particle swarm optimization,improved ant colony optimization,and discrete Rao’s algorithms.The experimental results show the high performance of the proposed discrete Rao-combined ABC algorithm and its obstacle detour capability.
基金The authors are grateful to the Raytheon Chair for Systems Engineering for funding.
文摘The evolution of Industry 4.0 made it essential to adopt the Internet of Things(IoT)and Cloud Computing(CC)technologies to perform activities in the new age of manufacturing.These technologies enable collecting,storing,and retrieving essential information from the manufacturing stage.Data collected at sites are shared with others where execution automatedly occurs.The obtained information must be validated at manufacturing to avoid undesirable data losses during the de-manufacturing process.However,information sharing from the assembly level at the manufacturing stage to disassembly at the product end-of-life state is a major concern.The current research validates the information optimally to offer a minimum set of activities to complete the disassembly process.An optimal disassembly sequence plan(DSP)can possess valid information to organize the necessary actions in manufacturing.However,finding an optimal DSP is complex because of its combinatorial nature.The genetic algorithm(GA)is a widely preferred artificial intelligence(AI)algorithm to obtain a near-optimal solution for the DSP problem.The converging nature at local optima is a limitation in the traditional GA.This study improvised the GA workability by integrating with the proposed priori crossover operator.An optimality function is defined to reduce disassembly effort by considering directional changes as parameters.The enhanced GA method is tested on a real-time product to evaluate the performance.The obtained results reveal that diversity control depends on the operators employed in the disassembly attributes.The proposed method’s solution can be stored in the cloud and shared through IoT devices for effective resource allocation and disassembly for maximum recovery of the product.The effectiveness of the proposed enhanced GA method is determined by making a comparative assessment with traditional GA and other AI methods at different population sizes.
文摘Aiming at the former formalized methods of robot planning should give the environment state, can not obtain the new knowledge of the environment. In order to improve the reason ability for obtaining new knowledge of the environment state, the actions in the process of planning such as external action and sensing action are formalized. A formalized reasoning method—CPNI (Colored Petri Net for Planning in incomplete environment) based on two kinds of actions is proposed, and the reasoning rule as Fluent Calculus in incomplete environment is applied. Robot planning experiment is modeled and simulated by using the tool CPNTools and the result shows the state knowledge of the door and the action sequence to reach the goal can be generated automatically in the CPNI net system.
基金This research is supported by National Nature Science Foundation of China (NSFC) under the project number 59990470-2.
文摘Due to the increasing complexity of products and for the distributed product development, more closely collaborative work among designers is required. A collaborative assembly planning approach is proposed to support assembly planning in a networked environment. The working procedure is depicted and the key techniques including collaborative-planning-oriented assembly decomposition modeling, assembly assignment modeling, and sub-plans merging are addressed. By incorporating visual models at client side with assembly application models at server side, a web-based supporting environment for collaborative assembly planning has been developed using VRML and Java-EAI techniques. A case study is given to illustrate the feasibility and validity of the idea.
