Determination of Social Laws for Multi-Agent Mobilization

Abstract In previous work on artificial social systems, social laws for multi-agent mobilization were handcrafted for particular network structures. In this work, we introduce an algorithm for the automatic synthesis of social laws for multi-agent mobilization in any 2-connected graph environment. We introduce the notion of a graph routing and show that the problem of computing a useful social law can be reduced to that of finding a routing in a graph. Then we show that any given 2-connected graph has a routing which can be efficiently constructed, yielding the desired social law for multi-agent mobilization on the given graph.

[1]  Jeffrey S. Rosenschein,et al.  Cooperation without Communication , 1986, AAAI.

[2]  Moshe Tennenholtz,et al.  On Cooperation in a Multi-Entity Model , 1989, IJCAI.

[3]  Moshe Tennenholtz,et al.  Artificial Social Systems , 1992, Lecture Notes in Computer Science.

[4]  Diane J. Cook,et al.  Flexible Social Laws , 1995, IJCAI.

[5]  David Sinriech,et al.  Network design models for discrete material flow systems: A literature review , 1995 .

[6]  Elwood S. Buffa,et al.  Graph Theory with Applications , 1977 .

[7]  David D. Grossman.  Traffic control of multiple robot vehicles , 1988, IEEE J. Robotics Autom..

[8]  Peter Kleinschmidt,et al.  On the diameter of convex polytopes , 1992, Discret. Math..

[9]  Shmuel Onn,et al.  Geometry, Complexity, and Combinatorics of Permutation Polytopes , 1993, J. Comb. Theory A.

[10]  Michel Deza,et al.  Lattice-free polytopes and their diameter , 1995, Discret. Comput. Geom..

[11]  J. A. Bondy,et al.  Graph Theory with Applications , 1978 .

[12]  Moshe Tennenholtz,et al.  On the Automatic Synthesis of Social Laws for Mobile Robots. A Study in Artificial Social Systems , 1997, Comput. Artif. Intell..

[13]  Sarit Kraus,et al.  The Function of Time in Cooperative Negotiations , 1990, AAAI.

[14]  Stephen J. Buckley,et al.  Fast motion planning for multiple moving robots , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[15]  Yoram Moses,et al.  Knowledge and Common Knowledge in a Byzantine Environment I: Crash Failures , 1986, TARK.

[16]  Alan H. Bond,et al.  Readings in Distributed Artificial Intelligence , 1988 .

[17]  Robert E. Tarjan,et al.  Augmentation Problems , 1976, SIAM J. Comput..

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

[19]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[20]  Moshe Tennenholtz,et al.  On Social Laws for Artificial Agent Societies: Off-Line Design , 1995, Artif. Intell..

[21]  Moshe Tennenholtz,et al.  On the Synthesis of Useful Social Laws for Artificial Agent Societies (Preliminary Report) , 1992, AAAI.

[22]  Moshe Tennenholtz,et al.  On traffic laws for mobile robots , 1992 .

[23]  Jean-Claude Latombe.  How to move (physically speaking) in a multi-agent world (abstract) , 1991, SIGO.

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

[25]  AMY L. LANSKY,et al.  Localized event‐based reasoning for multiagent domain 1 , 1988, Comput. Intell..

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