Automated Verification of Social Law Robustness in STRIPS

Agents operating in a multi-agent environment must consider not just their own actions, but also those of the other agents in the system. Artificial social systems are a well known means for coordinating a set of agents, without requiring centralized planning or online negotiation between agents. Artificial social systems enact a social law which restricts the agents from performing some actions under some circumstances. A good social law prevents the agents from interfering with each other, but does not prevent them from achieving their goals. However, designing good social laws, or even checking whether a proposed social law is good, are hard questions. In this paper, we take a first step towards automating these processes, by formulating criteria for good social laws in a multi-agent planning framework. We then describe an automated technique for verifying if a proposed social law meets these criteria, based on a compilation to classical planning.

[1]  Matthias Klusch,et al.  Intelligent Information Agents: Agent-Based Information Discovery and Management on the Internet , 1999 .

[2]  Jörg Hoffmann,et al.  "Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability , 2014, ECAI.

[3]  Michael Luck,et al.  Understanding Agent Systems , 2001, Springer Series on Agent Technology.

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

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

[6]  Barbara Messing,et al.  An Introduction to MultiAgent Systems , 2002, Künstliche Intell..

[7]  S. Rosenschein,et al.  On social laws for artificial agent societies: off-line design , 1996 .

[8]  Tim Miller,et al.  Leveraging FOND Planning Technology to Solve Multi-Agent Planning Problems , 2015 .

[9]  Michal Stolba,et al.  The International Competition of Distributed and Multiagent Planners (CoDMAP) , 2016, AI Mag..

[10]  Christian Muise,et al.  Unplannability IPC Track , 2015 .

[11]  Christer Bäckström,et al.  Fast Detection of Unsolvable Planning Instances Using Local Consistency , 2013, SOCS.

[12]  Erez Karpas,et al.  Goal Recognition Design , 2014, ICAPS.

[13]  Victor R. Lesser,et al.  A survey of multi-agent organizational paradigms , 2004, The Knowledge Engineering Review.

[14]  Bernhard Nebel,et al.  The FF Planning System: Fast Plan Generation Through Heuristic Search , 2011, J. Artif. Intell. Res..

[15]  Moshe Tennenholtz,et al.  On Traffic Laws for Mobile Robots (Extended Abstract) , 1992 .

[16]  Michal Stolba,et al.  Competition of Distributed and Multiagent Planners (CoDMAP) , 2016, AAAI.

[17]  Erez Karpas,et al.  Goal Recognition Design for Non-Optimal Agents , 2015, AAAI.

[18]  Erez Karpas,et al.  Goal Recognition Design with Non-Observable Actions , 2016, AAAI.

[19]  Álvaro Torralba.  SymPA : Symbolic Perimeter Abstractions for Proving Unsolvability , 2016 .

[20]  Ronen I. Brafman,et al.  From One to Many: Planning for Loosely Coupled Multi-Agent Systems , 2008, ICAPS.

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

[22]  Richard Fikes,et al.  STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving , 1971, IJCAI.

[23]  Yoav Shoham,et al.  Multiagent Systems - Algorithmic, Game-Theoretic, and Logical Foundations , 2009 .

[24]  Jörg Hoffmann,et al.  MS-Unsat and SimulationDominance : Merge-and-Shrink and Dominance Pruning for Proving Unsolvability , 2016 .

[25]  Jendrik Seipp,et al.  Fast Downward Aidos , 2016 .