CAD-Based Automatic Clash Analysis for Robotic Assembly

Assembly operation occupies major stake in the manufacturing process to obtain the final product. In order to obtain an assembly sequence for a given product, the product should be free of clashes between the parts. To know the clash between the parts, many researchers are followed mathematical models to generate contact data information of the product. These methods will consume much time and search space to extract the information from the product. Current research focuses on developing an automatic algorithm to generate the clash analysis report using macros CATIA V5 R17. In this method, it will not only generate the clash analysis report but also generate a contact information matrix between the parts of the assembly. The developed methodology is implemented on various industrial products to extract the clash information of the product.

Download Full-text

A model and strategy analysis of the peg-hole system in the search process associated with robotic assembly operations without chamfers

Robotica ◽

10.1017/s0263574700018518 ◽

1996 ◽

Vol 14 (6) ◽

pp. 647-658 ◽

Cited By ~ 5

Author(s):

Hong Qiao ◽

Philip Moore ◽

Jeff Knight

Keyword(s):

High Precision ◽

Manufacturing Process ◽

High Speed ◽

Manufacturing Industry ◽

Robotic Assembly ◽

Search Process ◽

Strategy Analysis ◽

Assembly Operation ◽

Assembly Operations ◽

Insertion Process

Robotic peg-hole insertion operations can play a very important role in manufacturing industry because it is a common requirement in the manufacturing process and, it requires high precision and high speed.In general, this operation can be divided into two processes: Search process to engage the peg and the hole and, insertion process.The search process is critical in the assembly operation. It can be defined as a process where the angular.and the translational errors between the peg and the hole are reduced until insertion can occur.

Download Full-text

Optimal robotic assembly sequence planning using stability graph through stable assembly subset identification

Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science ◽

10.1177/0954406219842908 ◽

2019 ◽

Vol 233 (15) ◽

pp. 5410-5430 ◽

Cited By ~ 1

Author(s):

G Bala Murali ◽

BBVL Deepak ◽

MVA Raju ◽

BB Biswal

Keyword(s):

Research Work ◽

Search Space ◽

Assembly Sequence Planning ◽

Robotic Assembly ◽

Planning Problem ◽

Assembly Sequence ◽

Sequence Planning ◽

Fitness Value ◽

Assembly Sequences ◽

Stability Graph

Assembly sequence planning is one of the multi-model optimization problems, in which more than one objective function has to be optimized at a time to obtain the quality assembly sequence. Moreover obtaining the feasible sequences from the possible finite set of sequences is a difficult task as the assembly sequence planning problem is N-P hard combinatorial problem. To solve the assembly sequence planning problem, researchers have developed various techniques to obtain the optimum solution. The developed methodologies have many drawbacks like struck at local optima, poor performance, huge search space and many more. To overcome these difficulties, the current research work aims to use stability graph to generate stable assembly subsets for obtaining the optimum assembly sequences. In the proposed methodology, to reduce the search space and to obtain the quality assembly sequences, stability graph is considered. Moreover, the fitness of assembly subsets is evaluated according to the user weights at each level before proceeding to the higher levels. Due to this, the higher fitness value subsets are eliminated at each stage by which time of execution will reduce enormously. The proposed methodology has implemented on various industrial products and compared the results with the various well-known algorithms.

Download Full-text

Optimized Robotic Assembly Sequence Using ACO

2009 Fifth International Conference on MEMS NANO, and Smart Systems ◽

10.1109/icmens.2009.38 ◽

2009 ◽

Author(s):

Surjit Sharma ◽

Bibhuti Bhusan Biswal ◽

Parameswar Dash ◽

Bibhuti Bhusan Choudhury

Keyword(s):

Robotic Assembly ◽

Assembly Sequence

Download Full-text

Assembly Modeling for 3D Component Based on Polychromatic Sets

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.411.388 ◽

2011 ◽

Vol 411 ◽

pp. 388-392 ◽

Cited By ~ 3

Author(s):

Yun Long Li ◽

Jian Min Gao ◽

Lei Shi ◽

Song Wang

Keyword(s):

Information Matrix ◽

Spatial Location ◽

Assembly Sequence Planning ◽

Assembly Model ◽

Assembly Sequence ◽

Assembly Modeling ◽

Sequence Planning ◽

Location Modeling ◽

Dynamic Interference

