A heuristic technique for multi‐agent planning

  • Eithan Ephrati
  • Jeffrey S. Rosenschein
Article

DOI: 10.1023/A:1018924209812

Cite this article as:
Ephrati, E. & Rosenschein, J.S. Annals of Mathematics and Artificial Intelligence (1997) 20: 13. doi:10.1023/A:1018924209812

Abstract

The subject of multi‐agent planning has been of continuing concern in Distributed Artificial 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 different scenarios. The first 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, manipulative agents.

Copyright information

© Kluwer Academic Publishers 1997

Authors and Affiliations

  • Eithan Ephrati
    • 1
  • Jeffrey S. Rosenschein
    • 2
  1. 1.Department of Mathematics and Computer ScienceBar Ilan UniversityRamat GanIsrael
  2. 2.Institute of Computer ScienceThe Hebrew UniversityJerusalemIsrael

Personalised recommendations