A privacy-preserving model for multi-agent propositional planning

Abstract Over the last years, the planning community has formalised several models and approaches to multi-agent (MA) propositional planning. One of the main motivations in MA planning is that some or all agents have private knowledge that cannot be communicated to other agents during the planning process and the plan execution. We argue that the existing models of the multi-agent planning task do not maintain the agents’ privacy when a (strict) subset of the involved agents share confidential knowledge, or when the identity/existence of at least one agent is confidential. In this paper, first we propose a model of the MA-planning tasks that preserves the privacy of the involved agents when this happens. Then we investigate an algorithm based on best first search for our model that uses some new heuristics providing a trade-off between accuracy and agents’ privacy. Finally, an experimental study compares the effectiveness of using the proposed heuristics.

[1]  Ronen I. Brafman,et al.  Distributed Heuristic Forward Search for Multi-agent Planning , 2014, J. Artif. Intell. Res..

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

[3]  Michal Stolba,et al.  Relaxation Heuristics for Multiagent Planning , 2014, ICAPS.

[4]  Eva Onaindia,et al.  Global Heuristics for Distributed Cooperative Multi-Agent Planning , 2015, ICAPS.

[5]  Michal Stolba,et al.  Admissible Landmark Heuristic for Multi-Agent Planning , 2015, ICAPS.

[6]  Ivan Serina,et al.  A Privacy-preserving Model for the Multi-agent Propositional Planning Problem , 2014, ECAI.

[7]  Ronen I. Brafman,et al.  Multi-agent A* for parallel and distributed systems , 2012, AAMAS.

[8]  Eva Onaindia,et al.  FMAP: Distributed cooperative multi-agent planning , 2014, Applied Intelligence.

[9]  Shlomi Maliah,et al.  Stronger Privacy Preserving Projections for Multi-Agent Planning , 2016, ICAPS.

[10]  Michal Stolba,et al.  Quantifying Privacy Leakage in Multi-Agent Planning , 2018, ACM Trans. Internet Techn..

[11]  Shlomi Maliah,et al.  Privacy Preserving Landmark Detection , 2014, ECAI.

[12]  Michal Stolba,et al.  The Limits of Strong Privacy Preserving Multi-Agent Planning , 2017, ICAPS.

[13]  Ronen I. Brafman,et al.  Cost-Optimal Planning by Self-Interested Agents , 2013, AAAI.

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

[15]  Eva Onaindia,et al.  An approach to multi-agent planning with incomplete information , 2012, ECAI.

[16]  Michal Stolba,et al.  Potential Heuristics for Multi-Agent Planning , 2016, ICAPS.

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