A Heuristic Technique for Multiagent PlanningEithan

The subject of multi-agent planning has been of continuing concern in Distributed Artiicial Intelligence (DAI). In this paper, we suggest an approach to multi-agent planning that contains heuristic elements. Our method makes use of subgoals, and derived sub-plans, to construct a global plan. Agents solve their individual sub-plans, which are then merged into a global plan. The suggested approach reduces overall planning time and derives a plan that approximates the optimal global plan that would have been derived by a central planner, given those original subgoals. We explore three diierent scenarios. The rst involves a group of agents with a common goal. The second considers how agents can interleave planning and execution when planning towards a common, though dynamic, goal. The third examines the case where agents, each with their own goal, can plan together to reach a state in consensus for the group. Finally, we consider how these approaches can be adapted to handle rational, ma-nipulative agents.

[1]  William Vickrey,et al.  Counterspeculation, Auctions, And Competitive Sealed Tenders , 1961 .

[2]  Gerald J. Sussman,et al.  A Computational Model of Skill Acquisition , 1973 .

[3]  Reid G. Smith,et al.  A framework for problem solving in a distributed processing environment , 1978 .

[4]  Drew McDermott,et al.  Planning and Acting , 1978, Cogn. Sci..

[5]  Daniel D. Corkill,et al.  Hierarchical Planning in a Distributed Environment , 1979, IJCAI.

[6]  Reid G. Smith,et al.  The Contract Net Protocol: High-Level Communication and Control in a Distributed Problem Solver , 1980, IEEE Transactions on Computers.

[7]  Jeffrey S. Rosenschein,et al.  Synchronization of Multi-Agent Plans , 1982, AAAI.

[8]  Daniel D. Corkill,et al.  A framework for organizational self-design in distributed problem solving networks , 1983 .

[9]  Michael P. Georgeff,et al.  Communication and interaction in multi-agent planning , 1983, AAAI 1983.

[10]  Christopher Stuart,et al.  An Implementation of a Multi-Agent Plan Synchronizer , 1985, IJCAI.

[11]  Jeffrey S. Rosenschein,et al.  Deals Among Rational Agents , 1985, IJCAI.

[12]  Amy L. Lansky,et al.  Localized Representation and Planning Methods for Parallel Domains , 1987, AAAI.

[13]  Richard E. Korf,et al.  Planning as Search: A Quantitative Approach , 1987, Artif. Intell..

[14]  Edwin P. D. Pednault,et al.  FORMULATING MULTIAGENT, DYNAMIC-WORLD PROBLEMS IN THE CLASSICAL PLANNING FRAMEWORK , 1987 .

[15]  Edmund H. Durfee,et al.  Cooperation through communication in a distributed problem-solving network , 1990 .

[16]  David Chapman,et al.  Planning for Conjunctive Goals , 1987, Artif. Intell..

[17]  J. Finger,et al.  Exploiting constraints in design synthesis , 1987 .

[18]  Michael P. Wellman.  Dominance and Subsumption in Constraint-Posting Planning , 1987, IJCAI.

[19]  Mark S. Boddy,et al.  An Analysis of Time-Dependent Planning , 1988, AAAI.

[20]  Thomas L. Dean,et al.  A Model for Projection and Action , 1989, IJCAI.

[21]  Jon Doyle,et al.  Impediments to Universal Preference-Based Default Theories , 1989, KR.

[22]  Mark S. Boddy,et al.  Solving Time-Dependent Planning Problems , 1989, IJCAI.

[23]  Amy L. Lansky,et al.  Localized Search for Controlling Automated Reasoning , 1990 .

[24]  James A. Hendler,et al.  Optimization of multiple-goal plans with limited interaction , 1990 .

[25]  David A. McAllester,et al.  Systematic Nonlinear Planning , 1991, AAAI.

[26]  Jon Doyle,et al.  Preferential Semantics for Goals , 1991, AAAI.

[27]  Steven Minton,et al.  Commitment Strategies in Planning: A Comparative Analysis , 1991, IJCAI.

[28]  Eithan Ephrati,et al.  The Clarke Tax as a Consensus Mechanism Among Automated Agents , 1991, AAAI.

[29]  James A. Hendler,et al.  MERGING SEPARATELY GENERATED PLANS WITH RESTRICTED INTERACTIONS , 1992, Comput. Intell..

[30]  P. Yang.  A Theory of Con ict Resolution in , 1992 .

[31]  Shlomo Zilberstein,et al.  Efficient resource-bounded reasoning in AT-RALPH , 1992 .

[32]  Richard Clark.  Consensus : a planning protocol for cooperating expert systems , 1992 .

[33]  Daniel S. Weld,et al.  UCPOP: A Sound, Complete, Partial Order Planner for ADL , 1992, KR.

[34]  Eithan Ephrati,et al.  Reaching Agreement through Partial Revelation of Preferences , 1992, ECAI.

[35]  Michael P. Wellman.  A General-Equilibrium Approach to Distributed Transportation Planning , 1992, AAAI.

[36]  Qiang Yang,et al.  Theory and Algorithms for Plan Merging , 1992, Artif. Intell..

[37]  Bruce Krulwich.  Planning for soft goals , 1992 .

[38]  Eithan Ephrati,et al.  Multi-Agent Planning as a Dynamic Search for Social Consensus , 1993, IJCAI.

[39]  Sarit Kraus,et al.  Agents Contracting Tasks in Non-Collaborative Environments , 1993, AAAI.

[40]  Matthew J. Katz,et al.  Verifying plans for multiple agents , 1993, J. Exp. Theor. Artif. Intell..

[41]  Eithan Ephrati,et al.  Planning to please: Following another agent's intended plan , 1993 .

[42]  Jeffrey S. Rosenschein,et al.  A Domain Theory for Task Oriented Negotiation , 1993, IJCAI.

[43]  Eithan Ephrati,et al.  Distributed consensus mechanisms for self-interested heterogeneous agents , 1993, [1993] Proceedings International Conference on Intelligent and Cooperative Information Systems.

[44]  Eithan Ephrati,et al.  Divide and Conquer in Multi-Agent Planning , 1994, AAAI.

[45]  Matthew L. Ginsberg.  Approximate Planning (Extended Abstract) , 1994, AIPS.

[46]  Manuela M. Veloso,et al.  Linkability: Examining Causal Link Commitments in Partial-order Planning , 1994, AIPS.

[47]  Sarit Kraus,et al.  Multiagent Negotiation under Time Constraints , 1995, Artif. Intell..