Abstract
Multi-agent planning using MA-STRIPS–related models is often motivated by the preservation of private information. Such a motivation is not only natural for multi-agent systems but also is one of the main reasons multi-agent planning problems cannot be solved with a centralized approach. Although the motivation is common in the literature, the formal treatment of privacy is often missing. In this article, we expand on a privacy measure based on information leakage introduced in previous work, where the leaked information is measured in terms of transition systems represented by the public part of the problem with regard to the information obtained during the planning process. Moreover, we present a general approach to computing privacy leakage of search-based multi-agent planners by utilizing search-tree reconstruction and classification of leaked superfluous information about the applicability of actions. Finally, we present an analysis of the privacy leakage of two well-known algorithms—multi-agent forward search (MAFS) and Secure-MAFS—both in general and on a particular example. The results of the analysis show that Secure-MAFS leaks less information than MAFS.
- Ronen I. Brafman. 2015. A privacy preserving algorithm for multi-agent planning and search. In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI’15). 1530--1536. Google Scholar
Digital Library
- Ronen I. Brafman and Carmel Domshlak. 2008. From one to many: Planning for loosely coupled multi-agent systems. In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS’08). 28--35. Google Scholar
Digital Library
- Christelle Braun, Konstantinos Chatzikokolakis, and Catuscia Palamidessi. 2009. Quantitative notions of leakage for one-try attacks. Electrical Notes in Theoretical Computer Science 249, 75--91. Google Scholar
Digital Library
- Boi Faltings, Thomas Léauté, and Adrian Petcu. 2008. Privacy guarantees through distributed constraint satisfaction. In Proceedings of the International Conference on Intelligent Agent Technology. 350--358. Google Scholar
Digital Library
- Rachel Greenstadt, Jonathan P. Pearce, and Milind Tambe. 2006. Analysis of privacy loss in distributed constraint optimization. In Proceedings of the 21st National Conference on Artificial Intelligence (AAAI’06). 647--653. Google Scholar
Digital Library
- Patrik Haslum and Hector Geffner. 2000. Admissible heuristics for optimal planning. In Proceedings of the 5th International Conference on Artificial Intelligence (ICAPS’00). 140--149. http://www.aaai.org/Library/AIPS/2000/aips00-015.php. Google Scholar
Digital Library
- Shlomi Maliah, Guy Shani, and Ronen Brafman. 2016a. Online macro generation for privacy preserving planning. In Proceedings of the 26th International Conference on Automated Planning and Scheduling. Google Scholar
Digital Library
- Shlomi Maliah, Guy Shani, and Roni Stern. 2016b. Collaborative privacy preserving multi-agent planning. Autonomous Agents and Multi-Agent Systems 31, 3, 493--530. Google Scholar
Digital Library
- Raz Nissim and Ronen I. Brafman. 2012. Multi-agent A* for parallel and distributed systems. In Proceedings of the International Conference on Autonomous Agents and Multiagent Systems (AAMAS’12). 1265--1266. Google Scholar
Digital Library
- Raz Nissim and Ronen I. Brafman. 2014. Distributed heuristic forward search for multi-agent planning. Journal of Artificial Intelligence Research 51, 293--332. Google Scholar
Cross Ref
- Geoffrey Smith. 2009. On the foundations of quantitative information flow. In Proceedings of the 12th International Conference on Foundations of Software Science and Computational Structures. 288--302.Google Scholar
Cross Ref
- Michal Štolba, Jan Tožička, and Antonín Komenda. 2016a. Secure multi-agent planning. In Proceedings of the 1st International Workshop on AI for Privacy and Security. ACM, New York, NY, 11. Google Scholar
Digital Library
- Michal Štolba, Jan Tožička, and Antonín Komenda. 2016b. Secure multi-agent planning algorithms. In Proceedings of the 22nd European Conference on Artificial Intelligence (ECAI’16). 1714--1715.Google Scholar
- Alejandro Torreño, Eva Onaindia, and Oscar Sapena. 2014. FMAP: Distributed cooperative multi-agent planning. Applied Intelligence 41, 2, 606--626. Google Scholar
Digital Library
- Jan Tožička, Jan Jakubův, Antonín Komenda, and Michal Pěchouček. 2015. Privacy-concerned multiagent planning. Knowledge and Information Systems 48, 3, 581--618. Google Scholar
Digital Library
- Roman Van Der Krogt. 2009. Quantifying privacy in multiagent planning. Multiagent and Grid Systems 5, 4, 451--469. Google Scholar
Digital Library
- Andrew C. Yao. 1982. Protocols for secure computations. In Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (SFCS’82). 160--164. Google Scholar
Digital Library
Index Terms
Quantifying Privacy Leakage in Multi-Agent Planning
Recommendations
Multi-agent planning by plan reuse
AAMAS '13: Proceedings of the 2013 international conference on Autonomous agents and multi-agent systemsGenerating plans for a single agent has been shown to be a difficult task. If we generalize to a multi-agent setting, the problem becomes exponentially harder in general. The centralized approach where a plan is jointly generated for all agents is only ...
Collaborative privacy preserving multi-agent planning
In many cases several entities, such as commercial companies, need to work together towards the achievement of joint goals, while hiding certain private information. To collaborate effectively, some sort of plan is needed to coordinate the different ...
Plan merging by reuse for multi-agent planning
AbstractMulti-Agent Planning deals with the task of generating a plan for/by a set of agents that jointly solve a planning problem. One of the biggest challenges is how to handle interactions arising from agents’ actions. The first contribution of the ...






Comments