{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T12:49:26Z","timestamp":1749818966346,"version":"3.41.0"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T00:00:00Z","timestamp":1444780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001824","name":"Czech Science Foundation","doi-asserted-by":"crossref","award":["13-22125S"],"award-info":[{"award-number":["13-22125S"]}],"id":[{"id":"10.13039\/501100001824","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1007\/s10115-015-0887-7","type":"journal-article","created":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T15:47:53Z","timestamp":1444837673000},"page":"581-618","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Privacy-concerned multiagent planning"],"prefix":"10.1007","volume":"48","author":[{"given":"Jan","family":"To\u017ei\u010dka","sequence":"first","affiliation":[]},{"given":"Jan","family":"Jakub\u016fv","sequence":"additional","affiliation":[]},{"given":"Anton\u00edn","family":"Komenda","sequence":"additional","affiliation":[]},{"given":"Michal","family":"P\u011bchou\u010dek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,14]]},"reference":[{"key":"887_CR1","unstructured":"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\u201315 Aug 2003. Morgan Kaufmann, pp 929\u2013935"},{"issue":"1","key":"887_CR2","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0004-3702(94)90062-0","volume":"71","author":"F Bacchus","year":"1994","unstructured":"Bacchus F, Yang Q (1994) Downward refinement and the efficiency of hierarchical problem solving. Artif Intell 71(1):43\u2013100","journal-title":"Artif Intell"},{"key":"887_CR3","volume-title":"SOCS","author":"S Bhattacharya","year":"2010","unstructured":"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 Park"},{"key":"887_CR4","unstructured":"Borrajo D (2013) Plan sharing for multi-agent planning. In: Proceedings of DMAP workshop of ICAPS\u201913, pp 57\u201365"},{"key":"887_CR5","first-page":"105","volume":"14","author":"C Boutilier","year":"2001","unstructured":"Boutilier C, Brafman RI (2001) Partial order planning with concurrent interacting actions. Artif Intell 14:105\u2013136","journal-title":"Artif Intell"},{"key":"887_CR6","unstructured":"Brafman R, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of ICAPS\u201908, vol 8, pp 28\u201335"},{"key":"887_CR7","unstructured":"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\u201320 July 2006, Boston, Massachusetts, USA. AAAI Press, pp 809\u2013814"},{"key":"887_CR8","unstructured":"Brenner M (2003) Multiagent planning with partially ordered temporal plans. In: Proceedings of the 18th international joint conference on artificial intelligence, IJCAI\u201903. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, pp 1513\u20131514"},{"key":"887_CR9","doi-asserted-by":"publisher","unstructured":"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\u201321 Sept 2001, Proceedings, Lecture Notes in Computer Science, vol 2143. Springer, pp 180\u2013191. doi: 10.1007\/3-540-44652-417","DOI":"10.1007\/3-540-44652-417"},{"key":"887_CR10","unstructured":"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\u201910), pp 137\u2013150"},{"key":"887_CR11","unstructured":"Durkota K, Komenda A (2013) Deterministic multiagent planning techniques: experimental comparison (short paper). In: Proceedings of DMAP workshop of ICAPS\u201913, pp 43\u201347"},{"key":"887_CR12","doi-asserted-by":"crossref","unstructured":"Fabre E, Jezequel L, Haslum P, Thi\u00e9baux S (2010) Cost-optimal factored planning: promises and pitfalls. In: Brafman RI, Geffner H, Hoffmann J, Kautz HA (eds) ICAPS. AAAI, pp 65\u201372","DOI":"10.1609\/icaps.v20i1.13415"},{"key":"887_CR13","doi-asserted-by":"crossref","unstructured":"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\u2013620","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"887_CR14","volume-title":"Automated planning: theory and practice","author":"M Ghallab","year":"2004","unstructured":"Ghallab M, Nau DS, Traverso P (2004) Automated planning: theory and practice. Elsevier, Amsterdam"},{"key":"887_CR15","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann J, Nebel B (2001) The FF planning system: fast plan generation through heuristic search. J Artif Intell Res (JAIR) 14:253\u2013302","journal-title":"J Artif Intell Res (JAIR)"},{"key":"887_CR16","volume-title":"Introduction to automata theory, languages, and computation","author":"JE Hopcroft","year":"2006","unstructured":"Hopcroft JE, Motwani R, Ullman JD (2006) Introduction to automata theory, languages, and computation, 3rd edn. Addison-Wesley Longman Publishing Co. Inc., Boston","edition":"3"},{"key":"887_CR17","doi-asserted-by":"crossref","unstructured":"Jakub\u016fv J, To\u017ei\u010dka J, Komenda A (2015) Multiagent planning by plan set intersection and plan verification. In: Proceedings ICAART\u201915","DOI":"10.5220\/0005222101730182"},{"key":"887_CR18","doi-asserted-by":"crossref","unstructured":"Jakub\u016fv J, Wells JB (2010) Expressiveness of generic process shape types. In: TGC\u201910, LNCS, vol 6084. Springer, pp 103\u2013119","DOI":"10.1007\/978-3-642-15640-3_8"},{"key":"887_CR19","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1613\/jair.649","volume":"13","author":"RM Jensen","year":"2000","unstructured":"Jensen RM, Veloso MM (2000) OBDD-based universal planning for synchronized agents in non-deterministic domains. J Artif Intell Res 13:189\u2013226","journal-title":"J Artif Intell Res"},{"key":"887_CR20","doi-asserted-by":"crossref","unstructured":"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\u201912), pp 7377\u20137382","DOI":"10.1109\/CDC.2012.6426187"},{"key":"887_CR21","doi-asserted-by":"crossref","unstructured":"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\u201911), pp 114\u2013121","DOI":"10.1609\/icaps.v21i1.13461"},{"key":"887_CR22","unstructured":"Kelareva E, Buffet O, Huang J, Thi\u00e9baux 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\u201312 Jan 2007, pp 1942\u20131947"},{"key":"887_CR23","unstructured":"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\u201327"},{"key":"887_CR24","unstructured":"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\u00e9al Qu\u00e9bec, Canada, 20\u201325 Aug 1995, vol 2. Morgan Kaufmann, pp 1612\u20131619"},{"key":"887_CR25","doi-asserted-by":"crossref","unstructured":"Makholm H, Wells JB (2005) Instant polymorphic type systems for mobile process calculi: just add reduction rules and close. In: ESOP\u201905, LNCS, vol 3444. Springer, pp 389\u2013407","DOI":"10.1007\/978-3-540-31987-0_27"},{"key":"887_CR26","unstructured":"Maliah S, Shani G, Stern R (2014) Privacy preserving landmark detection. In: Proceedings of ECAI\u201914"},{"key":"887_CR27","unstructured":"Nissim R, Brafman RI (2012) Multi-agent A* for parallel and distributed systems. In: Proceedings of AAMAS\u201912, AAMAS \u201912. Richland, SC, pp 1265\u20131266"},{"key":"887_CR28","doi-asserted-by":"crossref","unstructured":"Nissim R, Brafman RI (2013) Cost-optimal planning by self-interested agents. In: Proceedings of DMAP workshop of ICAPS\u201913, pp 1\u20137","DOI":"10.1609\/aaai.v27i1.8640"},{"key":"887_CR29","unstructured":"Oglietti M, Cesta A (2004) CSTRIPS: towards explicit concurrent planning. In: Proceedings of ninth national symposium of \u2019Associazione Italiana per l\u2019Intelligenza Artificiale AI*IA\u201904, third Italian workshop on planning and scheduling IWP\u201904. Perugia, Italy. ISBN: 88-89422-09-2"},{"key":"887_CR30","unstructured":"Pellier D (2010) Distributed planning through graph merging. In: Proceedings of the 2nd international conference on agents and artificial intelligence (ICAART 2010), pp 128\u2013134"},{"key":"887_CR31","unstructured":"\u0160tolba M, Komenda A (2013) Fast-forward heuristic for multiagent planning. In: Proceedings of DMAP workshop of ICAPS\u201913, vol 120, pp 75\u201383"},{"key":"887_CR32","doi-asserted-by":"crossref","unstructured":"\u0160tolba M, Komenda A (2014) Relaxation heuristics for multiagent planning. In: 24th International conference on automated planning and scheduling (ICAPS), pp 298\u2013306","DOI":"10.1609\/icaps.v24i1.13642"},{"issue":"2","key":"887_CR33","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1007\/s10489-014-0540-2","volume":"41","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o A, Onaindia E, Sapena O (2014) FMAP: distributed cooperative multi-agent planning. Appl Intell 41(2):606\u2013626","journal-title":"Appl Intell"},{"issue":"1","key":"887_CR34","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/s10115-012-0569-7","volume":"38","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o A, Onaindia E, Sapena O (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141\u2013178","journal-title":"Knowl Inf Syst"},{"key":"887_CR35","unstructured":"To\u017ei\u010dka J, Jakub\u016fv J, Durkota K, Komenda A, P\u011bchou\u010dek M (2014) Multiagent planning supported by plan diversity metrics and landmark actions. In: Proceedings ICAART\u201914"},{"key":"887_CR36","unstructured":"To\u017ei\u010dka J, Jakub\u016fv J, Komenda A (2014) Generating multi-agent plans by distributed intersection of finite state machines. In: Proceedings ECAI\u201914, pp 1111\u20131112"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0887-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-015-0887-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-015-0887-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,31]],"date-time":"2025-05-31T01:16:59Z","timestamp":1748654219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-015-0887-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,14]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,9]]}},"alternative-id":["887"],"URL":"https:\/\/doi.org\/10.1007\/s10115-015-0887-7","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2015,10,14]]}}}