Neural network approach for a robot task sequencing problem

Artificial Intelligence in Engineering

Volumn 14, Issue 2, 2000, Pages 175-189

  Maimon, O ^a   Braha, D ^b   Seth, V ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^c BOSTON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INDUSTRIAL ROBOTS; LEARNING ALGORITHMS; PARALLEL PROCESSING SYSTEMS; TRAVELING SALESMAN PROBLEM;

ROBOT TASK SEQUENCING;

RECURRENT NEURAL NETWORKS;

EID: 0034171577     PISSN: 09541810     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0954-1810(00)00008-X     Document Type: Article

References (38)

1. Coombs C.F. Printed circuits handbook. 1988;McGraw-Hill, New York.
2. Ratliff H.D., Rosenthal A.S. Order-picking in a rectangular warehouse: a solvable case of the traveling salesman problem. Operations Research. 31:(3):1983;507-521.
3. Maimon O. The robot task-sequencing planning problem. IEEE Transactions on Robotics and Automation. 6:(6):1990;760-765.
4. De Fazio TL, Whitney DE. Simplified generation of all mechanical assembly sequences. IEEE Journal of Robotics and Automation 1987;RA-3 (6).
5. Kapitanovski A., Maimon O. Robot programming system for assembly: conceptual graph-based approach. Journal of Intelligent and Robotic Systems. 8:1993;35-62.
6. Garey M.R., Johnson D.S. Computers and intractability: a guide to the NP-completeness. 1979;Freeman, San Francisco.
7. Fausett L. Fundamentals of neural networks: architectures, algorithms, and applications. 1994;Prentice Hall, Englewood Cliffs, NJ.
8. Carpaneto G., Toth P. Some new branching and bounding criteria for the asymmetric traveling salesman problem. Management Science. 26:(7):1980;736-743.
9. Syslo M.M., Deo N., Kowalik J.S. Discrete optimization algorithms: with pascal programs. 1983;Prentice-Hall, Englewood Cliffs, NJ.
10. Miller D.L., Pekny J.F. Exact solution of large asymmetric traveling salesman problems. Science. 251:1991;754-761.
11. Balas E., Christofides N. A restricted lagrangean approach to the traveling salesman problem. Mathematical Programming. 21:1981;19-46.
12. Ascheuer N., Escudero L.F., Grotschel M., Stoer M. A Cutting plane approach to the sequential ordering problem (with application to job scheduling in manufacturing). SIAM Journal of Optimization. 3:(1):1993;25-42.
13. Edan Y., Flash T., Peiper U.M., Shmullevich I., Sarig Y. Near-minimum-time task planning for fruit-picking robots. IEEE Transactions on Robotics and Automation. 7:(1):1991;48-55.
14. Askin R.G., Stanridge C.R. Modeling and analysis of manufacturing systems. 1993;Wiley, New York.
15. Han M.-H., McGinnis L.F., Shieh J.S., White J.A. On sequencing retrievals in an automated storage/retrieval system. IIE Transactions. 19:1987;56-66.
16. Chow W.-M. An analysis of automated storage and retrieval in manufacturing assembly lines. IIE Transactions. 6:1986;204-213.
17. Egbelu P.J., Tanchoco J.M.A. Characterization of automated vehicle dispatching rules. International Journal of Production Research. 22:1984;359-374.
18. Jog P., Jung Y.S., Gucht D.V. Parallel genetic algorithms applied to the travelling salesman problem. SIAM Journal on Optimization. 1991;515-529.
19. Grefenstette JJ, Gopal R, Rosamita B, Van Gucht D. Genetic algorithms for the travelling salesman problem. Proceedings of an International Conference on Genetic Algorithms and Their Applications. Pittsburgh: Carnegie-Mellon University, 1985.
20. Storer R.H., Wu S.D., Vaccari R. New search spaces for sequencing problems with applications to job shop scheduling. Management Science. 38:1992;1495-1509.
21. Tate D.M., Tunasar C., Smith A.E. Genetically improved presequences for euclidean travelling salesman problems. Mathematical and Computer Modeling. 20:(2):1994;135-143.
22. Chen C-J., Tseng C-S. The path and location planning of workpieces by genetic algorithms. Journal of Intelligent Manufacturing. 7:1996;69-76.
23. Hopfield J.J., Tank D.W. Neural computation of decisions in optimization problems. Biological Cybernetics. 52:1985;141-152.
24. Hopfield J.J., Tank D.W. Computing with neural circuits: a model. Science. 8:1986;625-633.
25. Wilson V., Pawley G.S. On the stability of the tsp problem algorithm of hopfield and tank. Biological Cybernetics. 58:1988;63-70.
26. Durbin R., Wilshaw D.J. An analog approach to the traveling salesman problem using an elastic net method. Nature. 326:1987;689-691.
27. Szu H. 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. Proceedings of the ICNN-88. 1988;259-266.
28. Hegde S.U., Sweet J.L., Levy W.B. Determination of parameters in a hopfield/tank computational network. Proceedings of the ICNN. II:1998;291-298.
29. Aiyer VB, Niranjan M, Fallside F. A theoretical investigation into the performance of the Hopfield model. IEEE Transactions on Neural Networks 1990;1(2).
30. Abe S. Global convergence and suppression of spurious states of the Hopfield neural networks. IEEE Transactions on Circuit and Systems-I: Fundamental Theory and Applications 1993;20(4).
31. Abe S. Global Convergence of the Hopfield Neural Network with Non-zero Diagonal Elements. Submitted for publication.
32. Wacholder E., Han J., Mann R.C. A neural network algorithm for the multiple traveling salesman problem. Biological Cybernetics. 61:1989;11-19.
33. Cohen M.A., Grossberg S. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Transactions on Systems, Man and Cybernetics. SMC-13:1983;815-826.
34. Hopfield J.J. Neurons with graded response have collective computational properties like those of two-state neurons. Proceedings of the National Academy of Science. 81:1984;3088-3092.
35. Platt JC, Barr AH. Constrained differential optimization. Proceedings of the IEEE, NIPS Conference, 1987.
36. Wang J. A parallel distributed processor for the quadratic assignment problem. Proceedings of the INNC 90. 1:1990;278-281.
37. Angeniol B., de La Croix Vaubois G., Le Texier J.Y. Self-organizing feature maps and the traveling salesman problem. Neural Network. 1:1988;289-293.
38. Fort J.C. Solving a combinatorial problem via self-organizing process: an application of the Kohonen algorithm to the traveling salesman problem. Biological Cybernetics. 59:1988;33-40.