A heuristic technique for multi-agent planning

Annals of Mathematics and Artificial Intelligence

Volumn 20, Issue 1-4, 1997, Pages 13-67

  Ephrati, Eithan ^a   Rosenschein, Jeffrey S ^b  

^a BAR ILAN UNIVERSITY   (Israel)

^b HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031503291     PISSN: 10122443     EISSN: None     Source Type: Journal    
DOI: 10.1023/a:1018924209812     Document Type: Article

References (58)

1. M. Boddy and T. Dean, Solving time-dependent planning problems, in: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (Detroit, Michigan, August 1989) pp. 979-984.
2. D. Chapman, Planning for conjunctive goals, Artificial Intelligence 32(3) (July 1987) 333-377.
3. R. Clark, C. Grossner and T. Radhakrishnan, CONSENSUS: a planning protocol for cooperating expert systems, in: Proceedings of the Eleventh International Workshop on Distributed Artificial Intelligence (Glen Arbor, Michigan, February 1992) pp. 77-94.
4. D.D. Corkill, Hierarchical planning in a distributed environment, in: Proceedings of the Sixth International Joint Conference on Artificial Intelligence (Tokyo, August 1979) pp. 168-175.
5. D.D. Corkill, A framework for organizational self-design in distributed problem solving networks, PhD Thesis, University of Massachusetts, Amherst, MA (December 1982).
6. T. Dean and M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference on Artificial Intelligence (Saint Paul, Minnesota, August 1988) pp. 49-54.
7. T. Dean and M. Boddy, An analysis of time-dependent planning, in: Proceedings of the Seventh National Conference on Artificial Intelligence (St. Paul, Minnesota, August 1988) pp. 49-54.
8. J. Doyle and M.P. Wellman, Impediments to universal preference-based default theories, Artificial Intelligence 49(1-3) (1992).
9. E.H. Durfee, A cooperative approach to planning for real-time control, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 277-283.
10. E.H. Durfee, V.R. Lesser and D.D. Corkill, Cooperation through communication in a distributed problem solving network, in: Distributed Artificial Intelligence, ed. M.N. Huhns (Morgan-Kaufmann Publishers, Inc., Los Altos, California, 1987) Chapter 2, pp. 29-58.
11. E. Ephrati, M.E. Pollack and M. Milshtein, A cost-directed planner: preliminary report, in: Proceedings of the Thirteenth National Conference on Artificial Intelligence (Portland, Oregon, August 1996) pp. 1223-1228.
12. E. Ephrati, M.E. Pollack and J.S. Rosenschein, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Working Notes of the AAAI Spring Symposium on Decision-Theoretic Planning (Stanford, CA, March 1994) pp. 90-98.
13. E. Ephrati, M.E. Pollack and S. Ur, Exploitation of decision theory techniques in multi-agent planning (extended abstract), in: Proceedings of The Fourteenth International Joint Conference on Artificial Intelligence (Montreal, Canada, August 1995) pp. 679-685.
14. E. Ephrati and J.S. Rosenschein, The Clarke Tax as a consensus mechanism among automated agents, in: Proceedings of the Ninth National Conference on Artificial Intelligence (Anaheim, California, July 1991) pp. 173-178.
15. E. Ephrati and J.S. Rosenschein, Reaching agreement through partial revelation of preferences, in: Proceedings of the Tenth European Conference on Artificial Intelligence (Vienna, Austria, August 1992) pp. 229-233.
16. E. Ephrati and J.S. Rosenschein, Distributed consensus mechanisms for self-interested heterogeneous agents, in: Proceedings of the First International Conference on Intelligent and Cooperative Information Systems (Rotterdam, The Netherlands, May 1993) pp. 71-79.
17. E. Ephrati and J.S. Rosenschein, Multi-agent planning as a dynamic search for social consensus, in: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (Chambery, France, August 1993) pp. 423-429.
18. E. Ephrati and J.S. Rosenschein, Planning to please: Following another agent's intended plan, Journal of Group Decision and Negotiation 2(3) (1993) 219-235.
19. E. Ephrati and J.S. Rosenschein, Divide and conquer in multi-agent planning, in: Proceedings of the Twelfth National Conference on Artificial Intelligence (Seattle, Washington, July 1994) pp. 375-380.
20. J.J. Finger, Exploiting constraints in design synthesis, PhD Thesis, Stanford University, Stanford, CA (1986).
21. D.E. Foulser, M. Li and Q. Yang, Theory and algorithms for plan merging, Artificial Intelligence 57(2-3) (October 1992) 143-181.
22. M. Georgeff, A theory of action for multi-agent planning, in: Proceedings of the National Conference on Artificial Intelligence (Austin, Texas, August 1984) pp. 121-125.
23. M.L. Ginsberg, Approximate planning (extended abstract), in: Proceedings of the Second International Conference on AI Planning Systems (Chicago, Illinois, June 1994) pp. 68-73.
24. P. Haddawy and S. Hanks, Issues in decision-theoretic planning: Symbolic goals and numeric utilities, in: Proceedings of the 1990 DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control (November 1990) pp. 48-58.
25. S. Hanks and R.J. Firby, Issues and architectures for planning and execution, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 59-70.
26. K. Kanazawa and T. Dean, A model for projection and action, in: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (1989) pp. 985-990.
27. M.J. Katz and J.S. Rosenschein, Verifying plans for multiple agents, Journal of Experimental and Theoretical Artificial Intelligence 5 (1993) 39-56.
28. R.E. Korf, Planning as search: A quantitative approach, Artificial Intelligence 33 (1987) 65-88.
29. S. Kraus, Agents contracting tasks in non-collaborative environments, in: Proceedings of the Eleventh National Conference on Artificial Intelligence (1993) pp. 243-248.
30. S. Kraus, M. Nirkhe and D. Perils, Deadline-coupled real-time planning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 100-108.
31. S. Kraus, J. Wilkenfeld and G. Zlotkin, Multi-agent negotiation under time constraints, Computer Science Technical Report Series CS-TR-2975, University of Maryland, College Park, Maryland (October 1992).
32. B. Krulwich, Planning for soft goals, in: Proceedings of the First International Conference on Artificial Intelligence Planning Systems (College Park, Maryland, November 1992) pp. 289-292.
33. A.L. Lansky, Localized search for controlling automated reasoning, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 115-125.
34. A.L. Lansky and D.S. Fogelsong, Localized representation and planning methods for parallel domains, in: Proceedings of the Sixth National Conference on Artificial Intelligence (Seattle, Washington, July 1987) pp. 240-245.
35. D. McAllester and D. Rosenblitt, Systematic nonlinear planning, in: Proceedings of the Ninth National Conference on Artificial Intelligence (Anaheim, California, July 1991) pp. 634-639.
36. D. McDermott, Planning and acting, Cognitive Science 2 (1978) 71-109.
37. S. Minton, J. Bresina and M. Drummond, Commitment strategies in planning: A comparative analysis, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (August 1991) pp. 259-265.
38. T. Moehlman and V. Lesser, Cooperative planning and decentralized negotiation in Multi-Fireboss Phoenix, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 144-159.
39. D.S. Nau, Q. Yang and J. Hendler, Optimization of multiple-goal plans with limited interaction, in: Proceedings of the Workshop on Innovative Approaches to Planning, Scheduling and Control (San Diego, California, November 1990) pp. 160-165.
40. E.P.D. Pednault, Formulating multi-agent dynamic-world problems in the classical planning framework, in: Reasoning about Actions and Plans: Proceedings of the 1986 Workshop, eds. M.P. Georgeff and A.L. Lansky (Morgan-Kaufmann, San Matheo, CA, 1987) pp. 47-82.
41. J. Penberthy and D. Weld, UCPOP: A sound, complete, partial order planner for ADL, in: Proceedings of the Third International Conference on Knowledge Representation and Reasoning (Cambridge, MA, 1992) pp. 103-114.
42. R.P. Pope, S.E. Conry and R. A. Mayer, Distributing the planning process in a dynamic environment, in: Proceedings of the Eleventh International Workshop on Distributed Artificial Intelligence (Glen Arbor, Michigan, February 1992) pp. 317-331.
43. J. Rawls, A Theory of Justice (Belknap, Cambridge, MA, 1971).
44. J.S. Rosenschein, Synchronization of multi-agent plans, in: Proceedings of the National Conference on Artificial Intelligence (Pittsburgh, Pennsylvania, August 1982) pp. 115-119.
45. J.S. Rosenschein and M.R. Genesereth, Deals among rational agents, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (Los Angeles, August 1985) pp. 91-99.
46. R.G. Smith, A framework for problem solving in a distributed processing environment, PhD Thesis, Stanford University (1978).
47. R.G. Smith, The contract net protocol: High-level communication and control in a distributed problem solver, IEEE Transactions on Computers C-29(12) (December 1980) 1104-1113.
48. Ch.J. Stuart, An implementation of a multi-agent plan synchronizer, in: Proceedings of the Ninth International Joint Conference on Artificial Intelligence (Los Angeles, California, 1985) pp. 1031-1035.
49. G.J. Sussman, A Computational Model of Skill Acquisition (American Elsevier, New York, 1975).
50. M. Veloso and J. Blythe, Linkability: Examining casual link commitments in partial-order planning, in: Proceedings of the Second International Conference on AI Planning Systems (Chicago, Illinois, June 1994) pp. 170-175.
51. W. Vickrey, Counterspeculation, auctions and competitive sealed tenders, Journal of Finance 16 (1961) 8-37.
52. M.P. Wellman, Dominance and subsumption in constraint-posting planning, in: Proceedings of the Tenth International Joint Conference on Artificial Intelligence (Milan, Italy, August 1987) pp. 884-889.
53. M.P. Wellman and J. Doyle, The preferential semantics for goals, in: Proceedings of the Ninth National Conference on Artificial Intelligence (Anaheim, California, July 1991) pp. 698-703.
54. M.P. Wellman, A general equilibrium approach to distributed transportation planning, in: Proceedings of the Tenth National Conference on Artificial Intelligence (San Jose, California, July 1992) pp. 282-289.
55. Q. Yang, A theory of conflict resolution in planning, Artificial Intelligence 58(1-3) (December 1992) 361-393.
56. Q. Yang, D.S. Nau and J. Hendler, Merging separately generated plans with restricted interactions, Computational Intelligence 8(2) (February 1992) 648-676.
57. S. Zilberstein and S.J. Russell, Efficient resource-bounded reasoning in AT-RALPH, in: Artificial Intelligence Planning Systems: Proceedings of the First International Conference (College Park, Maryland, June 1992) pp. 260-266.
58. G. Zlotkin and J.S. Rosenschein, A domain theory for task oriented negotiation, in: Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence (Chambery, France, August 1993) pp. 417-422.