Skip to main content
SpringerLink
Log in

Reducing disclosed dependencies in privacy preserving planning

  • Published:
Autonomous Agents and Multi-Agent Systems Aims and scope Submit manuscript

Abstract

In collaborative privacy preserving planning (cppp), a group of agents jointly creates a plan to achieve a set of goals while preserving each others’ privacy. In state of the art cppp algorithms, the agents avoid explicitly sharing the value of private state variables. However, they may implicitly reveal dependencies between actions, that is, which action facilitates achieving the preconditions of another action. Previous work in cppp did not limit the disclosure of such dependencies. In this paper, we explicitly limit the amount of disclosed dependencies, allowing agents to publish only some of the dependencies between their actions. We investigate different strategies for deciding which dependencies to publish, and how they affect the ability to find solutions. We evaluate the ability of two solvers — distribute forward search and centralized planning based on a single-agent projection — to produce plans under this constraint. Experiments over standard cppp domains show that the proposed dependency-sharing strategies enable generating plans while sharing only a small fraction of all dependencies.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5

Similar content being viewed by others

References

  1. Borrajo, D., & Fernandez, S. (2015). Mapr and cmap. In Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP-15), Jerusalem (Israel).‏

  2. Brafman, R. I. (2015). A privacy preserving algorithm for multi-agent planning and search. In Twenty-Fourth International Joint Conference on Artificial Intelligence.‏

  3. Brafman, R. I., & Domshlak, C. (2008). From One to Many: Planning for Loosely Coupled Multi-Agent Systems. In ICAPS (Vol. 8, pp. 28–35).‏

  4. Brafman, R. I., & Domshlak, C. (2013). On the complexity of planning for agent teams and its implications for single agent planning. Artificial Intelligence, 198, 52–71.

    Article  MathSciNet  MATH  Google Scholar 

  5. Caspari, P., Mattmuller, R., & Schulte, T. (2020). A framework to prove strong privacy in multi-agent planning. In Distributed and multi-agent planning (DMAP) workshop at ICAPS.

  6. Eriksson, S., Röger, G., & Helmert, M. (2017). Unsolvability certificates for classical planning. In Twenty-seventh international conference on automated planning and scheduling.

  7. Eriksson S., Röger G., & Helmert, M. (2018). A proof system for unsolvable planning tasks. In Proceedings of the international conference on automated planning and scheduling, (Vol. 28).

  8. Gerevini, A. E., Lipovetzky, N., Peli, N., Percassi, F., Saetti, A., & Serina, I. (2019). Novelty messages filtering for multi agent privacy-preserving planning. In Twelfth annual symposium on combinatorial search.

  9. Hoffmann, J. (2001). FF: The fast-forward planning system. AI Magazine, 22(3), 57.

    Google Scholar 

  10. Lipovetzky, N., Muise, C., & Geffner, H. (2016). Traps, invariants, and dead-ends. In Twenty-Sixth international conference on automated planning and scheduling.

  11. Luis, N., & Borrajo, D. (2014). Plan merging by reuse for multi-agent planning. In DMAP–ICAPS.

  12. Maheswaran, R. T., Pearce, J. P., Bowring, E., Varakantham, P., & Tambe, M. (2006). Privacy loss in distributed constraint reasoning: A quantitative framework for analysis and its applications. JAAMAS, 13(1), 27–60.

    Google Scholar 

  13. Maliah, S., Shani, G., & Stern, R. (2015). Privacy preserving pattern databases. In DMAP–ICAPS, (Vol. 15, pp. 9–17).

  14. Maliah, S., Brafman, R. I., & Shani, G. (2016). Increased privacy with reduced communication and computation in multi-agent planning. In DMAP–ICAPS, (Vol. 16, pp. 106–112).

  15. Maliah, S., Shani, G., & Stern, R. (2016). Stronger privacy preserving projections for multi-agent planning. In ICAPS, (pp. 221–229).

  16. Maliah, S., Shani, G., & Stern, R. (2016). Stronger privacy preserving projections for multi-agent planning. In The international conference on automated planning and scheduling (ICAPS), (pp. 221–229).

  17. Maliah, S., Shani, G., & Stern, R. (2018). Action dependencies in privacy-preserving multi-agent planning. Autonomous Agents and Multi-Agent Systems, 32(6), 779–821.

    Article  Google Scholar 

  18. Nissim, R., & Brafman, R. I. (2014). Distributed heuristic forward search for multi-agent planning. JAIR, 51, 293–332.

    Article  MathSciNet  MATH  Google Scholar 

  19. Štolba, M., & Komenda, A. (2017). The madla planner: Multi-agent planning by combination of distributed and local heuristic search. Artificial Intelligence, 252, 175–210.

    Article  MathSciNet  MATH  Google Scholar 

  20. Štolba, M., Komenda, A., & Kovacs, D. L. (2015). Competition of distributed and multiagent planners (codmap). The international planning competition (WIPC-15), (pp. 24).

  21. Stolba, M., Tozicka, J., & Komenda, A. (2016). Secure multi-agent planning algorithms. In ECAI, (pp. 1714–1715).

  22. Štolba, M., Tožička, J., & Komenda, A. (2018). Quantifying privacy leakage in multi-agent planning. ACM Transactions on Internet Technology (TOIT), 18(3), 1–21.

    Article  Google Scholar 

  23. Stolba, M., Fiser, D., & Komenda, A. (2019). Privacy leakage of search-based multi-agent planning algorithms. In J. Benton, N. Lipovetzky, E. Onaindia, D. E. Smith, & S. Srivastava (Eds.), Proceedings of the twenty-ninth international conference on automated planning and scheduling, (pp. 482–490). Berkeley: ICAPS. (AAAI Press).

  24. Torralba, A. (2016). Sympa: Symbolic perimeter abstractions for proving unsolvability. UIPC 2016 planner abstracts, (pp. 8–11).

  25. Torreno, A., Onaindia, E., & Sapena, O. (2014). FMAP: Distributed cooperative multi-agent planning. Applied Intelligence, 41(2), 606–626.

    Article  Google Scholar 

  26. Torreño, A., Onaindia, E., Komenda, A., & Štolba, M. (2017). Cooperative multi-agent planning: A survey. ACM Computing Surveys, 50(6), 1–32.

    Article  Google Scholar 

  27. Tožička, J., Štolba, M., & Komenda, A. (2017). The limits of strong privacy preserving multi-agent planning. In Twenty-Seventh International Conference on Automated Planning and Scheduling.‏

  28. Unsolvability IPC. (2016). Unsolvability international planning competition. https://unsolve-ipc.eng.unimelb.edu.au/.

  29. Van Der Krogt, R. (2009). Quantifying privacy in multiagent planning. Multiagent and Grid Systems, 5(4), 451–469.

    Article  MATH  Google Scholar 

Download references

Acknowledgements

This work is partially funded by ISF Grant # 210/17 to Roni Stern and by ISF Grant # 1210/18 to Guy Shani.

Author information

Authors and Affiliations

  1. Software and Information Systems Engineering, Ben Gurion University of the Negev, Be’er Sheva, Israel

    Rotem Lev Lehman, Guy Shani & Roni Stern

  2. Palo Alto Research Center, Palo Alto, CA, USA

    Roni Stern

Authors
  1. Rotem Lev Lehman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Guy Shani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Roni Stern
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rotem Lev Lehman.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lev Lehman, R., Shani, G. & Stern, R. Reducing disclosed dependencies in privacy preserving planning. Auton Agent Multi-Agent Syst 36, 52 (2022). https://doi.org/10.1007/s10458-022-09581-7

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10458-022-09581-7

Keywords

Search

Navigation