{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:59:33Z","timestamp":1787500773040,"version":"build-2736575974"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031389054","type":"print"},{"value":"9783031389061","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-38906-1_28","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T12:05:14Z","timestamp":1690459514000},"page":"430-443","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Shortest Coordinated Motion for\u00a0Square Robots"],"prefix":"10.1007","author":[{"given":"Guillermo","family":"Esteban","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dan","family":"Halperin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00edctor","family":"Ru\u00edz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vera","family":"Sacrist\u00e1n","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodrigo I.","family":"Silveira","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"28_CR1","volume-title":"Principles of Robot Motion: Theory, Algorithms, and Implementation","author":"H Choset","year":"2005","unstructured":"Choset, H., et al.: Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, Cambridge (2005)"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/2372560","volume":"79","author":"LE Dubins","year":"1957","unstructured":"Dubins, L.E.: On curves of minimal length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents. Am. J. Math. 79, 497\u2013516 (1957)","journal-title":"Am. J. Math."},{"key":"28_CR3","doi-asserted-by":"crossref","unstructured":"Eggleston, H.G.: Convexity (1966)","DOI":"10.1112\/jlms\/s1-41.1.183b"},{"key":"28_CR4","unstructured":"Halperin, D., Kavraki, L., Solovey, K.: Robotics. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C., (eds.), Handbook of Discrete and Computational Geometry, chapter 51, pp. 1343\u20131376. 3rd edn Chapman & Hall\/CRC (2018)"},{"key":"28_CR5","unstructured":"Halperin, D., Salzman, O., Sharir, M.: Algorithmic motion planning. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C., (eds.) Handbook of Discrete and Computational Geometry, chapter 50, pp. 1311\u20131342. 3rd edn Chapman & Hall\/CRC (2018)"},{"issue":"2","key":"28_CR6","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/BF01891839","volume":"10","author":"C Icking","year":"1993","unstructured":"Icking, C., Rote, G., Welzl, E., Yap, C.: Shortest paths for line segments. Algorithmica 10(2), 182\u2013200 (1993)","journal-title":"Algorithmica"},{"key":"28_CR7","unstructured":"Kirkpatrick, D.G., Liu, P.: Characterizing minimum-length coordinated motions for two discs. In Proceedings of 28th CCCG, pp. 252\u2013259 (2016)"},{"key":"28_CR8","unstructured":"Kirkpatrick, D.G., Liu, P.: Characterizing minimum-length coordinated motions for two discs. CoRR, abs\/1607.04005 (2016). http:\/\/arxiv.org\/1607.04005"},{"key":"28_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4022-9","volume-title":"Robot Motion Planning","author":"J-C Latombe","year":"1991","unstructured":"Latombe, J.-C.: Robot Motion Planning. Kluwer, Boston (1991)"},{"issue":"11","key":"28_CR10","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1177\/02783649922067753","volume":"18","author":"J-C Latombe","year":"1999","unstructured":"Latombe, J.-C.: Motion planning: a journey of robots, molecules, digital actors, and other artifacts. Int. J. Robot. Res. 18(11), 1119\u20131128 (1999)","journal-title":"Int. J. Robot. Res."},{"key":"28_CR11","volume-title":"LaValle","author":"M Steven","year":"2006","unstructured":"Steven, M.: LaValle. Cambridge University Press, Planning Algorithms (2006)"},{"key":"28_CR12","volume-title":"Lectures on Discrete Geometry","author":"J Matousek","year":"2013","unstructured":"Matousek, J.: Lectures on Discrete Geometry, vol. 212. Springer, Cham (2013)"},{"key":"28_CR13","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Goodman, J.E., O\u2019Rourke, J., T\u00f3th, C., (eds.), Handbook of Discrete and Computational Geometry, chapter 31, 3rd edn., pp. 811\u2013848. Chapman & Hall\/CRC (2018)"},{"issue":"2","key":"28_CR14","doi-asserted-by":"publisher","first-page":"367","DOI":"10.2140\/pjm.1990.145.367","volume":"145","author":"JA Reeds","year":"1990","unstructured":"Reeds, J.A., Shepp, L.A.: Optimal paths for a car that goes both forwards and backwards. Pac. J. Math. 145(2), 367\u2013393 (1990)","journal-title":"Pac. J. Math."},{"issue":"10","key":"28_CR15","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1145\/3318164","volume":"62","author":"O Salzman","year":"2019","unstructured":"Salzman, O.: Sampling-based robot motion planning. Commun. ACM 62(10), 54\u201363 (2019). https:\/\/doi.org\/10.1145\/3318164","journal-title":"Commun. ACM"},{"issue":"1","key":"28_CR16","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF01530889","volume":"3","author":"M Sharir","year":"1991","unstructured":"Sharir, M., Sifrony, S.: Coordinated motion planning for two independent robots. Ann. Math. Artif. Intell. 3(1), 107\u2013130 (1991). https:\/\/doi.org\/10.1007\/BF01530889","journal-title":"Ann. Math. Artif. Intell."},{"issue":"14","key":"28_CR17","doi-asserted-by":"publisher","first-page":"1750","DOI":"10.1177\/0278364916672311","volume":"35","author":"K Solovey","year":"2016","unstructured":"Solovey, K., Halperin, D.: On the hardness of unlabeled multi-robot motion planning. Int. J. Robot. Res. 35(14), 1750\u20131759 (2016). https:\/\/doi.org\/10.1177\/0278364916672311","journal-title":"Int. J. Robot. Res."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38906-1_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T12:08:44Z","timestamp":1690459724000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"28 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Algorithms and Data Structures Symposium","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Montreal, QC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Canada","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/wads.org\/","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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"47","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51% - 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 (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}