Search results

Assembly sequence planning (ASP) plays a vital role in assembly process because it directly influences the feasibility, cost and time of the assembly process. The purpose of this study is to solve ASP problem more efficiently than current algorithms.

A novel assembly subsets prediction method based on precedence graph is proposed to solve the ASP problem. The proposed method adopts the idea of local to whole and integrates a simplified firework algorithm. First, assembly subsets are generated as initial fireworks. Then, each firework explodes to several sparks with higher-level assembly subsets and new fireworks are selected for next generation according to selection strategy. Finally, iterating the algorithm until complete and feasible solutions are generated.

The proposed method performs better in comparison with state-of-the-art algorithms because of the balance of exploration (fireworks) and exploitation (sparks). The size of initial fireworks population determines the diversity of the solution, so assembly subsets prediction method based on precedence graph (ASPM-PG) can explore the solution space. The size of sparks controls the exploitation ability of ASPM-PG; with more sparks, the direction of a specific firework can be adequately exploited.

The proposed method is with simple structure and high efficiency. It is anticipated that using the proposed method can effectively improve the efficiency of ASP and reduce computing cost for industrial applications.

The proposed method finds the optimal sequence in the construction process of assembly sequence rather than adjusting order of a complete assembly sequence in traditional methods. Moreover, a simplified firework algorithm with new operators is introduced. Two basic size parameters are also analyzed to explain the proposed method.

The purpose of this study is to develop an intelligent methodology to find out an optimal feasible assembly sequence while considering the assembly predicates.

This proposed study is carried out by using two artificial immune system-based models, namely, Bone Marrow Model and Negative Selection Algorithms, to achieve the following objectives: to obtain the possible number of assembly sequences; to obtain the feasible assembly sequences while considering different assembly predicates; and to obtain an optimal feasible assembly sequence.

Proposed bone-marrow model determines the possible assembly sequences to ease the intricacy of the problem formulation. Further evaluation has been carried out through negative-selection censoring and monitoring models. These developed models reduce the overall computational time to determine the optimal feasible assembly sequence.

In this paper, the novel and efficient strategies based on artificial immune system have been developed and proposed to obtain all valid assembly sequences and optimized assembly sequence for a given assembled product using assembly attributes. The introduced methodology has proven its effectiveness in achieving optimal assembly sequence with less computational time.

In robot programming by demonstration (PbD) of small parts assembly tasks, the accuracy of parts poses estimated by vision-based techniques in demonstration stage is far from enough to ensure a successful execution. This paper aims to develop an inference method to improve the accuracy of poses and assembly relations between parts by integrating visual observation with computer-aided design (CAD) model.

In this paper, the authors propose a spatial information inference method called probabilistic assembly graph with optional CAD model, shorted as PAGC*, to achieve this task. Then an assembly relation extraction method from CAD model is designed, where different assembly relation descriptions in CAD model are summarized into two fundamental relations that are colinear and coplanar. The relation similarity, distance similarity and rotation similarity are adopted as the similar part matching criterions between the CAD model and the observation. The knowledge of part in CAD is used to correct that of the corresponding part in observation. The likelihood maximization estimation is used to infer the accurate poses and assembly relations based on the probabilistic assembly graph.

In the experiments, both simulated data and real-world data are applied to evaluate the performance of the PAGC* model. The experimental results show the superiority of PAGC* in accuracy compared with assembly graph (AG) and probabilistic assembly graph without CAD model (PAG).

The paper provides a new approach to get the accurate pose of each part in demonstration stage of the robot PbD system. By integrating information from visual observation with prior knowledge from CAD model, PAGC* ensures the success in execution stage of the PbD system.

Parallel assembly sequence planning (PASP) reduces the overall assembly effort and time at the product development stage. Methodological difficulties at framework development and computational issues at their implementation made the PASP complex to achieve. This paper aims to propose a novel stability concept for subassembly detection to minimize the complexities in PASP.

In this research, a heuristic method is developed to identify, represent and implement the stability predicate to perform subassembly detection and assembly sequence planning (ASP) at the further stages. Stability is organized into static, dynamic, enriched and no stability between the mating assembly parts. The combination of parts that possesses higher fitness is promoted to formulate the final solution about PASP.

The results obtained by applying the proposed concept on complex configurations revealed that stability predicate plays a dominant role in valid subassembly detection and final sequence generation further.

The value of the presented study lies in the three types of stability conditions and effective integration to existed ASP method. Unlike the existed heuristics in subassembly detection, the proposed concept identifies the parallel subassemblies during ASP.

The purpose of this paper is to find out the significant influence of assembly predicate consideration on optimal assembly sequence generation (ASG) in terms of search space, computational time and possibility of resulting practically not feasible assembly sequences. An appropriate assembly sequence results in minimal lead time and low cost of assembly. ASG is a complex combinatorial optimisation problem which deals with several assembly predicates to result an optimal assembly sequence. The consideration of each assembly predicate highly influences the search space and thereby computational time to achieve valid assembly sequence. Often, the ignoring an assembly predicate leads to inappropriate assembly sequence, which may not be physically possible, sometimes predicate assumption drastic ally raises the search space with high computational time.

The influence of assuming and considering different assembly predicates on optimal assembly sequence generation have been clearly illustrated with examples using part concatenation method.

The presence of physical attachments and type of assembly liaisons decide the consideration of assembly predicate to reduce the complexity of the problem formulation and overall computational time.

Most of the times, assembly predicates are ignored to reduce the computational time without considering their impact on the assembly sequence problem irrespective of assembly attributes. The current research proposes direction towards predicate considerations based on the assembly configurations for effective and efficient ASG.

