{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T03:49:50Z","timestamp":1778644190401,"version":"3.51.4"},"reference-count":80,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T00:00:00Z","timestamp":1525305600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["TIN2011-27652-C03-02"],"award-info":[{"award-number":["TIN2011-27652-C03-02"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003329","name":"Ministerio de Econom\u00eda y Competitividad","doi-asserted-by":"publisher","award":["TIN2014-55637-C2-1-R"],"award-info":[{"award-number":["TIN2014-55637-C2-1-R"]}],"id":[{"id":"10.13039\/501100003329","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10115-018-1202-1","type":"journal-article","created":{"date-parts":[[2018,5,3]],"date-time":"2018-05-03T03:10:15Z","timestamp":1525317015000},"page":"425-479","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Efficient approaches for multi-agent planning"],"prefix":"10.1007","volume":"58","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5282-0463","authenticated-orcid":false,"given":"Daniel","family":"Borrajo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Susana","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,3]]},"reference":[{"issue":"1","key":"1202_CR1","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1109\/MIS.2004.1265878","volume":"19","author":"M Ai-Chang","year":"2004","unstructured":"Ai-Chang M et al (2004) MAPGEN: mixed-initiative planning and scheduling for the Mars Exploration Rover mission. IEEE Intell Syst 19(1):8\u201312","journal-title":"IEEE Intell Syst"},{"issue":"1","key":"1202_CR2","doi-asserted-by":"publisher","first-page":"9","DOI":"10.3166\/jancl.21.9-34","volume":"21","author":"T Bolander","year":"2011","unstructured":"Bolander T, Andersen MB (2011) Epistemic planning for single and multi-agent systems. J Appl Non-Class Log 21(1):9\u201333","journal-title":"J Appl Non-Class Log"},{"key":"1202_CR3","unstructured":"Bonisoli A et\u00a0al (2014) A privacy-preserving model for the multi-agent propositional planning problem. In: Proceedings of the 2nd ICAPS distributed and multi-agent planning workshop (DMAP-2014), Portsmouth, NH, USA, pp 25\u201329"},{"key":"1202_CR4","unstructured":"Borrajo D (2013a) Multi-agent planning by plan reuse. Extended abstract. In: Proceedings of the AAMAS\u201913, St. Paul, MN (EEUU), pp 1141\u20131142"},{"key":"1202_CR5","unstructured":"Borrajo D (2013b) Plan sharing for multi-agent planning. In: Preprints of the ICAPS\u201913 DMAP workshop on distributed and multi-agent planning, Rome, Italy, pp 57\u201365"},{"key":"1202_CR6","unstructured":"Borrajo D, Fern\u00e1ndez S (2015) MAPR and CMAP. In: Proceedings of the competition of distributed and multi-agent planners (CoDMAP-15), Jerusalem, Israel"},{"key":"1202_CR7","unstructured":"Borrajo D, Veloso M (2012) Probabilistically reusing plans in deterministic planning. In: Proceedings of ICAPS\u201912 workshop on heuristics and search for domain-independent planning, Atibaia, Brazil, pp 17\u201325"},{"key":"1202_CR8","unstructured":"Bowling M H et al (2003) A formalization of equilibria for multiagent planning. In: Proceedings of IJCAI, pp 1460\u20131462"},{"key":"1202_CR9","unstructured":"Brafman R, Zoran U (2014) Distributed heuristic forward search for multi-agent systems. In: Proceedings of the 2nd ICAPS distributed and multi-agent planning workshop (DMAP-2014), Portsmouth, NH, USA, pp 1\u20136"},{"key":"1202_CR10","unstructured":"Brafman RI (2015) 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\u20131536"},{"key":"1202_CR11","unstructured":"Brafman RI, Domshlak C (2006) Factored planning: how, when, and when not. In: Proceedings of AAAI-2006, pp 809\u2013814"},{"key":"1202_CR12","unstructured":"Brafman RI, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of ICAPS\u201908"},{"key":"1202_CR13","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.08.005","volume":"198","author":"RI Brafman","year":"2013","unstructured":"Brafman RI, Domshlak C (2013) On the complexity of planning for agent teams and its implications for single agent planning. Artif Intell 198:52\u201371","journal-title":"Artif Intell"},{"key":"1202_CR14","doi-asserted-by":"crossref","unstructured":"Brafman RI et al (2013) Qualitative planning under partial observability in multi-agent domains. In: Proceedings of the 1st workshop on distributed and multi-agent planning (DMAP 2013), pp 26\u201333","DOI":"10.1609\/aaai.v27i1.8643"},{"key":"1202_CR15","unstructured":"Brenner M (2003) A multiagent planning language. In: Preprints of ICAPS\u201903 workshop on PDDL, pp 33\u201338"},{"key":"1202_CR16","doi-asserted-by":"crossref","unstructured":"Brenner M (2010) Creating dynamic story plots with continual multiagent planning. In: Proceedings of the twenty-fourth AAAI conference on artificial intelligence (AAAI). AAAI Press","DOI":"10.1609\/aaai.v24i1.7567"},{"key":"1202_CR17","doi-asserted-by":"crossref","unstructured":"Brenner M, Nebel B (2009) Continual planning and acting in dynamic multiagent environments. J Auton Agents Multiagent Syst 19(3):297\u2013331","DOI":"10.1007\/s10458-009-9081-1"},{"issue":"1\u20132","key":"1202_CR18","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","volume":"69","author":"T Bylander","year":"1994","unstructured":"Bylander T (1994) The computational complexity of propositional STRIPS planning. Artif Intell 69(1\u20132):165\u2013204","journal-title":"Artif Intell"},{"key":"1202_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1613\/jair.477","volume":"9","author":"C B\u00e4ckstr\u00f6m","year":"1998","unstructured":"B\u00e4ckstr\u00f6m C (1998) Computational aspects of reordering plans. J Artif Intell Res 9:99\u2013137","journal-title":"J Artif Intell Res"},{"key":"1202_CR20","doi-asserted-by":"crossref","unstructured":"B\u00e4ckstr\u00f6m C, Nebel B (1995) Complexity results for SAS planning. Comput Intell 11(4)","DOI":"10.1111\/j.1467-8640.1995.tb00052.x"},{"key":"1202_CR21","unstructured":"Cox JS, Durfee EH (2004) Efficient mechanisms for multiagent plan merging. In: International joint conference on autonomous agents and multiagent systems (AAMAS\u201904). IEEE Computer Society, Los Alamitos, CA, USA, pp 1342\u20131343"},{"key":"1202_CR22","unstructured":"Cox JS, Durfee EH (2005) An efficient algorithm for multiagent plan coordination. In: International joint conference on autonomous agents and multiagent systems (AAMAS\u201905). IEEE Computer Society, pp 828\u2013835"},{"key":"1202_CR23","doi-asserted-by":"crossref","unstructured":"Crosby M et al (2013) Automated agent decomposition for classical planning. In: Borrajo D, Kambhampati S, Oddi A, Fratini S (eds) Proceedings of ICAPS\u201913. AAAI","DOI":"10.1609\/icaps.v23i1.13564"},{"issue":"4","key":"1202_CR24","doi-asserted-by":"publisher","first-page":"345","DOI":"10.3233\/MGS-2009-0133","volume":"5","author":"M Weerdt de","year":"2009","unstructured":"de Weerdt M, Clement B (2009) Introduction to planning in multiagent systems. Multiagent Grid Syst 5(4):345\u2013355","journal-title":"Multiagent Grid Syst"},{"key":"1202_CR25","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.knosys.2011.07.019","volume":"29","author":"Y Dimopoulos","year":"2012","unstructured":"Dimopoulos Y et al (2012) $$\\mu $$ \u03bc -SATPLAN: multi-agent planning as satisfiability. Knowl-Based Syst 29:54\u201362","journal-title":"Knowl-Based Syst"},{"key":"1202_CR26","unstructured":"Durfee EH (1999) Multiagent systems: a modern approach to distributed artificial intelligence, chap. Distributed problem solving and planning. MIT Press, pp 121\u2013164"},{"key":"1202_CR27","unstructured":"Durkota K, Komenda A (2013) Deterministic multiagent planning techniques: experimental comparison. In: Proceedings of the 1st workshop on distributed and multi-agent planning (DMAP 2013), pp 43\u201347"},{"key":"1202_CR28","unstructured":"Ephrati E et al (1995) A tractable heuristic that maximizes global utility through local plan combination\u2019. In: Proceedings of the first international conference on multi-agent systems. MIT Press, San Francisco, USA, pp 94\u2013101"},{"key":"1202_CR29","unstructured":"Fdez-Olivares J et al (2006) Bringing users and planning technology together. Experiences in SIADEX. In: Proceedings of ICAPS 2006"},{"issue":"2","key":"1202_CR30","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1017\/S0269888907001075","volume":"22","author":"S Fern\u00e1ndez","year":"2007","unstructured":"Fern\u00e1ndez S et al (2007) PLTOOL. A KE tool for planning and learning. Knowl Eng Rev 22(2):153\u2013184. https:\/\/doi.org\/10.1017\/S0269888907001075","journal-title":"Knowl Eng Rev"},{"key":"1202_CR31","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0004-3702(72)90051-3","volume":"3","author":"RE Fikes","year":"1972","unstructured":"Fikes RE et al (1972) Learning and executing generalized robot plans. Artif Intell 3:251\u2013288","journal-title":"Artif Intell"},{"issue":"2\u20133","key":"1202_CR32","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/0004-3702(92)90016-Q","volume":"57","author":"D Foulser","year":"1992","unstructured":"Foulser D et al (1992) Theory and algorithms for plan merging. Artif Intell 57(2\u20133):143\u2013181","journal-title":"Artif Intell"},{"key":"1202_CR33","unstructured":"Fox M et al (2006) Plan stability: replanning versus plan repair. In: Proceedings of the sixteenth international conference on automated planning and scheduling (ICAPS\u201906), pp 212\u2013221"},{"issue":"1","key":"1202_CR34","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/j.ejor.2012.12.018","volume":"227","author":"J Garc\u00eda","year":"2013","unstructured":"Garc\u00eda J et al (2013) Combining linear programming and automated planning to solve intermodal transportation problems. Eur J Oper Res 227(1):216\u2013226","journal-title":"Eur J Oper Res"},{"key":"1202_CR35","doi-asserted-by":"crossref","unstructured":"Gentry C (2010) Computing arbitrary functions of encrypted data. Communications of the ACM, pp 97\u2013105","DOI":"10.1145\/1666420.1666444"},{"key":"1202_CR36","unstructured":"Ghallab M et al (1998) PDDL\u2014the planning domain definition language. Tech. Rep. CVC TR-98-003\/DCS TR-1165, Yale Center for Computational Vision and Control"},{"key":"1202_CR37","doi-asserted-by":"crossref","unstructured":"Ghallab M et al (2004) Automated planning. Theory & Practice, Morgan Kaufmann","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"1202_CR38","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1613\/jair.1000","volume":"19","author":"C Guestrin","year":"2003","unstructured":"Guestrin C et al (2003) Efficient solution algorithms for factored MDPs. J Artif Intell Res 19:399\u2013468","journal-title":"J Artif Intell Res"},{"key":"1202_CR39","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1613\/jair.1705","volume":"26","author":"M Helmert","year":"2006","unstructured":"Helmert M (2006) The fast downward planning system. JAIR 26:191\u2013246","journal-title":"JAIR"},{"key":"1202_CR40","doi-asserted-by":"publisher","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 14:253\u2013302","journal-title":"J Artif Intell Res"},{"key":"#cr-split#-1202_CR41.1","unstructured":"Howey R et al (2004) VAL: automatic plan validation, continuous effects and mixed initiative planning using PDDL. In: Khoshgoftaar TM"},{"key":"#cr-split#-1202_CR41.2","unstructured":"(ed) ICTAI 2004: 16th IEEE international conference on tools with artificial intelligence, pp 294-301"},{"key":"1202_CR42","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":"1202_CR43","unstructured":"Kominis F, Geffner H (2014) Beliefs in multiagent planning: from one agent to many. In: Proceedings of the 2nd ICAPS distributed and multi-agent planning workshop (DMAP-2014), Portsmouth, NH, USA, pp 62\u201369"},{"key":"1202_CR44","unstructured":"Kovacs DL (2012) A multi-agent extension of PDDL3.1\u2019. In: Preprints of ICAPS\u201912 workshop on international planning competition. AAAI Press, Atibaia, Brazil, pp 19\u201327"},{"key":"1202_CR45","unstructured":"Langdon AC, Cox MT (2004) The effect of agent topologies on multiagent planning performance. In: Berkowitz EG (ed) Proceedings of fifteenth midwest artificial intelligence and cognitive sciences conference (MAICS). Omni Press, pp 125\u2013129"},{"issue":"1\u20132","key":"1202_CR46","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1023\/B:AGNT.0000019690.28073.04","volume":"9","author":"VR Lesser","year":"2004","unstructured":"Lesser VR et al (2004) Evolution of the GPGP\/T\u00c6MS domain-independent coordination framework. Auton Agent Multi-Agent Syst 9(1\u20132):87\u2013143","journal-title":"Auton Agent Multi-Agent Syst"},{"issue":"4","key":"1202_CR47","doi-asserted-by":"crossref","first-page":"331","DOI":"10.3233\/AIC-130572","volume":"26","author":"C Linares L\u00f3pez","year":"2013","unstructured":"Linares L\u00f3pez C et al (2013) Automating the evaluation of planning systems. AI Commun 26(4):331\u2013354","journal-title":"AI Commun"},{"key":"1202_CR48","doi-asserted-by":"crossref","unstructured":"Lipovetzky N, Geffner H (2012) Width and serialization of classical planning problems. In: ECAI, pp 540\u2013545","DOI":"10.3233\/978-1-61499-098-7-540"},{"key":"1202_CR49","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1613\/jair.570","volume":"10","author":"D Long","year":"1999","unstructured":"Long D, Fox M (1999) Efficient implementation of the plan graph in STAN. J Artif Intell Res 10:87\u2013115","journal-title":"J Artif Intell Res"},{"key":"1202_CR50","unstructured":"Luis N, Borrajo D (2014) Plan merging by reuse for multi-agent planning. In: Proceedings of the 2nd ICAPS distributed and multi-agent planning workshop (DMAP-2014), Portsmouth, NH, USA, pp 38\u201344"},{"key":"1202_CR51","doi-asserted-by":"crossref","unstructured":"Maliah S et al (2016) Online macro generation for privacy preserving planning. In: Proceedings of the twenty-sixth international conference on automated planning and scheduling, ICAPS, pp 216\u2013220","DOI":"10.1609\/icaps.v26i1.13741"},{"key":"1202_CR52","unstructured":"Milla-Mill\u00e1n G et al (2013) Multi-agent planning based on the dynamic selection and merging of hierarchical task networks. In: Proceedings of the 1st workshop on distributed and multi-agent planning (DMAP 2013, pp 34\u201342"},{"key":"1202_CR53","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-1703-6","volume-title":"Learning effective search control knowledge: an explanation-based approach","author":"S Minton","year":"1988","unstructured":"Minton S (1988) Learning effective search control knowledge: an explanation-based approach. Kluwer Academic Publishers, Boston"},{"key":"1202_CR54","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1613\/jair.4295","volume":"51","author":"R Nissim","year":"2014","unstructured":"Nissim R, Brafman R (2014) Distributed heuristic forward search for multi-agent planning. JAIR 51:293\u2013332","journal-title":"JAIR"},{"key":"1202_CR55","doi-asserted-by":"crossref","unstructured":"Nissim R, Brafman RI (2013) Cost-optimal planning by self-interested agents. In: Proceedings of AAAI\u201913","DOI":"10.1609\/aaai.v27i1.8640"},{"key":"1202_CR56","unstructured":"Nissim R et\u00a0al (2010) A general, fully distributed multi-agent planning algorithm. In: Proceedings of 9th international conference on autonomous agents and multiagent systems (AAMAS\u201910), pp 1323\u20131330"},{"key":"1202_CR57","unstructured":"Salido M\u00c1 et al (2009) The container stacking problem: an artificial intelligence planning-based approach. In: Proceeding of the international workshop on harbour, maritime and multimodal logistics modelling and simulation, pp 127\u2013131"},{"key":"1202_CR58","doi-asserted-by":"crossref","unstructured":"Scharpff J et al (2013) Planning under uncertainty for coordinating infrastructural maintenance. In: Proceedings of ICAPS\u201913, pp 425\u2013433","DOI":"10.1609\/icaps.v23i1.13592"},{"key":"1202_CR59","unstructured":"Sharon G et al (2012) Conflict-based search for optimal multi-agent path finding. In: Proceedings of AAAI\u20192012"},{"issue":"1\u20132","key":"1202_CR60","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/S0004-3702(98)00045-9","volume":"101","author":"O Shehory","year":"1998","unstructured":"Shehory O, Kraus S (1998) Methods for task allocation via agent coalition formation. Artif Intell 101(1\u20132):165\u2013200","journal-title":"Artif Intell"},{"key":"1202_CR61","doi-asserted-by":"crossref","unstructured":"Silver D (2005) Cooperative path finding. In: Young RM, Laird JE (eds) Proceedings of AIIDE, pp 117\u2013122. AAAI Press","DOI":"10.1609\/aiide.v1i1.18726"},{"issue":"12","key":"1202_CR62","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1109\/TC.1980.1675516","volume":"C\u201329","author":"RG Smith","year":"1980","unstructured":"Smith RG (1980) The contract net protocol: high-level communication and control in a distributed problem solver. IEEE Trans Comput C\u201329(12):1104\u20131113","journal-title":"IEEE Trans Comput"},{"key":"1202_CR63","unstructured":"Standley T, Korf R (2011) Complete algorithms for cooperative pathfinding problems. In: Proceedings of IJCAI\u201911, pp 668\u2013673"},{"issue":"3","key":"1202_CR64","doi-asserted-by":"crossref","first-page":"28:1","DOI":"10.1145\/3133326","volume":"18","author":"M \u0160tolba","year":"2018","unstructured":"\u0160tolba M et al (2018) Quantifying privacy leakage in multi-agent planning. ACM Trans Internet Technol 18(3):28:1\u201328:21","journal-title":"ACM Trans Internet Technol"},{"key":"1202_CR65","unstructured":"Szer D et al (2012) MAA*: a heuristic search algorithm for solving decentralized POMDPs. CoRR arXiv:1207.1359"},{"key":"1202_CR66","doi-asserted-by":"crossref","unstructured":"Torre\u00f1o A et al (2014) FMAP: distributed cooperative multi-agent planning. Appl Intell","DOI":"10.1007\/s10489-014-0540-2"},{"issue":"6","key":"1202_CR67","doi-asserted-by":"publisher","first-page":"84:1","DOI":"10.1145\/3128584","volume":"50","author":"A Torre\u00f1o","year":"2017","unstructured":"Torre\u00f1o A et al (2017) Cooperative multi-agent planning: a survey. ACM Comput Surv 50(6):84:1\u201384:32","journal-title":"ACM Comput Surv"},{"issue":"1","key":"1202_CR68","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10115-012-0569-7","volume":"38","author":"A Torre\u00f1o","year":"2014","unstructured":"Torre\u00f1o A et al (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141\u2013178","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"1202_CR69","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/s10115-015-0887-7","volume":"48","author":"J Tozicka","year":"2016","unstructured":"Tozicka J et al (2016) Privacy-concerned multiagent planning. Knowl Inf Syst 48(3):581\u2013618","journal-title":"Knowl Inf Syst"},{"issue":"4","key":"1202_CR70","doi-asserted-by":"publisher","first-page":"451","DOI":"10.3233\/MGS-2009-0135","volume":"5","author":"R Krogt van der","year":"2009","unstructured":"van der Krogt R (2009) Quantifying privacy in multiagent planning. Multiagent Grid Syst 5(4):451\u2013469","journal-title":"Multiagent Grid Syst"},{"key":"1202_CR71","unstructured":"van der Krogt R, de Weerdt M (2005) Plan repair as an extension of planning. In: Proceedings of ICAPS-05, pp 161\u2013170"},{"key":"1202_CR72","doi-asserted-by":"crossref","unstructured":"van Otterloo S (2005) The value of privacy: optimal strategies for privacy minded agents. In: Proceedings of the fourth international conference on autonomous agents and multi-agent systems (AAMAS-05), pp 1015\u20131022","DOI":"10.1145\/1082473.1082627"},{"key":"1202_CR73","unstructured":"Veloso MM, et al (1990) Nonlinear planning with parallel resource allocation. In: Proceedings of the DARPA workshop on innovative approaches to planning, scheduling, and control. Morgan Kaufmann, San Diego, pp 207\u2013212"},{"key":"1202_CR74","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1111\/j.1540-6261.1961.tb02789.x","volume":"16","author":"W Vickrey","year":"1961","unstructured":"Vickrey W (1961) Computer speculation, auctions, and competitive sealed tenders. J Finance 16:8\u201337","journal-title":"J Finance"},{"key":"1202_CR75","unstructured":"Virseda J et al (2014) Multi-agent planning with agent preferences. In: Proceedings of the 2nd ICAPS distributed and multi-agent planning workshop (DMAP-2014), Portsmouth, NH, USA, pp 70\u201378"},{"issue":"1\u20132","key":"1202_CR76","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.artint.2004.10.006","volume":"161","author":"RJ Wallace","year":"2005","unstructured":"Wallace RJ, Freuder EC (2005) Constraint-based reasoning and privacy\/efficiency tradeoffs in multi-agent problem solving. Artif Intell 161(1\u20132):209\u2013227","journal-title":"Artif Intell"},{"key":"1202_CR77","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1613\/jair.1213","volume":"19","author":"WE Walsh","year":"2003","unstructured":"Walsh WE, Wellman MP (2003) Decentralized supply chain formation: a market protocol and competitive equilibrium analysis. J Artif Intell Res 19:513\u2013567","journal-title":"J Artif Intell Res"},{"key":"1202_CR78","unstructured":"Wang X (1994) Learning planning operators by observation and practice. In: Proceedings of the second international conference on AI planning systems, AIPS-94, AAAI Press, Chicago, IL, pp 335\u2013340"},{"issue":"2\u20133","key":"1202_CR79","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.artint.2006.11.005","volume":"171","author":"Q Yang","year":"2007","unstructured":"Yang Q et al (2007) Learning action models from plan examples using weighted MAX-SAT. Artif Intell 171(2\u20133):107\u2013143","journal-title":"Artif Intell"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-018-1202-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1202-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-018-1202-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T02:24:28Z","timestamp":1751595868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-018-1202-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,3]]},"references-count":80,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["1202"],"URL":"https:\/\/doi.org\/10.1007\/s10115-018-1202-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,3]]},"assertion":[{"value":"15 December 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 February 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}