Asynchronous Teams: Cooperation Schemes for Autonomous Agents

Journal of Heuristics

Volumn 4, Issue 4, 1998, Pages 295-321

  Talukdar, Sarosh ^a   Baerentzen, Lars ^a   Gove, Andrew ^a   De Souza, Pedro ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Autonomous agents; Cooperation; Multi agent systems; Optimization

Indexed keywords

COMPUTER APPLICATIONS; CONSTRAINT THEORY; GENETIC ALGORITHMS; MARKOV PROCESSES; OPTIMIZATION; PROBLEM SOLVING; SIMULATED ANNEALING;

ASYNCHRONOUS TEAMS; AUTONOMOUS AGENTS; COOPERATION; MULTI AGENT SYSTEMS; TABU SEARCH;

TRAVELING SALESMAN PROBLEM;

EID: 0032294890     PISSN: 13811231     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1009669824615     Document Type: Article

References (34)

1. 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.
2. 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.
3. 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.
4. de Souza, P. (1993). "Asynchronous Organizations for Multi-Algorithm Problems." Ph.D. dissertation, Dept. of Electrical and Computer Engineering, Carnegie Mellon University, Pittsburgh, PA.
5. 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.
6. Glover, F. (1989/1990). "Tabu Search - Parts I and II," ORSA Journal of Computing 1(3) and 2(1).
7. 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 Manufacturing 10, 1-19.
8. Grotschel, M. (1984). "Polyedrische Kombinatorik and Schnittebenverfahren." Preprint No. 38, Universitat Augsburg.
9. Handbook of Genetic Algorithms. (1991). In L. Davis (ed.), Van Nostrand Reinhold.
10. Held, M. and R.M. Karp. (1970). "The Traveling-Salesman Problem and Minimum Spanning Trees," Operations Research 18, 1138-1162.
11. 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.
12. 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.
13. Kao, J.H., J.S. Hemmerle, and F.P. Prinz. (1995). "Asynchronous-Teams-Based Collision Avoidance in PAWS." EDRC Report, Carnegie Mellon University.
14. Kerr, A., Jr. (1955). Subacute Bacterial Endocardites. Springfield, IL: Charles C. Thomas.
15. Kirkpatrick, S., C.D. Gelatt, and M.P. Cecchi (1983). "Optimization by Simulated Annealing," Science 220 (4598).
16. Krolak, P. and W. Felts. (1971). "A Man-Machine Approach Toward Solving the Traveling Salesman Problem," Communications of the ACM 14(5).
17. Lee, H., S. Murthy, W. Haider, and D. Morse. (1995). "Primary Production Scheduling at Steel making Industries." IBM Report.
18. Lin, S. and B.W. Kernighan. (1973). "An Effective Heuristic Algorithm for the Traveling-Salesman Problem," Operations Research 21, 498-516.
19. 15N)-Labelled Proteins," Journal of Biomolecular NMR 9.
20. Mak, K. and A. Morton. (1992). "A Modified Lin-Kernighan Traveling Salesman Heuristic," ORSA Journal on Computing 13, 127.
21. Martin, O., S.W. Otto, and E.W Felten. (1991)."Large-Step Markov Chains for the Traveling Salesman Problem," Complex Systems (5), 299-326.
22. 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.
23. Nii, H.P. (1986). "Blackboard Systems: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures, Parts I and II," Al Magazine 7(2/3).
24. Oster, G.F. and E.O. Wilson. (1978). Caste and Ecology in the Social Insects. Princeton Princeton, NJ: University Press.
25. Padberg, M. and G. Rinaldi. (1987). "Optimization of a 532-city Symmetric Traveling Salesman Problem," Operations Research Letters 6(1).
26. Padberg, M. and G. Rinaldi. (1991). "A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems," SIAM Review 33(1), 60-100.
27. Pugh, S. (1990). Total Design. Addison Wesley.
28. Quadrel, R.W. (1991). "Asynchronous Design Environments: Architecture and Behavior." Ph.D. dissertation, Department of Architecture, Carnegie Mellon University, Pittsburgh, PA.
29. 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: A System For Integrated Scheduling In Complex Manufacturing Domains." IBM Report.
30. Rego, C. (1996). "Relaxed Tours and Path Ejections for the Traveling Salesman Problem," European Journal of Operational Research, to appear.
31. 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.
32. Talukdar, S.N., S.S. Pyo, and T. Giras. (1983). "Asynchronous Procedures for Parallel Processing," IEEE Trans. on PAS PAS-102(11).
33. 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 Systems 9(2), 855-861.
34. Tsen, C.K. (1995). "Solving Train Scheduling Problems Using A-Teams." Ph.D. dissertation, Electrical and Computer Engineering Department, CMU, Pittsburgh, PA.