{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:37:04Z","timestamp":1740141424899,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T00:00:00Z","timestamp":1557878400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100010198","name":"Ministerio de Econom\u00eda, Industria y Competitividad, Gobierno de Espa\u00f1a","doi-asserted-by":"publisher","award":["TIN2014-55637-C2-1-R"],"award-info":[{"award-number":["TIN2014-55637-C2-1-R"]}],"id":[{"id":"10.13039\/501100010198","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FEDER\/Ministerio de Ciencia, Innovaci\u00f3n y Universidades - Agencia Estatal de Investigaci\u00f3n","award":["TIN2017-88476-C2-2-R"],"award-info":[{"award-number":["TIN2017-88476-C2-2-R"]}]},{"DOI":"10.13039\/501100001871","name":"Funda\u00e7\u00e3o para a Ci\u00eancia e a Tecnologia","doi-asserted-by":"publisher","award":["UID\/EEA\/50014\/2013"],"award-info":[{"award-number":["UID\/EEA\/50014\/2013"]}],"id":[{"id":"10.13039\/501100001871","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100008047","name":"Carnegie Mellon University","doi-asserted-by":"publisher","award":["SFRH\/BD\/52158\/2013"],"award-info":[{"award-number":["SFRH\/BD\/52158\/2013"]}],"id":[{"id":"10.13039\/100008047","id-type":"DOI","asserted-by":"publisher"}]},{"name":"COMPETE 2020 Programme","award":["POCI-01-0145-FEDER-006961"],"award-info":[{"award-number":["POCI-01-0145-FEDER-006961"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Intell Robot Syst"],"published-print":{"date-parts":[[2020,4]]},"DOI":"10.1007\/s10846-019-01022-0","type":"journal-article","created":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T15:04:15Z","timestamp":1557932655000},"page":"165-190","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Using Pre-Computed Knowledge for Goal Allocation in Multi-Agent Planning"],"prefix":"10.1007","volume":"98","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7989-1373","authenticated-orcid":false,"given":"Nerea","family":"Luis","sequence":"first","affiliation":[]},{"given":"Tiago","family":"Pereira","sequence":"additional","affiliation":[]},{"given":"Susana","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[]},{"given":"Ant\u00f3nio","family":"Moreira","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Borrajo","sequence":"additional","affiliation":[]},{"given":"Manuela","family":"Veloso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,15]]},"reference":[{"key":"1022_CR1","unstructured":"Ambite, J.L., Knoblock, C.A.: Planning by rewriting: Efficiently generating high-quality plans (1997)"},{"key":"1022_CR2","unstructured":"Borrajo, D.: Plan sharing for multi-agent planning. In: Nissim, R., Kovacs, D.L., Brafman, R. (eds.) Proceedings of the ICAPS\u201913 DMAP Workshop, pp 57\u201365 (2013)"},{"key":"1022_CR3","unstructured":"Borrajo, D, Fern\u00e1ndez, S: MAPR and CMAP. In: Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP-15). Jerusalem. http:\/\/agents.fel.cvut.cz\/codmap\/results\/CoDMAP15-proceedings.pdf (2015)"},{"key":"1022_CR4","first-page":"253","volume":"14","author":"D Borrajo","year":"2018","unstructured":"Borrajo, D., Fern\u00e1ndez, S: Efficient approaches for multi-agent planning. KAIS 14, 253\u2013302 (2018)","journal-title":"KAIS"},{"key":"1022_CR5","unstructured":"Borrajo, D, Veloso, M.M.: Probabilistically reusing plans in deterministic planning. In: Inproceedings of ICAPS\u201912 Workshop on Heuristics and Search for Domain Independent Planning (2012)"},{"issue":"2","key":"1022_CR6","doi-asserted-by":"publisher","first-page":"35,1","DOI":"10.1145\/2674024","volume":"47","author":"D Borrajo","year":"2015","unstructured":"Borrajo, D., Roub\u00ed\u010dkov\u00e1, A, Serina, I: Progress in case-based planning. ACM Comput Surv 47(2), 35,1\u201335,39 (2015). https:\/\/doi.org\/10.1145\/2674024","journal-title":"ACM Comput Surv"},{"key":"1022_CR7","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1016\/j.artint.2012.08.005 https:\/\/doi.org\/10.1016\/j.artint.2012.08.005","volume":"198","author":"RI Brafman","year":"2013","unstructured":"Brafman, R.I., Domshlak, C.: On the complexity of planning for agent teams and its implications for single agent planning. Artif. Intell. 198, 52\u201371 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.08.005","journal-title":"Artif. Intell."},{"issue":"3-4","key":"1022_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10472-010-9205-y","volume":"58","author":"V Conitzer","year":"2010","unstructured":"Conitzer, V.: Comparing multiagent systems research in combinatorial auctions and voting. AMAI 58(3-4), 239\u2013259 (2010). https:\/\/doi.org\/10.1007\/s10472-010-9205-y","journal-title":"AMAI"},{"key":"1022_CR9","doi-asserted-by":"crossref","unstructured":"Crosby, M.: Adp an agent decomposition planner. In: Proceedings of the CoDMAP-15, p. 4 (2015)","DOI":"10.1097\/01.NT.0000472967.33672.32"},{"key":"1022_CR10","doi-asserted-by":"crossref","unstructured":"Crosby, M., Rovatsos, M., Petrick, R.P.: Automated agent decomposition for classical planning. In: ICAPS (2013)","DOI":"10.1609\/icaps.v23i1.13564"},{"issue":"10","key":"1022_CR11","doi-asserted-by":"publisher","first-page":"1668","DOI":"10.1109\/TNN.2010.2070518","volume":"21","author":"J Faigl","year":"2010","unstructured":"Faigl, J.: Approximate solution of the multiple watchman routes problem with restricted visibility range. IEEE Trans. Neural Netw. 21(10), 1668\u201379 (2010)","journal-title":"IEEE Trans. Neural Netw."},{"key":"1022_CR12","unstructured":"Fikes, R.E., Nilsson, N.J.: Strips: A new approach to the application of theorem proving to problem solving. In: Proceedings of IJCAI, pp. 608\u2013620. http:\/\/dl.acm.org\/citation.cfm?id=1622876.1622939 (1971)"},{"issue":"2-3","key":"1022_CR13","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., Li, M., Yang, Q.: Theory and algorithms for plan merging. Artif. Intell. 57(2-3), 143\u2013181 (1992)","journal-title":"Artif. Intell."},{"key":"1022_CR14","doi-asserted-by":"crossref","unstructured":"Fox, M., Long, D.: PDDL2.1: An extension to PDDL for expressing temporal planning domains. JAIR 20 (2003)","DOI":"10.1613\/jair.1129"},{"key":"1022_CR15","unstructured":"Fox, M, Gerevini, A, Long, D, Serina, I: Plan stability: replanning versus plan repair. In: Proceedings of ICAPS\u201906, pp. 212\u2013221 (2006)"},{"issue":"12","key":"1022_CR16","doi-asserted-by":"publisher","first-page":"1258","DOI":"10.1016\/j.robot.2013.09.004","volume":"61","author":"E Galceran","year":"2013","unstructured":"Galceran, E., Carreras, M.: A survey on coverage path planning for robotics. Robot. Auton. Syst. 61(12), 1258\u20131276 (2013)","journal-title":"Robot. Auton. Syst."},{"key":"1022_CR17","doi-asserted-by":"crossref","unstructured":"Garc\u00eda-Olaya, A, de la Rosa, T., Borrajo, D.: Using the relaxed plan heuristic to select goals in oversubscription planning problems. In: Lozano, J.A., G\u00e1mez, J.A., Moreno, J.A. (eds.) Advances in Artificial Intelligence, pp 183\u2013192 (2011)","DOI":"10.1007\/978-3-642-25274-7_19"},{"issue":"9","key":"1022_CR18","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1177\/0278364904045564","volume":"23","author":"BP Gerkey","year":"2004","unstructured":"Gerkey, B.P., Matari\u0107, M: A formal analysis and taxonomy of task allocation in multi-robot systems. Int. J. Robot. Res. 23(9), 939\u2013954 (2004)","journal-title":"Int. J. Robot. Res."},{"key":"1022_CR19","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1613\/jair.855","volume":"14","author":"J Hoffmann","year":"2001","unstructured":"Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. JAIR 14, 253\u2013302 (2001)","journal-title":"JAIR"},{"key":"1022_CR20","unstructured":"Howey, R., Long, D., Fox, M.: VAL: Automatic plan validation, continuous effects and mixed initiative planning using PDDL. In: ICTAI 2004, pp. 294\u2013301 (2004)"},{"key":"1022_CR21","doi-asserted-by":"publisher","first-page":"5082","DOI":"10.1109\/ICRA.2013.6631303","volume":"1","author":"P Janousek","year":"2013","unstructured":"Janousek, P., Faigl, J.: Speeding up coverage queries in 3D multi-goal path planning. ICRA 1, 5082\u20135087 (2013). https:\/\/doi.org\/10.1109\/ICRA.2013.6631303","journal-title":"ICRA"},{"key":"1022_CR22","unstructured":"Kavraki, L, Latombe, J.C.: Randomized preprocessing of configuration for fast path planning. In: Proceedings of the International Conference on Robotics and Automation, pp. 2138\u20132145. IEEE (1994)"},{"key":"1022_CR23","doi-asserted-by":"publisher","unstructured":"Krulwich, B.: Planning for soft goals. In: Hendler, J (ed.) Artificial Intelligence Planning Systems, pp 289\u2013290 (1992). https:\/\/www.sciencedirect.com\/science\/article\/pii\/B9780080499444500471 , https:\/\/doi.org\/10.1016\/B978-0-08-049944-4.50047-1","DOI":"10.1016\/B978-0-08-049944-4.50047-1"},{"key":"1022_CR24","unstructured":"Luis, N, Borrajo, D: Plan merging by reuse for multi-agent planning. In: Proceedings of the 2nd ICAPS Distributed and Multi-Agent Planning Workshop (DMAP) (2014)"},{"key":"1022_CR25","doi-asserted-by":"crossref","unstructured":"Mali, A.D.: Plan merging & plan reuse as satisfiability. In: Proceedings of the 5th European Conference on Planning: Recent Advances in AI Planning. ECP\u201999, pp. 84\u201396 (2000)","DOI":"10.1007\/10720246_7"},{"key":"1022_CR26","unstructured":"Muise, C, Lipovetzky, N, Ramirez, M: MAP-LAPKT: Omnipotent multi-agent planning via compilation to classical planning. In: Competition of Distributed and Multiagent Planners. http:\/\/www.haz.ca\/papers\/muise_CoDMAP15.pdf (2015)"},{"key":"1022_CR27","doi-asserted-by":"crossref","unstructured":"Pereira, T., Veloso, M., Moreira, A.: Multi-robot planning using robot-dependent reachability maps. Springer (2015)","DOI":"10.1007\/978-3-319-27146-0_15"},{"key":"1022_CR28","doi-asserted-by":"crossref","unstructured":"Pereira, T., Veloso, M., Moreira, A.P.: Visibility maps for any-shape robots. In: IROS\u201916, the IEEE\/RSJ International Conference on Intelligent Robots and Systems, vol. 29, pp. 428\u2013459 (2016)","DOI":"10.1109\/IROS.2016.7759619"},{"key":"1022_CR29","doi-asserted-by":"publisher","unstructured":"Pereira, T, Luis, N, Moreira, A, Borrajo, D, Veloso, M, Fernandez, S: Heterogeneous multi-agent planning using actuation maps. In: 2018 IEEE International Conference on Autonomous Robot Systems and Competitions (ICARSC), pp. 219\u2013224. https:\/\/doi.org\/10.1109\/ICARSC.2018.8374186 (2018)","DOI":"10.1109\/ICARSC.2018.8374186"},{"key":"1022_CR30","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.2972","volume":"39","author":"S Richter","year":"2010","unstructured":"Richter, S., Westphal, M.: The LAMA planner: Guiding cost-based anytime planning with landmarks. JAIR 39, 127\u2013177 (2010)","journal-title":"JAIR"},{"key":"1022_CR31","unstructured":"Smith, D.E.: Choosing objectives in over-subscription planning. In: ICAPS (2004)"},{"key":"1022_CR32","doi-asserted-by":"crossref","unstructured":"\u0160tolba, M, Komenda, A, Kovacs, DL (eds.): Proceedings of the Competition of Distributed and Multi-Agent Planners (CoDMAP-15) (2015)","DOI":"10.1609\/aimag.v37i3.2658"},{"key":"1022_CR33","doi-asserted-by":"crossref","unstructured":"Thakur, D., Likhachev, M., Keller, J., Kumar, V., Dobrokhodov, V., Jones, K., Wurz, J.: Kaminer I (2013) Planning for opportunistic surveillance with multiple robots. In: IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), pp. 5750\u20135757. IEEE","DOI":"10.1109\/IROS.2013.6697189"},{"issue":"6","key":"1022_CR34","doi-asserted-by":"publisher","first-page":"84,1","DOI":"10.1145\/3128584","volume":"50","author":"A Torre\u00f1o","year":"2017","unstructured":"Torre\u00f1o, A, Onaindia, E., Komenda, A., \u0160tolba, M: Cooperative multi-agent planning: A survey. ACM Comput. Surv. 50(6), 84,1\u201384,32 (2017). https:\/\/doi.org\/10.1145\/3128584","journal-title":"ACM Comput. Surv."},{"key":"1022_CR35","unstructured":"Veloso, M.M., P\u00e9rez, M.A., Carbonell, J.G.: Nonlinear planning with parallel resource allocation. In: Proceedings of the DARPA Workshop on Innovative Approaches to Planning, Scheduling, and Control, pp. 207\u2013212. Morgan Kaufmann (1990)"},{"key":"1022_CR36","unstructured":"Vidal, V: YAHSP3 and YAHSP3-MT in the 8th international planning competition. In: In 8th International Planning Competition (IPC-2014), pp. 64\u201365 (2014)"}],"container-title":["Journal of Intelligent & Robotic Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-019-01022-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10846-019-01022-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10846-019-01022-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T16:08:21Z","timestamp":1694880501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10846-019-01022-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,15]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,4]]}},"alternative-id":["1022"],"URL":"https:\/\/doi.org\/10.1007\/s10846-019-01022-0","relation":{},"ISSN":["0921-0296","1573-0409"],"issn-type":[{"type":"print","value":"0921-0296"},{"type":"electronic","value":"1573-0409"}],"subject":[],"published":{"date-parts":[[2019,5,15]]},"assertion":[{"value":"24 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 May 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}