A neural network approach for a robot task sequencing problem

Abstract This paper presents a neural network approach with successful implementation for the robot task-sequencing problem. The problem addresses the sequencing of tasks comprising loading and unloading of parts into and from the machines by a material-handling robot. The performance criterion is to minimize a weighted objective of the total robot travel time for a set of tasks and the tardiness of the tasks being sequenced. A three-phased parallel implementation of the neural network algorithm on Thinking Machine's CM-5 parallel computer is also presented which resulted in a dramatic increase in the speed of finding solutions. To evaluate the performance of the neural network approach, a branch-and-bound method and a heuristic procedure have been developed for the problem. The neural network method is shown to give good results and is especially useful for solving large problems on a parallel-computing platform.

[1]  H. Szu,et al.  Fast TSP algorithm based on binary neuron output and analog neuron input using the zero-diagonal interconnect matrix and necessary and sufficient constraints of the permutation matrix , 1988, IEEE 1988 International Conference on Neural Networks.

[2]  J. Hopfield,et al.  Computing with neural circuits: a model. , 1986, Science.

[3]  David M. Tate,et al.  Genetically improved presequences for euclidean traveling salesman problems , 1994 .

[4]  J J Hopfield,et al.  Neurons with graded response have collective computational properties like those of two-state neurons. , 1984, Proceedings of the National Academy of Sciences of the United States of America.

[5]  Donald L. Miller,et al.  Exact Solution of Large Asymmetric Traveling Salesman Problems , 1991, Science.

[6]  John C. Platt,et al.  Constrained Differential Optimization , 1987, NIPS.

[7]  Shigeo Abe.  Global convergence and suppression of spurious states of the Hopfield neural networks , 1991, [Proceedings] 1991 IEEE International Joint Conference on Neural Networks.

[8]  Oded Maimon,et al.  The robot task-sequencing planning problem , 1990, IEEE Trans. Robotics Autom..

[9]  H. D. Ratliff,et al.  Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem , 1983, Oper. Res..

[10]  Martin Grötschel,et al.  A Cutting Plane Approach to the Sequential Ordering Problem (with Applications to Job Scheduling in Manufacturing) , 1993, SIAM J. Optim..

[11]  We-Min Chow,et al.  An Analysis of Automated Storage and Retrieval Systems in Manufacturing Assembly Lines , 1986 .

[12]  Yael Edan,et al.  Near-minimum-time task planning for fruit-picking robots , 1991, IEEE Trans. Robotics Autom..

[13]  Oded Maimon,et al.  Robot programming system for assembly: Conceptual graph-based approach , 1993, J. Intell. Robotic Syst..

[14]  Mahesan Niranjan,et al.  A theoretical investigation into the performance of the Hopfield model , 1990, IEEE Trans. Neural Networks.

[15]  Egon Balas,et al.  A restricted Lagrangean approach to the traveling salesman problem , 1981, Math. Program..

[16]  Bernard Angéniol,et al.  Self-organizing feature maps and the travelling salesman problem , 1988, Neural Networks.

[17]  Sweet.  Determination of parameters in a Hopfield/Tank computational network , 1988 .

[18]  Laurene V. Fausett,et al.  Fundamentals Of Neural Networks , 1994 .

[19]  Thomas L. DeFazio,et al.  Simplified generation of all mechanical assembly sequences , 1987, IEEE Journal on Robotics and Automation.

[20]  Stephen Grossberg,et al.  Absolute stability of global pattern formation and parallel memory storage by competitive neural networks , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[21]  Ching-Shiow Tseng,et al.  The path and location planning of workpieces by genetic algorithms , 1996, J. Intell. Manuf..

[22]  William B. Levy,et al.  Determination of parameters in a Hopfield/Tank computational network , 1988, IEEE 1988 International Conference on Neural Networks.

[23]  Richard Durbin,et al.  An analogue approach to the travelling salesman problem using an elastic net method , 1987, Nature.

[24]  S. Abe,et al.  Global convergence of the Hopfield neural network with nonzero diagonal elements , 1995 .

[25]  Leon F. McGinnis,et al.  On Sequencing Retrievals In An Automated Storage/Retrieval System , 1987 .

[26]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[27]  Dirk Van Gucht,et al.  Parallel Genetic Algorithms Applied to the Traveling Salesman Problem , 1991, SIAM J. Optim..

[28]  Pius J. Egbelu,et al.  Characterization of automatic guided vehicle dispatching rules , 1984 .

[29]  P. Toth,et al.  Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem , 1980 .

[30]  LarrañagaP.,et al.  Genetic Algorithms for the Travelling Salesman Problem , 1999 .

[31]  R. Storer,et al.  New search spaces for sequencing problems with application to job shop scheduling , 1992 .