{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:11:02Z","timestamp":1760202662631},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319030883"},{"type":"electronic","value":"9783319030890"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-319-03089-0_21","type":"book-chapter","created":{"date-parts":[[2013,10,17]],"date-time":"2013-10-17T15:18:14Z","timestamp":1382023094000},"page":"296-310","source":"Crossref","is-referenced-by-count":6,"title":["Gathering Asynchronous Oblivious Agents with Restricted Vision in an Infinite Line"],"prefix":"10.1007","author":[{"given":"Samuel","family":"Guilbault","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"21_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N. Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots. SIAM J. Comput.\u00a036(1), 56\u201382 (2006)","journal-title":"SIAM J. Comput."},{"key":"21_CR2","unstructured":"Alpern, S., Gal, S.: The Theory of Search Games and Rendezvous. Kluwer Academic Publishers (2002)"},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1109\/70.795787","volume":"15","author":"H. Ando","year":"1999","unstructured":"Ando, H., Oasa, Y., Suzuki, I., Yamashita, M.: Distributed Memoryless Point Convergence Algorithm for Mobile Robots with Limited Visibility. IEEE Trans. on Robotics and Automation\u00a015(5), 818\u2013828 (1999)","journal-title":"IEEE Trans. on Robotics and Automation"},{"key":"21_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-15763-9_28","volume-title":"Distributed Computing","author":"E. Bampas","year":"2010","unstructured":"Bampas, E., Czyzowicz, J., G\u0105sieniec, L., Ilcinkas, D., Labourel, A.: Almost optimal asynchronous rendezvous in infinite multidimensional grids. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC 2010. LNCS, vol.\u00a06343, pp. 297\u2013311. Springer, Heidelberg (2010)"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1007\/978-3-540-24698-5_60","volume-title":"LATIN 2004: Theoretical Informatics","author":"M. Cieliebak","year":"2004","unstructured":"Cieliebak, M.: Gathering Non-oblivious Mobile Robots. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 577\u2013588. Springer, Heidelberg (2004)"},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1181","DOI":"10.1007\/3-540-45061-0_90","volume-title":"Automata, Languages and Programming","author":"M. Cieliebak","year":"2003","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Solving the Robots Gathering Problem. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 1181\u20131196. Springer, Heidelberg (2003)"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-27796-5_8","volume-title":"Structural Information and Communication Complexity","author":"R. Cohen","year":"2004","unstructured":"Cohen, R., Peleg, D.: Robot Convergence via Center-of-Gravity Algorithms. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 79\u201388. Springer, Heidelberg (2004)"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/2344422.2344427","volume":"8","author":"J. Czyzowicz","year":"2012","unstructured":"Czyzowicz, J., Labourel, A., Pelc, A.: How to meet asynchronously (almost) everywhere. ACM Transactions on Algorithms 8, article 37 (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"21_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1007\/978-3-642-33651-5_23","volume-title":"Distributed Computing","author":"G. D\u2019Angelo","year":"2012","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: How to gather asynchronous oblivious robots on anonymous rings. In: Aguilera, M.K. (ed.) DISC 2012. LNCS, vol.\u00a07611, pp. 326\u2013340. Springer, Heidelberg (2012)"},{"key":"21_CR10","unstructured":"Datta, A.K., Lamani, A., Larmore, L.L., Petit, F.: Ring exploration with oblivious myopic robots. CoRR abs\/1205.5003 (2012)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.tcs.2005.12.016","volume":"355","author":"G. Marco De","year":"2006","unstructured":"De Marco, G., Gargano, L., Kranakis, E., Krizanc, D., Pelc, A., Vaccaro, U.: Asynchronous deterministic rendezvous in graphs. Theoretical Computer Science\u00a0355, 315\u2013326 (2006)","journal-title":"Theoretical Computer Science"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-006-0074-2","volume":"46","author":"A. Dessmark","year":"2006","unstructured":"Dessmark, A., Fraigniaud, P., Kowalski, D., Pelc, A.: Deterministic rendezvous in graphs. Algorithmica\u00a046, 69\u201396 (2006)","journal-title":"Algorithmica"},{"key":"21_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1007\/978-3-540-24698-5_62","volume-title":"LATIN 2004: Theoretical Informatics","author":"P. Flocchini","year":"2004","unstructured":"Flocchini, P., Kranakis, E., Krizanc, D., Santoro, N., Sawchuk, C.: Multiple Mobile Agent Rendezvous in a Ring. In: Farach-Colton, M. (ed.) LATIN 2004. LNCS, vol.\u00a02976, pp. 599\u2013608. Springer, Heidelberg (2004)"},{"issue":"1-3","key":"21_CR14","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0337(1-3), 147\u2013168 (2005)","journal-title":"Theoretical Computer Science"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-22212-2_15","volume-title":"Structural Information and Communication Complexity","author":"S. Guilbault","year":"2011","unstructured":"Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. In: Kosowski, A., Yamashita, M. (eds.) SIROCCO 2011. LNCS, vol.\u00a06796, pp. 162\u2013173. Springer, Heidelberg (2011)"},{"key":"21_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/978-3-642-25873-2_29","volume-title":"Principles of Distributed Systems","author":"S. Guilbault","year":"2011","unstructured":"Guilbault, S., Pelc, A.: Asynchronous rendezvous of anonymous agents in arbitrary graphs. In: Fern\u00e0ndez Anta, A., Lipari, G., Roy, M. (eds.) OPODIS 2011. LNCS, vol.\u00a07109, pp. 421\u2013434. Springer, Heidelberg (2011)"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-13284-1_9","volume-title":"Structural Information and Communication Complexity","author":"T. Izumi","year":"2010","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Mobile robots gathering algorithm with local weak multiplicity in rings. In: Patt-Shamir, B., Ekim, T. (eds.) SIROCCO 2010. LNCS, vol.\u00a06058, pp. 101\u2013113. Springer, Heidelberg (2010)"},{"key":"21_CR18","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R. Klasing","year":"2010","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring. Theoretical Computer Science\u00a0411, 3235\u20133246 (2010)","journal-title":"Theoretical Computer Science"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R. Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science\u00a0390, 27\u201339 (2008)","journal-title":"Theoretical Computer Science"},{"key":"21_CR20","unstructured":"Prencipe, G.: CORDA: Distributed Coordination of a Set of Autonomous Mobile Robots. In: Proc. ERSADS 2001, pp. 185\u2013190 (2001)"},{"key":"21_CR21","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0384, 222\u2013231 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"21_CR22","doi-asserted-by":"publisher","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.\u00a028(4), 1347\u20131363 (1999)","journal-title":"SIAM J. Comput."}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-03089-0_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T19:38:25Z","timestamp":1558640305000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-03089-0_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783319030883","9783319030890"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-03089-0_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}