Novelty Messages Filtering for Multi Agent Privacy-preserving Planning

In multi-agent planning, agents jointly compute a plan that achieves mutual goals, keeping certain information private to the individual agents. Agents' coordination is achieved through the transmission of messages. These messages can be a source of privacy leakage as they can permit a malicious agent to collect information about other agents' actions and search states. In this paper, we investigate the usage of novelty techniques in the context of (decentralised) multi-agent privacy-preserving planning, addressing the challenges related to the agents' privacy and performance. In particular, we show that the use of novelty based techniques can significantly reduce the number of messages transmitted among agents, better preserving their privacy and improving their performance. An experimental study analyses the effectiveness of our techniques and compares them with the state-of-the-art. Finally, we evaluate the robustness of our approach, considering different delays in the transmission of messages as they would occur in overloaded networks, due for example to massive attacks or critical situations.

[1]  Ronen I. Brafman,et al.  A Privacy Preserving Algorithm for Multi-Agent Planning and Search , 2015, IJCAI.

[2]  Christian Muise,et al.  MAP-LAPKT: Omnipotent Multi-Agent Planning via Compilation to Classical Planning , 2015 .

[3]  Danna Zhou,et al.  d. , 1934, Microbial pathogenesis.

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

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

[6]  Hector Geffner,et al.  Best-First Width Search: Exploration and Exploitation in Classical Planning , 2017, AAAI.

[7]  Ivan Serina,et al.  A privacy-preserving model for multi-agent propositional planning , 2018, J. Exp. Theor. Artif. Intell..

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

[9]  C. Martin 2015 , 2015, Les 25 ans de l’OMC: Une rétrospective en photos.

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

[11]  Ivan Serina,et al.  Iterative Width Search for Multi Agent Privacy-Preserving Planning , 2018, AI*IA.

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

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

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

[15]  Andrei M. Sukhov,et al.  What type of distribution for packet delay in a global network should be used in the control theory? , 2009, ArXiv.

[16]  Ivan Serina,et al.  Best-First Width Search for Multi Agent Privacy-preserving Planning , 2019, ICAPS.

[17]  Shlomi Maliah,et al.  Increased Privacy with Reduced Communication in Multi-Agent Planning , 2017, ICAPS.

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

[19]  Dawn Xiaodong Song,et al.  Privacy-Preserving Set Operations , 2005, CRYPTO.