A General Approach to Distributed and Privacy-Preserving Heuristic Computation

  • Michal ŠtolbaEmail author
  • Michaela Urbanovská
  • Daniel Fišer
  • Antonín Komenda
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11978)


Multi-agent planning (MAP) has recently gained traction in both planning and multi-agent system communities, especially with the focus on privacy-preserving multi-agent planning, where multiple agents plan for a common goal but with private information they do not want to disclose. Heuristic search is the dominant technique used in MAP and therefore it is not surprising that a significant attention has been paid to distributed heuristic computation, either with or without the concern for privacy. Nevertheless, most of the distributed heuristic computation approaches published so far are ad-hoc algorithms tailored for the particular heuristic. In this work we present a general, privacy-preserving, and admissible approach to distributed heuristic computation. Our approach is based on an adaptation of the technique of cost partitioning which has been successfully applied in optimal classical planning. We present the general approach, a particular implementation, and an experimental evaluation showing that the presented approach is competitive with the state of the art while having the additional benefits of generality and privacy preservation.



This research was supported by the Czech Science Foundation (grant no. 18-24965Y). The authors acknowledge the support of the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16_019/0000765 “Research Center for Informatics”.


  1. 1.
    Brafman, R.I.: A privacy preserving algorithm for multi-agent planning and search. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI, pp. 1530–1536 (2015)Google Scholar
  2. 2.
    Dreier, J., Kerschbaum, F.: Practical privacy-preserving multiparty linear programming based on problem transformation. In: Proceedings of IEEE 3rd International Conference on Privacy, Security, Risk and Trust (PASSAT) and IEEE 3rd Third Inernational Conference on Social Computing (SocialCom), pp. 916–924 (2011)Google Scholar
  3. 3.
    Fišer, D., Štolba, M., Komenda, A.: MAPlan. In: Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP-2015), pp. 8–10 (2015)Google Scholar
  4. 4.
    Helmert, M., Domshlak, C.: Landmarks, critical paths and abstractions: what’s the difference anyway? In: Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS), pp. 162–169 (2009)Google Scholar
  5. 5.
    Karpas, E., Domshlak, C.: Cost-optimal planning with landmarks. In: IJCAI, pp. 1728–1733 (2009)Google Scholar
  6. 6.
    Karpas, E., Katz, M., Markovitch, S.: When optimal is just not good enough: learning fast informative action cost partitionings. In: ICAPS (2011)Google Scholar
  7. 7.
    Katz, M., Domshlak, C.: Implicit abstraction heuristics. J. Artif. Intell. Res. 39, 51–126 (2010)CrossRefGoogle Scholar
  8. 8.
    Katz, M., Domshlak, C.: Optimal admissible composition of abstraction heuristics. Artif. Intell. 174(12–13), 767–798 (2010)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Komenda, A., Stolba, M., Kovacs, D.L.: The international competition of distributed and multiagent planners (CoDMAP). AI Mag. 37(3), 109–115 (2016)CrossRefGoogle Scholar
  10. 10.
    Maliah, S., Brafman, R.I., Shani, G.: Privacy preserving LAMA. In: Proceedings of the 4th Workshop on Distributed and Multi-Agent Planning, DMAP-ICAPS 2016, pp. 1–5 (2016)Google Scholar
  11. 11.
    Mangasarian, O.L.: Privacy-preserving linear programming. Opt. Lett. 5(1), 165–172 (2011)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Nissim, R., Brafman, R.I.: Multi-agent A* for parallel and distributed systems. In: Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems (AAMAS 2012), pp. 1265–1266 (2012)Google Scholar
  13. 13.
    Nissim, R., Brafman, R.I.: Distributed heuristic forward search for multi-agent planning. J. Artif. Intell. Res. 51, 293–332 (2014)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Pommerening, F., Helmert, M., Röger, G., Seipp, J.: From non-negative to general operator cost partitioning: Proof details. Technical Report CS-2014-005, University of Basel, Department of Mathematics and Computer Science (2014)Google Scholar
  15. 15.
    Seipp, J., Keller, T., Helmert, M.: A comparison of cost partitioning algorithms for optimal classical planning (2017)Google Scholar
  16. 16.
    Sheikh, R., Kumar, B., Mishra, D.K.: A distributed k-secure sum protocol for secure multi-party computations. arXiv preprint arXiv:1003.4071 (2010)
  17. 17.
    Štolba, M., Fišer, D., Komenda, A.: Admissible landmark heuristic for multi-agent planning. In: Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS), pp. 211–219 (2015)Google Scholar
  18. 18.
    Štolba, M., Fišer, D., Komenda, A.: Potential heuristics for multi-agent planning. In: Proceedings of the 26th International Conference on Automated Planning and Scheduling, ICAPS 2016, pp. 308–316 (2016)Google Scholar
  19. 19.
    Štolba, M., Fišer, D., Komenda, A.: Privacy leakage of search-based multi-agent planning algorithms. In: Proceedings of the 29th International Conference on Automated Planning and Scheduling, ICAPS 2019 (2019)Google Scholar
  20. 20.
    Štolba, M., Tožička, J., Komenda, A.: Quantifying privacy leakage in multi-agent planning. ACM Trans. Internet Technol. (TOIT) 18, 28 (2017) Google Scholar
  21. 21.
    Štolba, M., Urbanovská, M., Fišer, D., Komenda, A.: Cost partitioning for multi-agent planning. In: Proceedings of the 11th International Conference on Agents and Artificial Intelligence, ICAART (2019)Google Scholar
  22. 22.
    Torreño, A., Onaindia, E., Sapena, O.: FMAP: distributed cooperative multi-agent planning. Appl. Intell. 41(2), 606–626 (2014)CrossRefGoogle Scholar
  23. 23.
    Torreño, A., Onaindia, E., Komenda, A., Štolba, M.: Cooperative multi-agent planning: a survey. ACM Comput. Surv. (CSUR) 50(6), 84 (2017)CrossRefGoogle Scholar
  24. 24.
    Tožička, J., Jakubuv, J., Komenda, A.: Generating multi-agent plans by distributed intersection of Finite State Machines. In: Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pp. 1111–1112 (2014)Google Scholar
  25. 25.
    Tožička, J., Štolba, M., Komenda, A.: The limits of strong privacy preserving multi-agent planning. In: Proceedings of the 27th International Conference on Automated Planning and Scheduling, ICAPS 2017 (2017)Google Scholar
  26. 26.
    Van Der Krogt, R.: Quantifying privacy in multiagent planning. Multiagent Grid Syst. 5(4), 451–469 (2009)CrossRefGoogle Scholar
  27. 27.
    Yao, A.C.: Protocols for secure computations. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, SFCS, pp. 160–164 (1982)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Michal Štolba
    • 1
    Email author
  • Michaela Urbanovská
    • 1
  • Daniel Fišer
    • 1
  • Antonín Komenda
    • 1
  1. 1.Department of Computer Science, Faculty of Electrical EngineeringCzech Technical University in PraguePragueCzech Republic

Personalised recommendations