In order to improve the efficiency of assembly modeling and provide a complete assembly model for assembly sequence planning (ASP), a method of assembly modeling based on polychromatic sets (PS) is proposed. Firstly, the assembly information of 3D Component is obtained by API function in SolidWorks. In addition, assembly incident matrix, information matrix and mapping matrix are built. On the basis of these matrixes, a method of location modeling is explored. The interference relation matrix is developed by judging the spatial location and analyzing dynamic interference relation among parts. Finally, a case study is given to verify the method.

Download Full-text

Robotic Assembly Sequence Generation Using Improved Fruit Fly Algorithm

Lecture Notes in Mechanical Engineering - Advances in Materials and Manufacturing Engineering ◽

10.1007/978-981-15-1307-7_26 ◽

2020 ◽

pp. 239-247

Author(s):

Gunji Bala Murali ◽

B. B. V. L. Deepak ◽

Bibhuti Bhusan Biswal ◽

Y. Karun Kumar

Keyword(s):

Fruit Fly ◽

Robotic Assembly ◽

Assembly Sequence ◽

Sequence Generation ◽

Assembly Sequence Generation

Download Full-text

Iteratively Refined Feasibility Checks in Robotic Assembly Sequence Planning

IEEE Robotics and Automation Letters ◽

10.1109/lra.2019.2895845 ◽

2019 ◽

Vol 4 (2) ◽

pp. 1416-1423 ◽

Cited By ~ 4

Author(s):

Ismael Rodriguez ◽

Korbinian Nottensteiner ◽

Daniel Leidner ◽

Michael Kassecker ◽

Freek Stulp ◽

...

Keyword(s):

Assembly Sequence Planning ◽

Robotic Assembly ◽

Assembly Sequence ◽

Sequence Planning

Download Full-text

An Agent Based Optimization Approach to Manufacturing Process Planning

Volume 2A: 27th Design Automation Conference ◽

10.1115/detc2001/dac-21032 ◽

2001 ◽

Author(s):

Saurabh Deshpande ◽

Jonathan Cagan

Keyword(s):

Stochastic Optimization ◽

Process Planning ◽

Manufacturing Process ◽

Optimization Problems ◽

Search Space ◽

Optimization Techniques ◽

Process Models ◽

Optimization Approach ◽

Agent Based ◽

Manufacturing Process Planning

Abstract Many optimization problems, such as manufacturing process planning optimization, are difficult problems due to the large number of potential configurations (process sequences) and associated (process) parameters. In addition, the search space is highly discontinuous and multi-modal. This paper introduces an agent based optimization algorithm that combines stochastic optimization techniques with knowledge based search. The motivation is that such a merging takes advantage of the benefits of stochastic optimization and accelerates the search process using domain knowledge. The result of applying this algorithm to computerized manufacturing process models is presented.

Download Full-text

A novel concatenation method for generating optimal robotic assembly sequences

Proceedings of the Institution of Mechanical Engineers Part C Journal of Mechanical Engineering Science ◽

10.1177/0954406215623813 ◽

2015 ◽

Vol 231 (10) ◽

pp. 1966-1977 ◽

Cited By ~ 13

Author(s):

MVA Raju Bahubalendruni ◽

Bibhuti Bhusan Biswal

Keyword(s):

Computer Aided Design ◽

Cost Effective ◽

High Energy ◽

Robotic Assembly ◽

Computational Time ◽

Assembly Sequence ◽

Design Environment ◽

Assembly Sequences ◽

Computer Aided ◽

Assembly Sequence Generation

Selection of optimized assembly sequence is significantly essential to achieve cost-effective manufacturing process. This paper presents a novel efficient methodology to generate cost-effective feasible robotic assembly sequences though concatenation of parts. Part concatenation process will be followed with liaison predicate test and feasibility predicate test. A unique method called bounding box method is described to test the feasibility predicate efficiently in the computer-aided design environment. Assembly indexing technique is proposed to filter the redundant assembly subsets with high energy in order to minimize the computational time. The cost of collision free assembling operation is considered by the weight and distance traveled by the part in the assembly environment to join with the mating part. The method is successful in finding feasible optimal assembly sequence without ignoring any possible assembly sequence and found to be efficient in solving computer-aided assembly sequence generation. The correctness of the methodology is illustrated with an example.

Download Full-text