A bio-soft computing approach to re-arrange a flexible manufacturing robot

Authors:
Rohani Binti Abu Bakar;Junzo Watada
Affiliations:
Graduate School of Information, Production and Systems, Waseda University, Kitakyushu-Shi, Fukuoka-Ken, Japan;Graduate School of Information, Production and Systems, Waseda University, Kitakyushu-Shi, Fukuoka-Ken, Japan
Venue:
KES'07/WIRN'07 Proceedings of the 11th international conference, KES 2007 and XVII Italian workshop on neural networks conference on Knowledge-based intelligent information and engineering systems: Part III
Year:
2007

Citing 4
Cited 0

Molecular computation of solutions to combinatorial problems

Science
DNA Computing Model for the Minimum Spanning Tree Problem

SYNASC '06 Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Bio-soft computing with fixed-length DNA to a group control optimization problem

Soft Computing - A Fusion of Foundations, Methodologies and Applications - Special issue on BISCSE 2005 " Forging the Frontiers" Part II
On the design of intelligent robotic agents for assembly

Information Sciences: an International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new model inspired from DNA bio-chemical procedures to rearrange a robot in a flexible manufacturing system to assemble different products. In a bio-chemical wet laboratory, DNA process can provide powerful massive parallelism with energy efficiency in overall search of all possible solutions. These characteristics are useful especially when dealing with a complex calculation e.g. an NP hard problem such as to a scheduling task in production line. We present a detailed algorithm and illustrate how the essential procedure for scheduling problem is realized through a DNA computing mechanism. Some experiments were conducted to show the performance of the proposed approach.