{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,3]],"date-time":"2024-08-03T05:52:20Z","timestamp":1722664340873},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,7,1]],"date-time":"2019-07-01T00:00:00Z","timestamp":1561939200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001409","name":"DST","doi-asserted-by":"publisher","award":["SR\/S3\/EECE\/0011\/2010"],"id":[{"id":"10.13039\/501100001409","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001412","name":"CSIR","doi-asserted-by":"publisher","award":["9\/93(0\/24)\/2010ENGG"],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Discrete Algorithms"],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1016\/j.jda.2015.04.001","type":"journal-article","created":{"date-parts":[[2015,4,18]],"date-time":"2015-04-18T02:02:54Z","timestamp":1429322574000},"page":"171-192","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":21,"special_numbering":"C","title":["Leader election and gathering for asynchronous fat robots without common chirality"],"prefix":"10.1016","volume":"33","author":[{"given":"Sruti","family":"Gan Chaudhuri","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0001-6292-8961","authenticated-orcid":false,"given":"Krishnendu","family":"Mukhopadhyaya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.jda.2015.04.001_br0010","series-title":"Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing","first-page":"250","article-title":"A distributed algorithm for gathering many fat mobile robots in the plane","author":"Agathangelou","year":"2013"},{"key":"10.1016\/j.jda.2015.04.001_br0020","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/050645221","article-title":"Fault-tolerant gathering algorithms for autonomous mobile robots","volume":"36","author":"Agmon","year":"2006","journal-title":"SIAM J. Comput."},{"issue":"5","key":"10.1016\/j.jda.2015.04.001_br0030","doi-asserted-by":"crossref","first-page":"818","DOI":"10.1109\/70.795787","article-title":"Distributed memoryless point convergence algorithm for mobile robots with limited visibility","volume":"15","author":"Ando","year":"1999","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/j.jda.2015.04.001_br0040","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/BF02187906","article-title":"The algebraic degree of geometric optimization problems","volume":"3","author":"Bajaj","year":"1988","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"10.1016\/j.jda.2015.04.001_br0050","doi-asserted-by":"crossref","first-page":"926","DOI":"10.1109\/70.736776","article-title":"Behavior-based formation control for multirobot teams","volume":"14","author":"Balch","year":"1998","journal-title":"IEEE Trans. Robot. Autom."},{"key":"10.1016\/j.jda.2015.04.001_br0060","series-title":"Robotics and Automation","first-page":"1914","article-title":"Theoretical problems for the realization of distributed robotic systems","volume":"vol. 3","author":"Beni","year":"1991"},{"key":"10.1016\/j.jda.2015.04.001_br0070","series-title":"Computational Geometry: Algorithms and Applications","author":"Berg","year":"2008"},{"key":"10.1016\/j.jda.2015.04.001_br0080","series-title":"Swarm and Evolutionary Computation","first-page":"30","article-title":"Gathering of fat robots with limited visibility and without global navigation","volume":"vol. 7269","author":"Bolla","year":"2012"},{"issue":"4","key":"10.1016\/j.jda.2015.04.001_br0090","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1137\/100796534","article-title":"Distributed computing by mobile robots: gathering","volume":"41","author":"Cieliebak","year":"2012","journal-title":"SIAM J. Comput."},{"issue":"6","key":"10.1016\/j.jda.2015.04.001_br0100","doi-asserted-by":"crossref","first-page":"1516","DOI":"10.1137\/S0097539704446475","article-title":"Convergence properties of the gravitational algorithm in asynchronous robot systems","volume":"34","author":"Cohen","year":"2005","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.jda.2015.04.001_br0110","series-title":"SOFSEM 2011: Theory and Practice of Computer Science","first-page":"178","article-title":"Collisionless gathering of robots with an extent","volume":"vol. 6543","author":"Cord-Landwehr","year":"2011"},{"issue":"6\u20137","key":"10.1016\/j.jda.2015.04.001_br0120","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1016\/j.tcs.2008.10.005","article-title":"Gathering few fat mobile robots in the plane","volume":"410","author":"Czyzowicz","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2015.04.001_br0130","series-title":"Principles of Distributed Systems","first-page":"132","article-title":"Deterministic leader election in anonymous sensor networks without common coordinated system","volume":"vol. 4878","author":"Dieudonn\u00e9","year":"2007"},{"key":"10.1016\/j.jda.2015.04.001_br0140","series-title":"Proceedings of the 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing","first-page":"404","article-title":"Brief announcement: leader election vs pattern formation","author":"Dieudonn\u00e9","year":"2010"},{"key":"10.1016\/j.jda.2015.04.001_br0150","series-title":"Distributed Computing","first-page":"267","article-title":"Leader election problem versus pattern formation problem","volume":"vol. 6343","author":"Dieudonn\u00e9","year":"2010"},{"issue":"14","key":"10.1016\/j.jda.2015.04.001_br0160","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1016\/j.tcs.2008.04.042","article-title":"Distributed algorithms for partitioning a swarm of autonomous mobile robots","volume":"410","author":"Efrima","year":"2009","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2015.04.001_br0170","series-title":"Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory","doi-asserted-by":"crossref","author":"Flocchini","year":"2012","DOI":"10.1007\/978-3-031-02008-7"},{"key":"10.1016\/j.jda.2015.04.001_br0180","series-title":"Algorithms and Computation","first-page":"93","article-title":"Hard tasks for weak robots: the role of common knowledge in pattern formation by autonomous mobile robots","volume":"vol. 1741","author":"Flocchini","year":"1999"},{"key":"10.1016\/j.jda.2015.04.001_br0190","series-title":"Intelligent Vehicles Symposium, 2000. IV 2000","first-page":"480","article-title":"Distributed coordination of a set of autonomous mobile robots","author":"Flocchini","year":"2000"},{"key":"10.1016\/j.jda.2015.04.001_br0200","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.tcs.2005.01.001","article-title":"Gathering of asynchronous robots with limited visibility","volume":"337","author":"Flocchini","year":"2005","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20133","key":"10.1016\/j.jda.2015.04.001_br0210","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","article-title":"Arbitrary pattern formation by asynchronous, anonymous, oblivious robots","volume":"407","author":"Flocchini","year":"2008","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jda.2015.04.001_br0220","series-title":"Distributed Computing and Internet Technology","first-page":"170","article-title":"Gathering asynchronous transparent fat robots","volume":"vol. 5966","author":"Gan Chaudhuri","year":"2010"},{"key":"10.1016\/j.jda.2015.04.001_br0230","series-title":"Ant Colony Optimization and Swarm Intelligence","first-page":"72","article-title":"Gathering multiple robotic agents with crude distance sensing capabilities","volume":"vol. 5217","author":"Gordon","year":"2008"},{"key":"10.1016\/j.jda.2015.04.001_br0240","series-title":"Stabilization, Safety, and Security of Distributed Systems","first-page":"384","article-title":"Randomized gathering of mobile robots with local-multiplicity detection","volume":"vol. 5873","author":"Izumi","year":"2009"},{"issue":"4","key":"10.1016\/j.jda.2015.04.001_br0250","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1109\/TPDS.2012.212","article-title":"Feasibility of polynomial-time randomized gathering for oblivious mobile robots","volume":"24","author":"Izumi","year":"2013","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"10.1016\/j.jda.2015.04.001_br0260","series-title":"Experimental Robotics V","first-page":"609","article-title":"Experiments in realising cooperation between autonomous mobile robots","volume":"vol. 232","author":"Jung","year":"1998"},{"key":"10.1016\/j.jda.2015.04.001_br0270","series-title":"Structural Information and Communication Complexity","first-page":"274","article-title":"Dynamic compass models and gathering algorithms for autonomous mobile robots","volume":"vol. 4474","author":"Katayama","year":"2007"},{"issue":"1","key":"10.1016\/j.jda.2015.04.001_br0280","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","article-title":"Gathering asynchronous oblivious mobile robots in a ring","volume":"390","author":"Klasing","year":"2008","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jda.2015.04.001_br0290","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1177\/027836499301200106","article-title":"Toward a robot architecture integrating cooperation between mobile robots: application to indoor environment","volume":"12","author":"Noreils","year":"1993","journal-title":"Int. J. Robot. Res."},{"key":"10.1016\/j.jda.2015.04.001_br0300","series-title":"Distributed Autonomous Robotic Systems 4","first-page":"391","article-title":"Multi-robot learning in a cooperative observation task","author":"Parker","year":"2000"},{"key":"10.1016\/j.jda.2015.04.001_br0310","series-title":"Distributed Computing \u2013 IWDC 2005","first-page":"1","article-title":"Distributed coordination algorithms for mobile robot swarms: new directions and challenges","volume":"vol. 3741","author":"Peleg","year":"2005"},{"key":"10.1016\/j.jda.2015.04.001_br0320","series-title":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","article-title":"Tutorial 1\u20133: leader election and pattern formation in swarms of deterministic robots","author":"Petit","year":"2009"},{"key":"10.1016\/j.jda.2015.04.001_br0330","series-title":"Theoretical Computer Science","first-page":"154","article-title":"Instantaneous actions vs. full asynchronicity: controlling and coordinating a set of autonomous mobile robots","volume":"vol. 2202","author":"Prencipe","year":"2001"},{"issue":"2\u20133","key":"10.1016\/j.jda.2015.04.001_br0340","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/j.tcs.2007.04.023","article-title":"Impossibility of gathering by a set of autonomous mobile robots","volume":"384","author":"Prencipe","year":"2007","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jda.2015.04.001_br0350","doi-asserted-by":"crossref","first-page":"9:1","DOI":"10.1145\/1462187.1462196","article-title":"Using eventually consistent compasses to gather memory-less mobile robots with limited visibility","volume":"4","author":"Souissi","year":"2009","journal-title":"ACM Trans. Auton. Adapt. Syst."}],"container-title":["Journal of Discrete Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866715000532?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1570866715000532?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T15:47:22Z","timestamp":1691596042000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1570866715000532"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7]]},"references-count":35,"alternative-id":["S1570866715000532"],"URL":"https:\/\/doi.org\/10.1016\/j.jda.2015.04.001","relation":{},"ISSN":["1570-8667"],"issn-type":[{"value":"1570-8667","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Leader election and gathering for asynchronous fat robots without common chirality","name":"articletitle","label":"Article Title"},{"value":"Journal of Discrete Algorithms","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jda.2015.04.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2015 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}