{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:59:06Z","timestamp":1740142746937,"version":"3.37.3"},"reference-count":22,"publisher":"Oxford University Press (OUP)","issue":"5","license":[{"start":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T00:00:00Z","timestamp":1612137600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100004541","name":"Ministry of Human Resource Development, Government of India","doi-asserted-by":"publisher","award":["ODF\/2018\/001055"],"award-info":[{"award-number":["ODF\/2018\/001055"]}],"id":[{"id":"10.13039\/501100004541","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,17]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>This paper considers the area convergence problem, which requires a group of robots to gather in a small area not defined a priori. While it is known that robots can gather at a point if they can precisely measure distances, we, in this paper, show that without any agreement on the coordinate system, it is impossible for robots to converge to an area if they cannot measure distances or angles. We denote these robots without the ability to measure distances or angles as monoculus robots. We present a counterexample showing that monoculus robots fail in area convergence even with the capability of measuring angles. However, monoculus robots with a weak notion of distance or minimal agreement on the coordinate system are sufficient to achieve area convergence. In particular, we present area convergence algorithms in asynchronous model for such monoculus robots with one of the two following simple additional capabilities: (1) locality detection ($\\mathcal{L}\\mathcal{D}$), a notion of distance or (2) orthogonal line agreement ($\\mathcal{O}\\mathcal{L}\\mathcal{A}$), a notion of direction. We discuss extensions corresponding to multiple dimensions and the termination. Additionally, we validate our findings using simulation and show the robustness of our algorithms in the presence of errors in observation or movement.<\/jats:p>","DOI":"10.1093\/comjnl\/bxaa182","type":"journal-article","created":{"date-parts":[[2020,11,26]],"date-time":"2020-11-26T04:11:09Z","timestamp":1606363869000},"page":"1306-1319","source":"Crossref","is-referenced-by-count":1,"title":["Area Convergence of Monoculus Robots With Additional Capabilities"],"prefix":"10.1093","volume":"65","author":[{"given":"Debasish","family":"Pattanayak","sequence":"first","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Guwahati 781039, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Ropar 140001, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Partha Sarathi","family":"Mandal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Indian Institute of Technology, Guwahati 781039, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Schmid","sequence":"additional","affiliation":[{"name":"Faculty of Computer Science, University of Vienna, Vienna 1090, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,2,1]]},"reference":[{"key":"2022051812595614900_ref1","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. Automat."},{"key":"2022051812595614900_ref2","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s11721-017-0140-y","article-title":"Continuous time gathering of agents with limited visibility and bearing-only sensing","volume":"11","author":"Bellaiche","year":"2017","journal-title":"Swarm Intell."},{"key":"2022051812595614900_ref3","first-page":"247","article-title":"Gathering of asynchronous oblivious robots with limited visibility","author":"Flocchini","year":"2001","journal-title":"STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science"},{"key":"2022051812595614900_ref4","first-page":"1","article-title":"Pattern formation through optimum matching by oblivious CORDA robots","author":"Fujinaga","year":"2010","journal-title":"Principles of Distributed Systems\u201414th Int. Conf., OPODIS 2010, Tozeur, Tunisia, December 14\u201317, 2010, Proceedings"},{"key":"2022051812595614900_ref5","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."},{"key":"2022051812595614900_ref6","first-page":"178","article-title":"Certified impossibility results for byzantine-tolerant mobile robots","author":"Auger","year":"2013","journal-title":"Stabilization, Safety, and Security of Distributed Systems\u201415th Int. Symposium, SSS 2013"},{"key":"2022051812595614900_ref7","first-page":"93","article-title":"Hard tasks for weak robots: the role of common knowledge in pattern formation by autonomous mobile robots","volume":"1741","author":"Flocchini","year":"1999","journal-title":"Proc. ISAAC"},{"key":"2022051812595614900_ref8","first-page":"79","article-title":"Robot convergence via center-of-gravity algorithms","volume":"3104","author":"Cohen","year":"2004","journal-title":"Proc. SIROCCO"},{"key":"2022051812595614900_ref9","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":"2022051812595614900_ref10","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1137\/060665257","article-title":"Convergence of autonomous mobile robots with inaccurate sensors and movements","volume":"38","author":"Cohen","year":"2008","journal-title":"SIAM J. Comput."},{"key":"2022051812595614900_ref11","first-page":"142","article-title":"Gathering multiple robotic a(ge)nts with limited sensing capabilities","author":"Gordon","year":"2004","journal-title":"Ant Colony Optimization and Swarm Intelligence, 4th Int. Workshop, ANTS 2004"},{"key":"2022051812595614900_ref12","first-page":"72","article-title":"Gathering multiple robotic agents with crude distance sensing capabilities","author":"Gordon","year":"2008","journal-title":"Ant Colony Optimization and Swarm Intelligence, 6th Int. Conf., ANTS 2008"},{"key":"2022051812595614900_ref13","first-page":"103","article-title":"Chase your farthest neighbour","author":"Manor","year":"2016","journal-title":"Distributed Autonomous Robotic Systems, The 13th Int. Symposium, DARS 2016"},{"key":"2022051812595614900_ref14","first-page":"44","article-title":"Guidance of swarms with agents having bearing only and limited visibility sensors","author":"Manor","year":"2018","journal-title":"Swarm Intelligence\u201411th Int. Conf., ANTS 2018"},{"key":"2022051812595614900_ref15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/s00446-015-0248-5","article-title":"Getting close without touching: near-gathering for autonomous mobile robots","volume":"28","author":"Pagli","year":"2015","journal-title":"Distrib. Comput."},{"key":"2022051812595614900_ref16","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1109\/TAC.2011.2158172","article-title":"Rendezvous without coordinates","volume":"57","author":"Yu","year":"2012","journal-title":"IEEE Trans. Automat. Contr."},{"key":"2022051812595614900_ref17","doi-asserted-by":"crossref","first-page":"1347","DOI":"10.1137\/S009753979628292X","article-title":"Distributed anonymous mobile robots: formation of geometric patterns","volume":"28","author":"Suzuki","year":"1999","journal-title":"SIAM J. Comput."},{"key":"2022051812595614900_ref18","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."},{"key":"2022051812595614900_ref19","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":"TAAS"},{"key":"2022051812595614900_ref20","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1137\/100797916","article-title":"The gathering problem for two oblivious robots with unreliable compasses","volume":"41","author":"Izumi","year":"2012","journal-title":"SIAM J. Comput."},{"key":"2022051812595614900_ref21","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-stabilization","author":"Dolev","year":"2000"},{"key":"2022051812595614900_ref22","doi-asserted-by":"crossref","first-page":"17:1","DOI":"10.1145\/1552297.1552300","article-title":"Self-stabilizing robot formations over unreliable networks","volume":"4","author":"Gilbert","year":"2009","journal-title":"ACM Trans. Auton. Adapt. Syst"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/5\/1306\/43732018\/bxaa182.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/5\/1306\/43732018\/bxaa182.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,18]],"date-time":"2022-05-18T13:02:45Z","timestamp":1652878965000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/5\/1306\/6125293"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,1]]},"references-count":22,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2021,2,1]]},"published-print":{"date-parts":[[2022,5,17]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxaa182","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2022,5]]},"published":{"date-parts":[[2021,2,1]]}}}