Flexible social laws

  • Authors:
  • Will Briggs;Diane Cook

  • Affiliations:
  • Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX;Department of Computer Science and Engineering, University of Texas at Arlington, Arlington, TX

  • Venue:
  • IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
  • Year:
  • 1995

Quantified Score

Hi-index 0.00

Visualization

Abstract

Although communication is generally considered to dominate over processing cost in distributed systems, the problem of communication cost in multiagent planning has not been sufficiently addressed. One method for reducing both communication cost and planning time is the use of social laws. Social laws, however, can be too restrictive, limiting soundness. Flexible social laws can enable multiagent systems to reap the benefits of reduced communication cost and planning time (except in the worst case), without limiting soundness (although optimality may be degraded). By analyzing the performance, we show that this model can make multiagent planning exponentially more efficient without limiting its applicability.