Abstract
In previous research, we defined, classified, and solved the robotic assembly plan problem for a single assembly robot. In this paper, we formulate this problem for the case of multiple, cooperating assembly robots. The problem now includes the allocation of assembly tasks among multiple robots.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E. and Christophides, N., A restricted lagrangean approach to the traveling salesman problem,Mathematical Programming 21, 19–36 (1981).
Bellmore, M. and Hong, S., Transformation of the multisalesmen problem to the standard travelling salesman problem,J. ACM 21, 500–504 (1974).
Berenguer, X., A characterization of linear admissible transformations for them-traveling salesmen problem,Eur. J. Oper. Res. 3, 323–249 (1979).
Branco, and Coelho, The Hamiltonianp-median problem, unpublished manuscript (1987).
Sellers, C.J. and Nof, S.Y., Part kitting in robotic facilities,Material Flow 3, 163–174 (1986).
Cooper, L., Location-allocation problems,Oper. Res. 11, 331–343 (1963).
Drezner, Z., Thep-center problem — heuristic and optimal algorithms,J. Oper. Res. Soc. 35, 741–748 (1984).
Drezner, Z. and Nof, S.Y., On optimizing bin picking and insertion plans for assembly robots,IIE Trans. 16, 262–270 (1984).
Fox, K.R., Gavish, B., and Graves, S.C., Ann-constraint formulation of the (time dependent) traveling salesman problem,Oper. Res. 28, 1018–1020 (1980).
Hauker, S.J.,et al., Multiple robotic manipulators,Byte 203–219 (1, 1986).
Hong, S. and Padberg, M.W., A note on the symmetric multiple traveling salesman problem with fixed charges,Oper. Res. 25, 871–874 (1977).
Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., (eds.),The Traveling Salesman Problem, Wiley-Interscience, Chichester (1985).
Lee, B.H. and Lee, C.S.G., Collision-free motion planning of two robots,IEEE Trans. Systems. Man Cybernet. Jan. 1987.
Lenstra, J.K. and Rinnooy Kan, A.H.G., A characterization of linear admissible transformations for them-traveling salesman problem: A result of Berenguer,Eur. J. Oper. Res. 3, 250–252 (1979).
Litke, J.D., An improved solution to the traveling salesman problem with thousands of nodes,Comm. ACM 27, 1227–1236 (1984).
Love, R.F. and Juel, H., Properties and solution methods for large location allocation problems,J. Oper. Res. Society 33, 443–452 (1982).
Maimon, O.Z. and Nof, S.Y., Coordination of robots sharing assembly tasks,ASME Trans. J. Dynam. Systems Meas. Control 107, 299–307 (1985).
Maimon, O.Z. and Nof, S.Y., Analysis of multi-robot systems,IIE Trans. 18, 226–234 (1986).
Miller, C.E., Tucker, A.W., and Zemlin, R.A., Integer programming formulations and traveling salesman problems,J. ACM 7, 326–327 (1960).
Murty, K.G., An algorithm for ranking all assignments in order of increasing cost,Oper. Res. 16, 682–687 (1968).
Nof, S.Y. and Drezner, Z., Part flow in the robotic assembly plan problem,Material Flow 3 197–205 (1986).
Nof, S.Y. and Hanna, D., A study of multi-robot workstations with process and resource sharing,Proc. 9th International Conference on Production Research, Cincinnati, Ohio, August 1987.
Nof, S.Y., Robot Ergonomics: optimizing robot work, Ch. 30 inHandbook of Industrial Robotics, Wiley, New York (1985).
Rao, M.R., A note on multiple traveling salesmen problem,Oper. Res. 28, 628–632 (1980).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Nof, S.Y., Drezner, Z. The multiple-robot assembly plan problem. J Intell Robot Syst 7, 57–71 (1993). https://doi.org/10.1007/BF01258212
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01258212