Integrated Multi-Robotic Assembly Planning for Improved Productivity

2011 ◽  
Vol 383-390 ◽  
pp. 6357-6362
Author(s):  
B.B. Choudhury ◽  
Bibhuti Bhusan Biswal

In product assembly, optimized sequence is a prerequisite for automated systems. The assembly process can be optimized through appropriate selection and allocation of the given tasks in a multi-device framework. These two discrete tasks need to be integrated to produce the optimum result and a cost effective system to cope with the needs of the system, the present work attempts to generate an automatic assembly sequence and seeks for optimal allocation of tasks amongst the available robots. Further, an effective task allocation approach considers the capabilities of the deployable robots. This paper presents an integrated approach for assembly sequence generation and task allocation for multi-robot systems by considering their capability in terms of time and space. An example of a 21 part drive assembly is given to illustrate the concept and procedure of the proposed methodology.

Author(s):  
MVA Raju Bahubalendruni ◽  
Bibhuti Bhusan Biswal

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.


2002 ◽  
Vol 2 ◽  
pp. 1254-1266
Author(s):  
Ekko van Ierland ◽  
Corjan Brink ◽  
Leen Hordijk ◽  
Carolien Kroeze

Environmental economics deals with the optimal allocation of production factors and correcting market failure in protecting the environment. Market failure occurs because of externalities, common property resources, and public goods. Environmental policy instruments include direct regulation, taxes/subsidies, tradable permits, deposit systems, voluntary agreements, and persuasion.Environmental policies usually focus on one pollutant or environmental issue but may have substantial impacts on other emissions and environmental problems. Neglecting these impacts will result in suboptimal policies. We present an integrated optimisation model for determining cost-effective strategies to simultaneously reduce emissions of several pollutants from several sources, allowing for interrelations between sources and abatement options. Our integrated approach in regard to acidifying compounds and greenhouse gases will be able to provide cost-effective policy options that will result in lower overall abatement costs.This paper shows that efficient emission reduction can be calculated, but we argue that, for transboundary air pollution and climate change, it is difficult to implement the socially optimal solution because strong incentives exist for “free-riding”. In order to implement efficient policies, international environmental agree-ments like the Gothenburg or the Kyoto Protocol are necessary to establish stable coalitions. The stability of these agreements depends on the distribution of costs and benefits over countries and on the redistribution of the gains of cooperation.


Author(s):  
MVA Raju Bahubalendruni ◽  
Bibhuti Bhusan Biswal

Sequence of feasible mechanical assembly operations plays significant role in overall cost optimisation process for manufacturing industry and thus great importance is given to assembly sequence generation from past four decades. Though achieving at least one feasible sequence is focused in the earlier stages of research, the introduction of soft computing techniques attracted the industrial engineers towards cost-effective, optimised assembly sequences to attain economical manufacturing process. The integration of assembly sequence generation methods with computer aided design environment ensures more correctness and flexibility to automate the process. In this paper, a detailed review on various methods, their applications and limitations is presented and well discussed.


Author(s):  
Bibhuti Bhusan Biswal ◽  
Sujit Kumar Pattanayak ◽  
Rabindra Narayan Mohapatra ◽  
Pramod Kumar Parida ◽  
Panchanand Jha

Automated assembly using robots is being gainfully used to enhance the process capabilities in the manufacturing world because of the fact that it is faster, more efficient, precise and cost effective process than any conventional mechanized process. However in assembly operations it is essential to determine the assembly sequence that is feasible, stable and faster so that an economical process can be evolved. Since robotic system is a cost intensive one it is necessary to find out the correct and optimal sequence with the constraints of the process in mind while dealing with assembled products with large number of parts. One of the most critical situations is to detect the best assembly sequence for products having large number of different alternative solutions. In this paper, a new methodology has been developed to find out the best robotic assembly sequence among the feasible robotic sequences. The feasible robotic assembly sequences have been generated based on the assembly constraints and later, the Artificial Immune System (AIS) has been implemented to find out the best assembly sequence.


2016 ◽  
Vol 2016 (0) ◽  
pp. 407
Author(s):  
Ojiro Nakano ◽  
Takuya Kozaki ◽  
Shoji Maruo ◽  
Takashi Maekawa ◽  
Yusuke Maeda

Author(s):  
Xue Yan ◽  
P. Gu

Abstract Automatic generation of product assembly sequence is essential for robotic assembly task planning. In this paper, a graph-based heuristic approach is presented for assembly sequence planning. A product is represented in feature-based product model. A liaison graph is then formed based on assembly relations among components. The liaison graph is split into two or more pieces by removing the cutvertex from the graph. The pieces may also be split again until basic graph(bi-connected graph) are found. The basic graphs are considered as sub-assemblies. The disassembly sequence for each sub-assembly is determined. The disassembly sequences are then merged to generate a complete disassembly sequence for the product. Finally, the assembly sequence is defined by reversing the complete disassembly sequence.


Sign in / Sign up

Export Citation Format

Share Document