{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T08:31:08Z","timestamp":1743150668435,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030039271"},{"type":"electronic","value":"9783030039288"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03928-8_24","type":"book-chapter","created":{"date-parts":[[2018,11,8]],"date-time":"2018-11-08T11:21:01Z","timestamp":1541676061000},"page":"290-301","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Multi-agent Path Finding on Real Robots: First Experience with Ozobots"],"prefix":"10.1007","author":[{"given":"Roman","family":"Bart\u00e1k","sequence":"first","affiliation":[]},{"given":"Ji\u0159\u00ed","family":"\u0160vancara","sequence":"additional","affiliation":[]},{"given":"V\u011bra","family":"\u0160kopkov\u00e1","sequence":"additional","affiliation":[]},{"given":"David","family":"Nohejl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","unstructured":"Atzmon, D., Felner, A., Stern, R., Wagner, G., Bart\u00e1k, R., Zhou, N.: k-robust multi-agent path finding. In: Fukunaga, A., Kishimoto, A. (eds.) Proceedings of the Tenth International Symposium on Combinatorial Search, 16\u201317 June 2017, Pittsburgh, Pennsylvania, USA, pp. 157\u2013158. AAAI Press (2017). https:\/\/aaai.org\/ocs\/index.php\/SOCS\/SOCS17\/paper\/view\/15797"},{"key":"24_CR2","unstructured":"Bart\u00e1k, R., \u0160vancara, J., Vlk, M.: A scheduling-based approach to multi-agent path finding with weighted and capacitated arcs. In: Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2018, Stockholm, Sweden, 11\u201313 July 2018, pp. 748\u2013756. International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC (2018). http:\/\/dl.acm.org\/citation.cfm?id=3237383.3237494"},{"key":"24_CR3","doi-asserted-by":"publisher","unstructured":"Bart\u00e1k, R., Zhou, N.F., Stern, R., Boyarski, E., Surynek, P.: Modeling and solving the multi-agent pathfinding problem in picat. In: 29th IEEE International Conference on Tools with Artificial Intelligence (ICTAI), pp. 959\u2013966. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ICTAI.2017.00147","DOI":"10.1109\/ICTAI.2017.00147"},{"key":"24_CR4","unstructured":"Boyarski, E., et al.: ICBS: the improved conflict-based search algorithm for multi-agent pathfinding. In: Lelis, L., Stern, R. (eds.) Proceedings of the Eighth Annual Symposium on Combinatorial Search, SOCS 2015, Ein Gedi, the Dead Sea, Israel, 11\u201313 June 2015, pp. 223\u2013225. AAAI Press (2015). http:\/\/www.aaai.org\/ocs\/index.php\/SOCS\/SOCS15\/paper\/view\/10974"},{"key":"24_CR5","unstructured":"desJardins, M., Littman, M.L. (eds.): Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, Bellevue, Washington, USA, 14\u201318 July 2013. AAAI Press (2013). http:\/\/www.aaai.org\/Library\/AAAI\/aaai13contents.php"},{"key":"24_CR6","unstructured":"Erdem, E., Kisa, D.G., \u00d6ztok, U., Sch\u00fcller, P.: A general formal framework for pathfinding problems with multiple agents. In: desJardins, Littman [5]. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI13\/paper\/view\/6293"},{"key":"24_CR7","unstructured":"Evollve Inc., Ozobot & OzoBlockly: Welcome to OzoBlockly (2015). https:\/\/ozoblockly.com\/"},{"key":"24_CR8","unstructured":"Kautz, H.A., Selman, B.: Planning as satisfiability. In: ECAI, pp. 359\u2013363 (1992). https:\/\/dl.acm.org\/citation.cfm?id=146725"},{"key":"24_CR9","unstructured":"Ozobot & Evollve Inc.: Ozobot\u2014Robots to code, create, and connect with (2018). https:\/\/ozobot.com\/"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1613\/jair.2408","volume":"31","author":"MRK Ryan","year":"2008","unstructured":"Ryan, M.R.K.: Exploiting subgraph structure in multi-robot path planning. J. Artif. Intell. Res. 31, 497\u2013542 (2008). https:\/\/doi.org\/10.1613\/jair.2408","journal-title":"J. Artif. Intell. Res."},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.artint.2014.11.006","volume":"219","author":"G Sharon","year":"2015","unstructured":"Sharon, G., Stern, R., Felner, A., Sturtevant, N.R.: Conflict-based search for optimal multi-agent pathfinding. Artif. Intell. 219, 40\u201366 (2015). https:\/\/doi.org\/10.1016\/j.artint.2014.11.006","journal-title":"Artif. Intell."},{"key":"24_CR12","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.artint.2012.11.006","volume":"195","author":"G Sharon","year":"2013","unstructured":"Sharon, G., Stern, R., Goldenberg, M., Felner, A.: The increasing cost tree search for optimal multi-agent pathfinding. Artif. Intell. 195, 470\u2013495 (2013). https:\/\/doi.org\/10.1016\/j.artint.2012.11.006","journal-title":"Artif. Intell."},{"key":"24_CR13","unstructured":"Standley, T.S.: Finding optimal solutions to cooperative pathfinding problems. In: Fox, M., Poole, D. (eds.) Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, AAAI 2010, Atlanta, Georgia, USA, 11\u201315 July 2010. AAAI Press (2010). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI10\/paper\/view\/1926"},{"key":"24_CR14","doi-asserted-by":"publisher","unstructured":"Surynek, P.: On propositional encodings of cooperative path-finding. In: IEEE 24th International Conference on Tools with Artificial Intelligence, ICTAI 2012, Athens, Greece, 7\u20139 November 2012, pp. 524\u2013531. IEEE Computer Society (2012). https:\/\/doi.org\/10.1109\/ICTAI.2012.77","DOI":"10.1109\/ICTAI.2012.77"},{"key":"24_CR15","doi-asserted-by":"publisher","unstructured":"Surynek, P.: Compact representations of cooperative path-finding as SAT based on matchings in bipartite graphs. In: 26th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2014, Limassol, Cyprus, 10\u201312 November 2014, pp. 875\u2013882. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/ICTAI.2014.134","DOI":"10.1109\/ICTAI.2014.134"},{"key":"24_CR16","doi-asserted-by":"publisher","unstructured":"Yu, J., LaValle, S.M.: Planning optimal paths for multiple robots on graphs. In: 2013 IEEE International Conference on Robotics and Automation, ICRA 2013, pp. 3612\u20133617, May 2013. https:\/\/doi.org\/10.1109\/ICRA.2013.6631084","DOI":"10.1109\/ICRA.2013.6631084"},{"key":"24_CR17","unstructured":"Yu, J., LaValle, S.M.: Structure and intractability of optimal multi-robot path planning on graphs. In: desJardins, Littman [5]. http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI13\/paper\/view\/6111"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence \u2013 IBERAMIA 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03928-8_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T18:04:27Z","timestamp":1729361067000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-03928-8_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030039271","9783030039288"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03928-8_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"IBERAMIA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ibero-American Conference on Artificial Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trujillo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","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":"13 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iberamia2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iberamia.org\/iberamia\/iberamia2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"92","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"45% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}