Preparing digital mock-ups (DMUs) for finite element analyses (FEAs) is currently a long and tedious task requiring many interactive CAD model transformations. Functional information about components appears to be very useful to speed this preparation process. The purpose of this paper is to shows how DMU components can be automatically enriched with some functional information.

DMUs are widespread and stand as reference model for product description. However, DMUs produced by industrial CAD systems essentially contain geometric models, which lead to tedious preparation of finite element Models (FEMs). Analysis and reasoning approaches are developed to automatically enrich DMUs with functional and kinematic properties. Indeed, geometric interfaces between components form a key starting point to analyze their behaviors under reference states. This is a first stage in a reasoning process to progressively identify mechanical, kinematic as well as functional properties of components.

Inferred semantics adds up to the pure geometric representation provided by a DMU and produce also geometrically structured components. Functional information connected to a structured geometric model of a component significantly improves FEM preparation and increases its robustness because idealizations can take place using components’ functions and components’ structure helps defining sub-domains of FEMs.

Future research will carry on improving algorithms for geometric interfaces identification, processing a wider range of component functions, which will contribute to a formalization of the concept of functional consistency of a DMU.

Simulation engineers benefit from this automated enrichment of DMUs with functional information to speed up the preparation of FEAs of large assemblies.

The implied assembly constraints of a computer-aided design (CAD) model (e.g. hierarchical constraints, geometric constraints and topological constraints) represent an important basis for product assembly sequence intelligent planning. Assembly prior knowledge contains factual assembly knowledge and experience assembly knowledge, which are important factors for assembly sequence intelligent planning. This paper aims to improve monotonous assembly sequence planning for a rigid product, intelligent planning of product assembly sequences based on spatio-temporal semantic knowledge is proposed.

A spatio-temporal semantic assembly information model is established. The internal data of the CAD model are accessed to extract spatio-temporal semantic assembly information. The knowledge system for assembly sequence intelligent planning is built using an ontology model. The assembly sequence for the sub-assembly and assembly is generated via attribute retrieval and rule reasoning of spatio-temporal semantic knowledge. The optimal assembly sequence is achieved via a fuzzy comprehensive evaluation.

The proposed spatio-temporal semantic information model and knowledge system can simultaneously express CAD model knowledge and prior knowledge for intelligent planning of product assembly sequences. Attribute retrieval and rule reasoning of spatio-temporal semantic knowledge can be used to generate product assembly sequences.

The assembly sequence intelligent planning example of linear motor highlights the validity of intelligent planning of product assembly sequences based on spatio-temporal semantic knowledge.

The spatio-temporal semantic information model and knowledge system are built to simultaneously express CAD model knowledge and assembly prior knowledge. The generation algorithm via attribute retrieval and rule reasoning of spatio-temporal semantic knowledge is given for intelligent planning of product assembly sequences in this paper. The proposed method is efficient because of the small search space.

The purpose of this paper is to perform a comparative assessment on working of the existed subassembly identification (SI) methods, which are widely practiced during the product development stage and to propose an improved method for solving the SI problem in assembly sequence planning (ASP).

The cut-set method is found as a suitable method among various knowledge-based methods such as the theory of loops, theory of connectors and theory of clusters for the workability enhancement to meet the current requirements. Necessary product information is represented in the matrix format by replacing the traditional AND/OR graphs and the advanced predicates are included in the evaluation criteria.

The prominent methods in SI are followed a few of the predicates to avoid complexity in solution generation. The predicate consideration is found as the most influencing factor in eliminating the infeasible part combinations at SI. However, the quality of identified subassemblies without advanced predicates is not influencing the solution generation phase but practical applicability is affecting adversely.

The capability of performing SI by the cut-set method is improved to deal with the complex assembly configurations. The improved method is tested by applying on different assembly configurations and the effectiveness is compared with other existent methods of ASP along with the conventional method.

Today's market environment is characterized by an increasing demand for greater product variety. This has inevitably led to decreased product life cycle and forced volume manufacturers to consider switching from the mass production of a limited range of products to lower volume production of a wider range. This trend is observable in moves towards lean production within the car industry.

In this paper, the authors aim to propose a method for learning robotic assembly sequences, where precedence constraints and object relative size and location constraints can be learned by demonstration and autonomous robot exploration.

To successfully plan the operations involved in assembly tasks, the planner needs to know the constraints of the desired task. In this paper, the authors propose a methodology for learning such constraints by demonstration and autonomous exploration. The learning of precedence constraints and object relative size and location constraints, which are needed to construct a planner for automated assembly, were investigated. In the developed system, the learning of symbolic constraints is integrated with low-level control algorithms, which is essential to enable active robot learning.

The authors demonstrated that the proposed reasoning algorithms can be used to learn previously unknown assembly constraints that are needed to implement a planner for automated assembly. Cranfield benchmark, which is a standardized benchmark for testing algorithms for robot assembly, was used to evaluate the proposed approaches. The authors evaluated the learning performance both in simulation and on a real robot.

The authors' approach reduces the amount of programming that is needed to set up new assembly cells and consequently the overall set up time when new products are introduced into the workcell.

In this paper, the authors propose a new approach for learning assembly constraints based on programming by demonstration and active robot exploration to reduce the computational complexity of the underlying search problems. The authors developed algorithms for success/failure detection of assembly operations based on the comparison of expected signals (forces and torques, positions and orientations of the assembly parts) with the actual signals sensed by a robot. In this manner, all precedence and object size and location constraints can be learned, thereby providing the necessary input for the optimal planning of the entire assembly process.