Knowledge and Information Systems

, Volume 48, Issue 3, pp 581–618 | Cite as

Privacy-concerned multiagent planning

  • Jan Tožička
  • Jan Jakubův
  • Antonín Komenda
  • Michal Pěchouček
Regular Paper


Coordinated sequential decision making of a team of cooperative agents can be described by principles of multiagent planning. Provided that the mechanics of the environment the agents act in is described as a deterministic transitions system, an appropriate planning model is MA-Strips. Multiagent planning modeled as MA-Strips prescribes exactly what information has to be kept private and which information can be communicated in order to coordinate toward shared or individual goals. We propose a multiagent planning approach which combines compilation for a classical state-of-the-art planner together with a compact representation of local plans in the form of finite-state machines. Proving soundness and completeness of the approach, the planner efficiency is further boosted up using distributed delete-relaxation heuristics and using an approximative local plan analysis. We experimentally evaluate applicability of our approach in full privacy setting where only public information can be communicated. We analyze properties of standard multiagent benchmarks from the perspective of classification of private and public information. We show that our approach can be used with different privacy settings and that it outperforms state-of-the-art planners designed directly for particular privacy classification.


Multiagent planning Finite-state machines Delete relaxation Action landmarks 



This research was supported by the Czech Science Foundation (Grant No. 13-22125S).


  1. 1.
    Amir E, Engelhardt B (2003) Factored planning. In: Gottlob G, Walsh T (eds) IJCAI-03, Proceedings of the eighteenth international joint conference on artificial intelligence, Acapulco, Mexico, 9–15 Aug 2003. Morgan Kaufmann, pp 929–935Google Scholar
  2. 2.
    Bacchus F, Yang Q (1994) Downward refinement and the efficiency of hierarchical problem solving. Artif Intell 71(1):43–100MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bhattacharya S, Kumar V, Likhachev M (2010) Search-based path planning with homotopy class constraints. In: Felner A, Sturtevant NR (eds) SOCS. AAAI Press, Menlo ParkGoogle Scholar
  4. 4.
    Borrajo D (2013) Plan sharing for multi-agent planning. In: Proceedings of DMAP workshop of ICAPS’13, pp 57–65Google Scholar
  5. 5.
    Boutilier C, Brafman RI (2001) Partial order planning with concurrent interacting actions. Artif Intell 14:105–136zbMATHGoogle Scholar
  6. 6.
    Brafman R, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of ICAPS’08, vol 8, pp 28–35Google Scholar
  7. 7.
    Brafman RI, Domshlak C (2006) Factored planning: how, when, and when not. In: Proceedings, the twenty-first national conference on artificial intelligence and the eighteenth innovative applications of artificial intelligence conference, 16–20 July 2006, Boston, Massachusetts, USA. AAAI Press, pp 809–814Google Scholar
  8. 8.
    Brenner M (2003) Multiagent planning with partially ordered temporal plans. In: Proceedings of the 18th international joint conference on artificial intelligence, IJCAI’03. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 1513–1514Google Scholar
  9. 9.
    Darwiche A, Hopkins M (2001) Using recursive decomposition to construct elimination orders, jointrees, and dtrees. In: Benferhat S, Besnard P (eds) Symbolic and quantitative approaches to reasoning with uncertainty, 6th European conference, ECSQARU 2001, Toulouse, France, 19–21 Sept 2001, Proceedings, Lecture Notes in Computer Science, vol 2143. Springer, pp 180–191. doi: 10.1007/3-540-44652-417
  10. 10.
    Dimopoulos Y, Hashmi MA, Moraitis P (2010) Extending SATPLAN to multiple agents. In: Proceedings of the 30th international conference on innovative techniques and applications of artificial intelligence (SGAI’10), pp 137–150Google Scholar
  11. 11.
    Durkota K, Komenda A (2013) Deterministic multiagent planning techniques: experimental comparison (short paper). In: Proceedings of DMAP workshop of ICAPS’13, pp 43–47Google Scholar
  12. 12.
    Fabre E, Jezequel L, Haslum P, Thiébaux S (2010) Cost-optimal factored planning: promises and pitfalls. In: Brafman RI, Geffner H, Hoffmann J, Kautz HA (eds) ICAPS. AAAI, pp 65–72Google Scholar
  13. 13.
    Fikes R, Nilsson N (1971) STRIPS: a new approach to the application of theorem proving to problem solving. In: Proceedings of the 2nd international joint conference on artificial intelligence, pp 608–620Google Scholar
  14. 14.
    Ghallab M, Nau DS, Traverso P (2004) Automated planning: theory and practice. Elsevier, AmsterdamzbMATHGoogle Scholar
  15. 15.
    Hoffmann J, Nebel B (2001) The FF planning system: fast plan generation through heuristic search. J Artif Intell Res (JAIR) 14:253–302zbMATHGoogle Scholar
  16. 16.
    Hopcroft JE, Motwani R, Ullman JD (2006) Introduction to automata theory, languages, and computation, 3rd edn. Addison-Wesley Longman Publishing Co. Inc., BostonzbMATHGoogle Scholar
  17. 17.
    Jakubův J, Tožička J, Komenda A (2015) Multiagent planning by plan set intersection and plan verification. In: Proceedings ICAART’15Google Scholar
  18. 18.
    Jakubův J, Wells JB (2010) Expressiveness of generic process shape types. In: TGC’10, LNCS, vol 6084. Springer, pp 103–119Google Scholar
  19. 19.
    Jensen RM, Veloso MM (2000) OBDD-based universal planning for synchronized agents in non-deterministic domains. J Artif Intell Res 13:189–226MathSciNetzbMATHGoogle Scholar
  20. 20.
    Jezequel L, Fabre E (2012) A#: a distributed version of A* for factored planning. In: Proceedings of the 51th IEEE conference on decision and control (CDC’12), pp 7377–7382Google Scholar
  21. 21.
    Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS’11), pp 114–121Google Scholar
  22. 22.
    Kelareva E, Buffet O, Huang J, Thiébaux S (2007) Factored planning using decomposition trees. In: Veloso MM (ed) IJCAI 2007, Proceedings of the 20th international joint conference on artificial intelligence, Hyderabad, India, 6–12 Jan 2007, pp 1942–1947Google Scholar
  23. 23.
    Kovacs DL (2012) A multi-agent extension of pddl3.1. In: Proceedings of the 3rd workshop on the international planning competition (IPC), 22nd international conference on automated planning and scheduling (ICAPS-2012). Atibaia, Sao Paulo, Brazil, pp 19–27Google Scholar
  24. 24.
    Lansky AL, Getoor L (1995) Scope and abstraction: two criteria for localized planning. In: Proceedings of the fourteenth international joint conference on artificial intelligence, IJCAI 95, Montréal Québec, Canada, 20–25 Aug 1995, vol 2. Morgan Kaufmann, pp 1612–1619Google Scholar
  25. 25.
    Makholm H, Wells JB (2005) Instant polymorphic type systems for mobile process calculi: just add reduction rules and close. In: ESOP’05, LNCS, vol 3444. Springer, pp 389–407Google Scholar
  26. 26.
    Maliah S, Shani G, Stern R (2014) Privacy preserving landmark detection. In: Proceedings of ECAI’14Google Scholar
  27. 27.
    Nissim R, Brafman RI (2012) Multi-agent A* for parallel and distributed systems. In: Proceedings of AAMAS’12, AAMAS ’12. Richland, SC, pp 1265–1266Google Scholar
  28. 28.
    Nissim R, Brafman RI (2013) Cost-optimal planning by self-interested agents. In: Proceedings of DMAP workshop of ICAPS’13, pp 1–7Google Scholar
  29. 29.
    Oglietti M, Cesta A (2004) CSTRIPS: towards explicit concurrent planning. In: Proceedings of ninth national symposium of ’Associazione Italiana per l’Intelligenza Artificiale AI*IA’04, third Italian workshop on planning and scheduling IWP’04. Perugia, Italy. ISBN: 88-89422-09-2Google Scholar
  30. 30.
    Pellier D (2010) Distributed planning through graph merging. In: Proceedings of the 2nd international conference on agents and artificial intelligence (ICAART 2010), pp 128–134Google Scholar
  31. 31.
    Štolba M, Komenda A (2013) Fast-forward heuristic for multiagent planning. In: Proceedings of DMAP workshop of ICAPS’13, vol 120, pp 75–83Google Scholar
  32. 32.
    Štolba M, Komenda A (2014) Relaxation heuristics for multiagent planning. In: 24th International conference on automated planning and scheduling (ICAPS), pp 298–306Google Scholar
  33. 33.
    Torreño A, Onaindia E, Sapena O (2014) FMAP: distributed cooperative multi-agent planning. Appl Intell 41(2):606–626CrossRefGoogle Scholar
  34. 34.
    Torreño A, Onaindia E, Sapena O (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141–178CrossRefGoogle Scholar
  35. 35.
    Tožička J, Jakubův J, Durkota K, Komenda A, Pěchouček M (2014) Multiagent planning supported by plan diversity metrics and landmark actions. In: Proceedings ICAART’14Google Scholar
  36. 36.
    Tožička J, Jakubův J, Komenda A (2014) Generating multi-agent plans by distributed intersection of finite state machines. In: Proceedings ECAI’14, pp 1111–1112Google Scholar

Copyright information

© Springer-Verlag London 2015

Authors and Affiliations

  • Jan Tožička
    • 1
  • Jan Jakubův
    • 1
  • Antonín Komenda
    • 1
  • Michal Pěchouček
    • 1
  1. 1.Faculty of Electrical EngineeringCzech Technical UniversityPragueCzech Republic

Personalised recommendations