{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,12]],"date-time":"2025-09-12T19:31:50Z","timestamp":1757705510413,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031389054"},{"type":"electronic","value":"9783031389061"}],"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_2","type":"book-chapter","created":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:14Z","timestamp":1690473914000},"page":"15-28","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Mutual Visibility Problem for\u00a0Fat Robots"],"prefix":"10.1007","author":[{"given":"Rusul J.","family":"Alsaedi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6778-7990","authenticated-orcid":false,"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9294-9947","authenticated-orcid":false,"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,28]]},"reference":[{"key":"2_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 the 2013 ACM Symposium on Principles of Distributed Computing, pp. 250\u2013259 (2013)","DOI":"10.1145\/2484239.2484266"},{"key":"2_CR2","unstructured":"Alsaedi, R.J., Gudmundsson, J., van Renssen, A.: The mutual visibility problem for fat robots. ArXiv e-prints (2022). http:\/\/arxiv.org\/abs\/2206.14423"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Bolla, K., Kovacs, T., Fazekas, G.: Gathering of fat robots with limited visibility and without global navigation. In: Proceedings of the 2012 International Symposium on Swarm Intelligence and Differential Evolution, pp. 30\u201338 (2012)","DOI":"10.1007\/978-3-642-29353-5_4"},{"key":"2_CR4","doi-asserted-by":"publisher","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. Discrete Algorithms 33, 171\u2013192 (2015)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","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":"1\u20132","key":"2_CR6","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2008.02.007","volume":"399","author":"R Cohen","year":"2008","unstructured":"Cohen, R., Peleg, D.: Local spreading algorithms for autonomous robot systems. Theor. Comput. Sci. 399(1\u20132), 71\u201382 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1007\/978-3-642-18381-2_15","volume-title":"SOFSEM 2011: Theory and Practice of Computer Science","author":"A Cord-Landwehr","year":"2011","unstructured":"Cord-Landwehr, A., et al.: Collisionless gathering of robots with an extent. In: \u010cern\u00e1, I., et al. (eds.) SOFSEM 2011. LNCS, vol. 6543, pp. 178\u2013189. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18381-2_15"},{"issue":"6\u20137","key":"2_CR8","doi-asserted-by":"publisher","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\u20137), 481\u2013499 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2015.09.018","volume":"609","author":"S Das","year":"2016","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609, 171\u2013184 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"key":"2_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1007\/978-3-319-11764-5_11","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"GA Di Luna","year":"2014","unstructured":"Di Luna, G.A., Flocchini, P., Gan Chaudhuri, S., Santoro, N., Viglietta, G.: Robots with lights: overcoming obstructed visibility without colliding. In: Felber, P., Garg, V. (eds.) SSS 2014. LNCS, vol. 8756, pp. 150\u2013164. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11764-5_11"},{"key":"2_CR12","unstructured":"Di Luna, G.A., Flocchini, P., Poloni, F., Santoro, N., Viglietta, G.: The mutual visibility problem for oblivious robots. In: Proceedings of the 26th Canadian Conference on Computational Geometry (2014)"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-28073-3_8","volume-title":"Distributed Computing and Internet Technology","author":"A Dutta","year":"2012","unstructured":"Dutta, A., Gan Chaudhuri, S., Datta, S., Mukhopadhyaya, K.: Circle formation by asynchronous fat robots with limited visibility. In: Ramanujam, R., Ramaswamy, S. (eds.) ICDCIT 2012. LNCS, vol. 7154, pp. 83\u201393. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28073-3_8"},{"key":"2_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-319-19662-6_17","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"P Flocchini","year":"2015","unstructured":"Flocchini, P.: Computations by luminous robots. In: Papavassiliou, S., Ruehrup, S. (eds.) ADHOC-NOW 2015. LNCS, vol. 9143, pp. 238\u2013252. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19662-6_17"},{"issue":"2","key":"2_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-031-02008-7","volume":"3","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theory 3(2), 1\u2013185 (2012)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"key":"2_CR16","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). https:\/\/doi.org\/10.1007\/11603771_1"},{"key":"2_CR17","doi-asserted-by":"crossref","unstructured":"Poudel, P., Sharma, G., Aljohani, A.: Sublinear-time mutual visibility for fat oblivious robots. In: Proceedings of the 20th International Conference on Distributed Computing and Networking, pp. 238\u2013247 (2019)","DOI":"10.1145\/3288599.3288602"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Sharma, G., Alsaedi, R., Busch, C., Mukhopadhyay, S.: The complete visibility problem for fat robots with lights. In: Proceedings of the 19th International Conference on Distributed Computing and Networking, pp. 1\u20134 (2018)","DOI":"10.1145\/3154273.3154319"},{"key":"2_CR19","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Bounds on mutual visibility algorithms. In: Proceedings of the 27th Canadian Conference on Computational Geometry, pp. 268\u2013274 (2015)"},{"key":"2_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-319-28472-9_15","volume-title":"Algorithms for Sensor Systems","author":"G Sharma","year":"2015","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: Mutual visibility with an optimal number of colors. In: Bose, P., G\u0105sieniec, L.A., R\u00f6mer, K., Wattenhofer, R. (eds.) ALGOSENSORS 2015. LNCS, vol. 9536, pp. 196\u2013210. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-28472-9_15"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S.: How to make fat autonomous robots see all others fast? In: Proceedings of the 2018 IEEE International Conference on Robotics and Automation, pp. 3730\u20133735 (2018)","DOI":"10.1109\/ICRA.2018.8460899"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3056460","volume":"12","author":"G Sharma","year":"2017","unstructured":"Sharma, G., Busch, C., Mukhopadhyay, S., Malveaux, C.: Tight analysis of a collisionless robot gathering algorithm. ACM Trans. Auton. Adapt. Syst. 12, 1\u201320 (2017)","journal-title":"ACM Trans. Auton. Adapt. Syst."},{"key":"2_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-319-69084-1_18","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"G Sharma","year":"2017","unstructured":"Sharma, G., Vaidyanathan, R., Trahan, J.L.: Constant-time complete visibility for\u00a0asynchronous robots with lights. In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 265\u2013281. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_18"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Vaidyanathan, R., Busch, C., Trahan, J.L., Sharma, G., Rai, S.: Logarithmic-time complete visibility for robots with lights. In: Proceedings of the 2015 IEEE International Parallel and Distributed Processing Symposium, pp. 375\u2013384 (2015)","DOI":"10.1109\/IPDPS.2015.52"}],"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_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,27]],"date-time":"2023-07-27T16:05:39Z","timestamp":1690473939000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38906-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031389054","9783031389061"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38906-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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)"}}]}}