Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
On social laws for artificial agent societies
Shoham Y., Tennenholtz M. Artificial Intelligence73 (1-2):231-252,1995.Type:Article
Date Reviewed: Mar 1 1996

Shoham and Tennenholtz have written a most interesting paper, one that may well prove to be seminal. The question they consider is one of distributed artificial intelligence, although the specific application treated is robotics. The question is “How can we make artificial agents cooperate?” Prior work took two approaches, both, Shoham and  Tennenholtz  successfully argue, too extreme. The first is to plan the agents’ behavior fully off-line with a central coordinator making all decisions: in that case, we do not have true agents. The second alternative is to allow agents to behave freely, dealing with all conflicts online as they arise by negotiation between the agents. In the case of robots, typical conflicts include the intersection of “the planned space-time paths of robots,” the removal of “an object needed by one robot…by another,” and bottlenecks.

This contribution adopts a middle-of-the-road strategy: “why not adopt a convention, or, as we’d like to think of it, a social law, according to which each” agent follows procedures that prevent conflicts?

The first part of the paper presents a case study involving mobile robots that follow traffic laws; the paradigmatic situation involves eight conditions (their Traffic Law 2). In addition to elaborating these laws and proving that they succeed in avoiding conflicts, the authors present a comprehensive analysis of their complexity.

The second part of the paper presents “a more general treatment of social laws in a computational setting,” treating the question of how to derive useful social laws for a given (abstract) social system. The authors prove that, in general, finding such a law in a multi-agent system where each agent has n states is NP-complete, but that if the number of transitions that might change a particular state is bounded by O ( log n ) and several additional restrictions apply, the problem becomes polynomial in n.

The paper is not cluttered with excessive mathematical detail, is not too long, and is well written, three desiderata that other papers in the journal often do not meet. More important, the work itself is well done and should prove important--it may be a starting point for much future research.

Reviewer:  Joseph S. Fulda Review #: CR119263 (9603-0211)
Bookmark and Share
  Featured Reviewer  
 
Coherence And Coordination (I.2.11 ... )
 
 
Motion (I.2.10 ... )
 
 
Perceptual Reasoning (I.2.10 ... )
 
 
Robotics (I.2.9 )
 
Would you recommend this review?
yes
no
Other reviews under "Coherence And Coordination": Date
It’s alive!
Cohen F., John Wiley & Sons, Inc., New York, NY, 1994. Type: Book (9780471008606)
Nov 1 1994
Intelligent agents
Wooldridge M. (ed), Jennings N. (ed)  Intelligent agents,Amsterdam, The Netherlands,Aug 8-Aug 9, 1994,1994. Type: Whole Proceedings
May 1 1996
Market-based control
Clearwater S. (ed), World Scientific Publishing Co., Inc., River Edge, NJ, 1996. Type: Book (9789810222543)
Oct 1 1996
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy