{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:28Z","timestamp":1725879688760},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_4","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"37-49","source":"Crossref","is-referenced-by-count":3,"title":["Optimum Gathering of Asynchronous Robots"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Bhagat","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnendu","family":"Mukhopadhyaya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: Proceedings of ACM Symposium on Principles of Distributed Computing (PODC), pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/j.jda.2015.10.005","volume":"36","author":"S Bhagat","year":"2016","unstructured":"Bhagat, S., Chaudhuri, S.G., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discret. Algorithms 36, 50\u201362 (2016)","journal-title":"J. Discret. Algorithms"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-25258-2_22","volume-title":"Structural Information and Communication Complexity","author":"Q Bramas","year":"2015","unstructured":"Bramas, Q., Tixeuil, S.: Wait-free gathering without chirality. In: Scheideler, C. (ed.) Structural Information and Communication Complexity. LNCS, vol. 9439, pp. 313\u2013327. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-25258-2_22"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.jda.2015.04.001","volume":"33","author":"SG Chaudhuri","year":"2015","unstructured":"Chaudhuri, S.G., Mukhopadhyaya, K.: Leader election and gathering for asynchronous fat robots without common chirality. J. Discret. Algorithms 33, 171\u2013192 (2015)","journal-title":"J. Discret. Algorithms"},{"key":"4_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/978-3-319-18173-8_9","volume-title":"Algorithms and Complexity","author":"S Cicerone","year":"2015","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Minmax-distance gathering on given meeting points. In: Paschos, V.T., Widmayer, P. (eds.) CIAC 2015. LNCS, vol. 9079, pp. 127\u2013139. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-18173-8_9"},{"issue":"4","key":"4_CR6","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"4_CR7","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","volume":"410","author":"J Czyzowicz","year":"2009","unstructured":"Czyzowicz, J., Gasieniec, L., Pelc, A.: Gathering few fat mobile robots in the plane. Theor. Comput. Sci. 410(6), 481\u2013499 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: The power of lights: synchronizing asynchronous robots using visible bits. In: Proceedings of IEEE 32nd International Conference on Distributed Computing Systems (ICDCS), pp. 506\u2013515 (2012)","DOI":"10.1109\/ICDCS.2012.71"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/11864219_4","volume-title":"Distributed Computing","author":"X D\u00e9fago","year":"2006","unstructured":"D\u00e9fago, X., Gradinariu, M., Messika, S., Raipin-Parv\u00e9dy, P.: Fault-tolerant and self-stabilizing mobile robots gathering. In: Dolev, S. (ed.) DISC 2006. LNCS, vol. 4167, pp. 46\u201360. Springer, Heidelberg (2006). doi: 10.1007\/11864219_4"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. In: Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)","DOI":"10.2200\/S00440ED1V01Y201208DCT010"},{"issue":"1\u20133","key":"4_CR11","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","volume":"337","author":"P Flocchini","year":"2005","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous robots with limited visibility. Theor. Comput. Sci. 337(1\u20133), 147\u2013168 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-319-03578-9_16","volume-title":"Structural Information and Communication Complexity","author":"P Flocchini","year":"2013","unstructured":"Flocchini, P., Santoro, N., Viglietta, G., Yamashita, M.: Rendezvous of two robots with constant memory. In: Moscibroda, T., Rescigno, A.A. (eds.) SIROCCO 2013. LNCS, vol. 8179, pp. 189\u2013200. Springer, Heidelberg (2013). doi: 10.1007\/978-3-319-03578-9_16"},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11603771_1","volume-title":"Distributed Computing \u2013 IWDC 2005","author":"D Peleg","year":"2005","unstructured":"Peleg, D.: Distributed coordination algorithms for mobile robot swarms: new directions and challenges. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds.) IWDC 2005. LNCS, vol. 3741, pp. 1\u201312. Springer, Heidelberg (2005). doi: 10.1007\/11603771_1"},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-45446-2_10","volume-title":"Theoretical Computer Science","author":"G Prencipe","year":"2001","unstructured":"Prencipe, G.: Instantaneous actions vs. full asynchronicity: controlling and coordinating a Sset of autonomous mobile robots. In: Restivo, A., Della Rocca, S.R., Roversi, L. (eds.) ICTCS 2001. LNCS, vol. 2202, pp. 154\u2013171. Springer, Heidelberg (2001). doi: 10.1007\/3-540-45446-2_10"},{"issue":"2\u20133","key":"4_CR15","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","volume":"384","author":"G Prencipe","year":"2007","unstructured":"Prencipe, G.: Impossibility of gathering by a set of autonomous mobile robots. Theor. Comput. Sci. 384(2\u20133), 222\u2013231 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"4_CR16","unstructured":"Suzuki, I., Yamashita, M.: Formation and agreement problems for anonymous mobile robots. In: Proceedings of 31st Annual Conference on Communication, Control and Computing, pp. 93\u2013102 (1993)"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28, 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1007\/978-3-642-45346-5_21","volume-title":"Algorithms for Sensor Systems","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Rendezvous of two robots with visible bits. In: Flocchini, P., Gao, J., Kranakis, E., Meyer auf der Heide, F. (eds.) ALGOSENSORS 2013. LNCS, vol. 8243, pp. 291\u2013306. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-45346-5_21"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:19Z","timestamp":1498368919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}