Abstract
Experiments over a variety of optimization problems indicate that scale-effective convergence is an emergent behavior of certain computer-based agents, provided these agents are organized into an asynchronous team (A-Team). An A-Team is a problem-solving architecture in which the agents are autonomous and cooperate by modifying one another's trial solutions. These solutions circulate continually. Convergence is said to occur if and when a persistent solution appears. Convergence is said to be scale-effective if the quality of the persistent solution increases with the number of agents, and the speed of its appearance increases with the number of computers. This paper uses a traveling salesman problem to illustrate scale-effective behavior and develops Markov models that explain its occurrence in A-Teams, particularly, how autonomous agents, without strategic planning or centralized coordination, can converge to solutions of arbitrarily high quality. The models also perdict two properties that remain to be experimentally confirmed:
• construction and destruction are dual processes. In other words, adept destruction can compensate for inept construction in an A-Team, and vice-versa. (Construction refers to the process of creating or changing solutions, destruction, to the process of erasing solutions.)
• solution quality is independent of agent-phylum. In other words, A-Teams provide an organizational framework in which humans and autonomous mechanical agents can cooperate effectively.
Similar content being viewed by others
References
Avila-Abascal, P. and S.N. Talukdar. (1996). “Cooperative Algorithms and Abductive Causal Networks for the Automatic Generation of Intelligent Substation Alarm Processors,” Proceedings of ISCAS-96.
Chen, C.L. (1992). “Bayesian Nets and A-Teams for Power System Fault Diagnosis.” Ph.D. dissertation, Electrical and Computer Engineering Department, Carnegie Mellon University, Pittsburgh, PA.
Chen, S.Y., S.N. Talukdar, and N.M. Sadeh. (1993). “Job-Shop-Scheduling by a Team of Asynchronous Agents,” IJCAI-93 Workshop on Knowledge-Based Production, Scheduling and Control, Chambery, France.
de Souza, P. (1993). “Asynchronous Organizations for Multi-Algorithm Problems.” Ph.D. dissertation, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA.
de Souza, P.S. and S.N. Talukdar. (1991). “Genetic Algorithms in Asynchronous Teams.” Proceedings of the Fourth International Conference on Genetic Algorithms. Los Altos, CA: Morgan Kaufmann.
Glover, F. (1989/1990). “Tabu Search-Parts I and II,” ORSA Journal of Computing1(3) and 2(1).
Gorti, S.R., S. Humair, R.D. Sriram, S. Talukdar, and S. Murthy. (1996). “Solving Constraint Satisfaction Problems using ATeams,” Artificial Intelligence for Engineering Design, Analysis and Manufacturing10, 1-19.
Grotschel, M. (1984). “Polyedrische Kombinatorik and Schnittebenverfahren.” Preprint No. 38, Universitat Augsburg.
Handbook of Genetic Algorithms. (1991). In L. Davis (ed.), Van Nostrand Reinhold.
Held, M. and R.M. Karp. (1970). “The Traveling-Salesman Problem and Minimum Spanning Trees,” Operations Research18, 1138-1162.
Johnson, D.S. (1990). “Local Optimization and the Traveling Salesman Problem.” Lectures in Computer Science, Automata, Languages in Programming, 17th Int. Coll., Springer-Verlag, Vol. 443.
Johnson, D.S. and L.A. MacGeoch. (1996). The Traveling Salesman Problem: A Case Study in Local Optimization.” In E.H. Aarts and J.K. Lenstra (eds.), New York: Wiley and Sons.
Kao, J.H., J.S. Hemmerle, and F.P. Prinz. (1995). “Asynchronous-Teams-Based Collision Avoidance in PAWS.” EDRC Report, Carnegie Mellon University.
Kerr, A., Jr. (1955). Subacute Bacterial Endocardites. Springfield, IL: Charles C. Thomas.
Kirkpatrick, S., C.D. Gelatt, and M.P. Cecchi (1983). “Optimization by Simulated Annealing,” Science220 (4598).
Krolak, P. and W. Felts. (1971). “A Man-Machine Approach Toward Solving the Traveling Salesman Problem,” Communications of the ACM14(5).
Lee, H., S. Murthy, W. Haider, and D. Morse. (1995). “Primary Production Scheduling at Steel making Industries.” IBM Report.
Lin, S. and B.W. Kernighan. (1973). “An Effective Heuristic Algorithm for the Traveling-Salesman Problem,” Operations Research21, 498-516.
Lukin, J.A., A.P. Gove, S.N. Talukdar, and C. Ho. (1997). “Automated Probabilistic Method for Assigning Backbone Resonances of (13C,15N)-Labelled Proteins,” Journal of Biomolecular NMR9.
Mak, K. and A. Morton. (1992). “A Modified Lin-Kernighan Traveling Salesman Heuristic,” ORSA Journal on Computing13, 127.
Martin, O., S.W. Otto, and E.W. Felten. (1991). “Large-Step Markov Chains for the Traveling Salesman Problem,” Complex Systems(5), 299-326.
Murthy, S. (1992). “Synergy in Cooperating Agents: Designing Manipulators from Task Specifications.” Ph.D. dissertation, Department of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA.
Nii, H.P. (1986). “Blackboard Systems: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures, Parts I and II,” Al Magazine7(2/3).
Oster, G.F. and E.O. Wilson. (1978). Caste and Ecology in the Social Insects. Princeton Princeton, NJ: University Press.
Padberg, M. and G. Rinaldi. (1987). “Optimization of a 532-city Symmetric Traveling Salesman Problem,” Operations Research Letters6(1).
Padberg, M. and G. Rinaldi. (1991). “A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems,” SIAM Review33(1), 60-100.
Pugh, S. (1990). Total Design. Addison Wesley.
Quadrel, R.W. (1991). “Asynchronous Design Environments: Architecture and Behavior.” Ph.D. dissertation, Department of Architecture, Carnegie Mellon University, Pittsburgh, PA.
Rachlin, J., F. Wu, S. Murthy, S. Talukdar, M. Sturzenbecker, R. Akkiraju, R. Fuhrer, A. Aggarwal, J. Yeh, R. Henry, and R. Jayaraman. (1996). “Forest View: ASystem For Integrated Scheduling In Complex Manufacturing Domains.” IBM Report.
Rego, C. (1996). “Relaxed Tours and Path Ejections for the Traveling Salesman Problem,” European Journal of Operational Research, to appear.
Talukdar, S.N. and P.S. de Souza. (1994). “Insects, Fish and Computer-Based Super-Agents.” Systems and Control Theory for Power Systems. In Chow, Kokotovic and Thomas (eds.), Vol. 64 of the Institute of Mathematics and its Applications, Springer-Verlag.
Talukdar, S.N., S.S. Pyo, and T. Giras. (1983). “Asynchronous Procedures for Parallel Processing,” IEEE Trans.on PASPAS-102(11).
Talukdar, S.N. and V.C. Ramesh. (1994). “A Multi-Agent Technique for Contingency Constrained Optimal Power Flows.” Proceedings of the Power Industry Computer Applications Conference (PICA-93), Phoenix, May 1993, IEEE Trans. on Power Systems9(2), 855-861.
Tsen, C.K. (1995). “Solving Train Scheduling Problems Using A-Teams.” Ph.D. dissertation, Electrical and Computer Engineering Department, CMU, Pittsburgh, PA.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Talukdar, S., Baerentzen, L., Gove, A. et al. Asynchronous Teams: Cooperation Schemes for Autonomous Agents. Journal of Heuristics 4, 295–321 (1998). https://doi.org/10.1023/A:1009669824615
Issue Date:
DOI: https://doi.org/10.1023/A:1009669824615