{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T11:56:00Z","timestamp":1726055760866},"publisher-location":"Cham","reference-count":38,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030319922"},{"type":"electronic","value":"9783030319939"}],"license":[{"start":{"date-parts":[[2019,10,26]],"date-time":"2019-10-26T00:00:00Z","timestamp":1572048000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-31993-9_18","type":"book-chapter","created":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T10:48:15Z","timestamp":1576666095000},"page":"364-383","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Randomized Searching for Multi-robot Coordination"],"prefix":"10.1007","author":[{"given":"Jakub","family":"Hv\u011bzda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miroslav","family":"Kulich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Libor","family":"P\u0159eu\u010dil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,26]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Bennewitz M, Burgard W, Thrun S (2001) Optimizing schedules for prioritized path planning of multi-robot systems. In: IEEE international conference on robotics and automation, proceedings 2001 ICRA, vol 1, pp 271\u2013276","DOI":"10.1109\/ROBOT.2001.932565"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"van\u00a0den Berg J, Overmars M (2005) Prioritized motion planning for multiple robots. In: 2005 IEEE\/RSJ international conference on intelligent robots and systems. IEEE, pp 430\u2013435","DOI":"10.1109\/IROS.2005.1545306"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"van\u00a0den Berg J, Snoeyink J, Lin MC, Manocha D (2009) Centralized path planning for multiple robots: optimal decoupling into sequential plans. In: Trinkle J, Matsuoka Y, Castellanos JA (eds) Robotics: science and systems V, University of Washington, Seattle, USA, 28 June\u20131 July 2009. The MIT Press","DOI":"10.15607\/RSS.2009.V.018"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Cap M, Novak P, Kleiner A, Selecky M, Pechoucek M (2015) Prioritized planning algorithms for trajectory coordination of multiple mobile robots. IEEE Trans Autom Sci Eng Spec Is (2015)","DOI":"10.1109\/TASE.2015.2445780"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s12351-010-0093-z","volume":"12","author":"K Chiew","year":"2010","unstructured":"Chiew K (2010) Scheduling and routing of autonomous moving objects on a mesh topology. Oper Res Int J 12(3):385\u2013397","journal-title":"Oper Res Int J"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1613\/jair.4447","volume":"51","author":"B DeWilde","year":"2014","unstructured":"DeWilde B, Ter Mors A, Witteveen C (2014) Push and rotate: a complete multi-agent pathfinding algorithm. J Artif Intell Res 51:443\u2013492","journal-title":"J Artif Intell Res"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Dobson A, Solovey K, Shome R, Halperin D, Bekris KE (2017) Scalable asymptotically-optimal multi-robot motion planning. In: 2017 international symposium on multi-robot and multi-agent systems (MRS), pp 120\u2013127, December 2017","DOI":"10.1109\/MRS.2017.8250940"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Doriya R, Mishra S, Gupta S (2015) A brief survey and analysis of multi-robot communication and coordination. In: International conference on computing, communication automation, pp 1014\u20131021, May 2015","DOI":"10.1109\/CCAA.2015.7148524"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Gawrilow E, K\u00f6hler E, M\u00f6hring RH, Stenzel B (2008) Dynamic routing of automated guided vehicles in real-time. Springer, Heidelberg, pp 165\u2013177","DOI":"10.1007\/978-3-540-77203-3_12"},{"key":"18_CR10","unstructured":"Geramifard A, Chubak P, Bulitko V (2006) Biased cost pathfinding. In: AAAI conference on artificial intelligence and interactive digital entertainment, pp 112\u2013114"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Goldreich O (2011) Finding the shortest move-sequence in the graph-generalized 15-puzzle is NP-hard. In: Goldreich O (ed) Studies in complexity and cryptography. Miscellanea on the Interplay between randomness and computation - in collaboration with Avigad L, Bellare M, Brakerski Z, Goldwasser S, Halevi S, Kaufman T, Levin L, Nisan N, Ron D, Lecture Notes in Computer Science, vol 6650. Springer, pp 1\u20135","DOI":"10.1007\/978-3-642-22670-0_1"},{"issue":"4","key":"18_CR12","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1177\/027836498400300405","volume":"3","author":"J Hopcroft","year":"1984","unstructured":"Hopcroft J, Schwartz J, Sharir M (1984) On the complexity of motion planning for multiple independent objects; PSPACE-hardness of the \u201cWarehouseman\u2019s Problem\u201d. Int J Rob Res 3(4):76\u201388","journal-title":"Int J Rob Res"},{"key":"18_CR13","unstructured":"Hv\u011bzda J, Kulich M, P\u0159eu\u010dil L (2018) Improved discrete RRT for coordinated multi-robot planning. In: Proceedings of the 15th international conference on informatics in control, automation and robotics, ICINCO 2018 - vol 2, pp 181\u2013189"},{"key":"18_CR14","unstructured":"Hv\u011bzda J, Rybeck\u00fd T, Kulich M, P\u0159eu\u010dil L Context-aware route planning for automated warehouses. In: 21st IEEE international conference on intelligent transportation systems (in press)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Karaman S, Frazzoli E (2010) Incremental sampling-based algorithms for optimal motion planning. CoRR abs\/1005.0416","DOI":"10.15607\/RSS.2010.VI.034"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Karaman S, Frazzoli E (2011) Sampling-based algorithms for optimal motion planning. CoRR abs\/1105.1186","DOI":"10.1177\/0278364911406761"},{"key":"18_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot motion planning","author":"JC Latombe","year":"1991","unstructured":"Latombe JC (1991) Robot motion planning. Kluwer Academic Publishers, Norwell"},{"issue":"6","key":"18_CR18","doi-asserted-by":"publisher","first-page":"912","DOI":"10.1109\/70.736775","volume":"14","author":"S LaValle","year":"1998","unstructured":"LaValle S, Hutchinson S (1998) Optimal motion planning for multiple robots having independent goals. IEEE Trans Robot Autom 14(6):912\u2013925","journal-title":"IEEE Trans Robot Autom"},{"key":"18_CR19","unstructured":"Lavalle SM (1998) Rapidly-exploring random trees: a new tool for path planning. Technical report, Computer Science Deptartment, Iowa State University, 11"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Luna R, Bekris KE (2011) Efficient and complete centralized multi-robot path planning. In: 2011 IEEE\/RSJ international conference on intelligent robots and systems. IEEE, pp 3268\u20133275, September 2011","DOI":"10.1109\/IROS.2011.6095085"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"ter Mors A (2011) Evaluating heuristics for prioritizing context-aware route planning agents. In: International conference on networking, sensing and control, pp 127\u2013132, April 2011","DOI":"10.1109\/ICNSC.2011.5874899"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"ter Mors A, Witteveen C, Ipema C, de\u00a0Nijs F, Tsiourakis T (2012) Empirical evaluation of multi-agent routing approaches. In: 2012 IEEE\/WIC\/ACM international conferences on web intelligence and intelligent agent technology, vol\u00a02, pp 305\u2013309, December 2012","DOI":"10.1109\/WI-IAT.2012.198"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-16178-0_14","volume-title":"Multiagent system technologies","author":"AW Mors ter","year":"2010","unstructured":"ter Mors AW, Witteveen C, Zutt J, Kuipers FA (2010) Context-aware route planning. In: Dix J, Witteveen C (eds) Multiagent system technologies. Springer, Heidelberg, pp 138\u2013149"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell PA, Lozano-Perez T (1989) Deadlock-free and collision-free coordination of two robot manipulators. In: IEEE robotics and automation conference, pp 484\u2013489","DOI":"10.1109\/ROBOT.1989.100033"},{"key":"18_CR25","doi-asserted-by":"publisher","first-page":"5783","DOI":"10.1007\/978-0-387-30440-3_344","volume-title":"Encyclopedia of Complexity and Systems Science","author":"Lynne E. Parker","year":"2009","unstructured":"Parker LE (2009) Path planning and motion coordination in multiple mobile robot teams. In: Encyclopedia of complexity and system science (2009)"},{"issue":"2","key":"18_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1109\/TRO.2008.918056","volume":"24","author":"M Peasgood","year":"2008","unstructured":"Peasgood M, Clark CM, McPhee J (2008) A complete and scalable strategy for coordinating multiple robots within roadmaps. IEEE Trans Rob 24(2):283\u2013292","journal-title":"IEEE Trans Rob"},{"key":"18_CR27","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"M. R.K. Ryan","year":"2008","unstructured":"Ryan MR (2008) Exploiting subgraph structure in multi-robot path planning. J Artif Intell Res, pp 497\u2013542","journal-title":"Journal of Artificial Intelligence Research"},{"key":"18_CR28","unstructured":"Selman B, Levesque H, Mitchell D (1992) A new method for solving hard satisfiability problems. In: Proceedings of the tenth national conference on artificial intelligence, AAAI 1992. AAAI Press, pp 440\u2013446"},{"key":"18_CR29","unstructured":"Silver D (2005) Cooperative pathfinding. In: The 1st conference on artificial intelligence and interactive digital entertainment, pp 117\u2013122"},{"issue":"1","key":"18_CR30","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1109\/70.988973","volume":"18","author":"T Simeon","year":"2002","unstructured":"Simeon T, Leroy S, Lauumond JP (2002) Path coordination for multiple mobile robots: a resolution-complete algorithm. IEEE Trans Robot Autom 18(1):42\u201349","journal-title":"IEEE Trans Robot Autom"},{"key":"18_CR31","unstructured":"Solovey K, Salzman O, Halperin D (2014) Finding a needle in an exponential haystack: discrete RRT for exploration of implicit roadmaps in multi-robot motion planning. Algorithmic Found Rob XI:591\u2013607"},{"issue":"2","key":"18_CR32","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1002\/net.3230040204","volume":"4","author":"J. W. Suurballe","year":"1974","unstructured":"Suurballe J (1974) Disjoint paths in a network 4:125\u2013145","journal-title":"Networks"},{"key":"18_CR33","unstructured":"Wang KC, Botea A (2011) MAPP: a scalable multi-agent path planning algorithm with tractability and completeness guarantees. J Artif Intell Res, pp 55\u201390"},{"key":"18_CR34","unstructured":"Wang KHC, Botea A (2008) Fast and memory-efficient multi-agent pathfinding. In: ICAPS, pp 380\u2013387"},{"key":"18_CR35","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-27216-5_22","volume-title":"Advanced agent technology","author":"W Wang","year":"2012","unstructured":"Wang W, Goh WB (2012) Multi-robot path planning with the spatio-temporal A* algorithm and its variants. In: Dechesne F, Hattori H, ter Mors A, Such JM, Weyns D, Dignum F (eds) Advanced agent technology. Springer, Heidelberg, pp 313\u2013329"},{"key":"18_CR36","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/j.asoc.2015.01.046","volume":"30","author":"W Wang","year":"2015","unstructured":"Wang W, Goh WB (2015) A stochastic algorithm for makespan minimized multi-agent path planning in discrete space. Appl Soft Comput 30:287\u2013304","journal-title":"Appl Soft Comput"},{"issue":"11","key":"18_CR37","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1287\/mnsc.17.11.712","volume":"17","author":"JY Yen","year":"1971","unstructured":"Yen JY (1971) Finding the k shortest loopless paths in a network. Manage Sci 17(11):712\u2013716","journal-title":"Manage Sci"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Zhang T, Ding M, Wang B, Chen Q (2015) Conflict-free time-based trajectory planning for aircraft taxi automation with refined taxiway modeling 50","DOI":"10.1002\/atr.1324"}],"container-title":["Lecture Notes in Electrical Engineering","Informatics in Control, Automation and Robotics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31993-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,18]],"date-time":"2019-12-18T10:50:07Z","timestamp":1576666207000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31993-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,26]]},"ISBN":["9783030319922","9783030319939"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31993-9_18","relation":{},"ISSN":["1876-1100","1876-1119"],"issn-type":[{"type":"print","value":"1876-1100"},{"type":"electronic","value":"1876-1119"}],"subject":[],"published":{"date-parts":[[2019,10,26]]},"assertion":[{"value":"26 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICINCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Informatics in Control, Automation and Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icinco2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icinco.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}