On the power of bounded asynchrony: convergence by autonomous robots with limited visibility
A distributed algorithm A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of A to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small....
Uloženo v:
| Vydáno v: | Distributed computing Ročník 37; číslo 3; s. 279 - 308 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Berlin/Heidelberg
Springer Berlin Heidelberg
01.09.2024
Springer Nature B.V |
| Témata: | |
| ISSN: | 0178-2770, 1432-0452 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | A distributed algorithm
A
solves the
Point Convergence
task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of
A
to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small. This fundamental task in the standard
OBLOT
model of autonomous mobile entities has been previously studied in a variety of settings, including full visibility, exact measurements (including distances and angles), and synchronous activation of entities. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm operating under these constraints that solves
Point Convergence
, for entities moving in two or three dimensional space, with any bounded degree of asynchrony. We also prove that under similar realistic constraints, but unbounded asynchrony,
Point Convergence
in the plane is not possible in general, contingent on the natural assumption that algorithms maintain the (visible) connectivity among entities present in the initial configuration. This variant, that we call
Cohesive Convergence
, serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling a long-standing question whether in the Euclidean plane synchronously scheduled entities are more powerful than asynchronously scheduled entities. |
|---|---|
| AbstractList | A distributed algorithm
A
solves the
Point Convergence
task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of
A
to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small. This fundamental task in the standard
OBLOT
model of autonomous mobile entities has been previously studied in a variety of settings, including full visibility, exact measurements (including distances and angles), and synchronous activation of entities. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm operating under these constraints that solves
Point Convergence
, for entities moving in two or three dimensional space, with any bounded degree of asynchrony. We also prove that under similar realistic constraints, but unbounded asynchrony,
Point Convergence
in the plane is not possible in general, contingent on the natural assumption that algorithms maintain the (visible) connectivity among entities present in the initial configuration. This variant, that we call
Cohesive Convergence
, serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling a long-standing question whether in the Euclidean plane synchronously scheduled entities are more powerful than asynchronously scheduled entities. A distributed algorithm A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of A to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small. This fundamental task in the standard OBLOT model of autonomous mobile entities has been previously studied in a variety of settings, including full visibility, exact measurements (including distances and angles), and synchronous activation of entities. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm operating under these constraints that solves Point Convergence, for entities moving in two or three dimensional space, with any bounded degree of asynchrony. We also prove that under similar realistic constraints, but unbounded asynchrony, Point Convergence in the plane is not possible in general, contingent on the natural assumption that algorithms maintain the (visible) connectivity among entities present in the initial configuration. This variant, that we call Cohesive Convergence, serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling a long-standing question whether in the Euclidean plane synchronously scheduled entities are more powerful than asynchronously scheduled entities. A distributed algorithm $${\mathcal {A}}$$ A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under the control of $${\mathcal {A}}$$ A to eventually form and thereafter maintain configurations in which the separation between all entities is arbitrarily small. This fundamental task in the standard $$\mathcal {OBLOT}$$ OBLOT model of autonomous mobile entities has been previously studied in a variety of settings, including full visibility, exact measurements (including distances and angles), and synchronous activation of entities. Our study concerns the minimal assumptions under which entities, moving asynchronously with limited and unknown visibility range and subject to limited imprecision in measurements, can be guaranteed to converge in this way. We present an algorithm operating under these constraints that solves Point Convergence , for entities moving in two or three dimensional space, with any bounded degree of asynchrony. We also prove that under similar realistic constraints, but unbounded asynchrony, Point Convergence in the plane is not possible in general, contingent on the natural assumption that algorithms maintain the (visible) connectivity among entities present in the initial configuration. This variant, that we call Cohesive Convergence , serves to distinguish the power of bounded and unbounded asynchrony in the control of autonomous mobile entities, settling a long-standing question whether in the Euclidean plane synchronously scheduled entities are more powerful than asynchronously scheduled entities. |
| Author | Kirkpatrick, David Navarra, Alfredo Kostitsyna, Irina Prencipe, Giuseppe Santoro, Nicola |
| Author_xml | – sequence: 1 givenname: David surname: Kirkpatrick fullname: Kirkpatrick, David organization: Department of Computer Science, University of British Columbia – sequence: 2 givenname: Irina surname: Kostitsyna fullname: Kostitsyna, Irina organization: Department of Mathematics and Computer Science, TU Eindhoven – sequence: 3 givenname: Alfredo surname: Navarra fullname: Navarra, Alfredo organization: Department of Mathematics and Computer Science, Università degli Studi di Perugia – sequence: 4 givenname: Giuseppe surname: Prencipe fullname: Prencipe, Giuseppe email: giuseppe.prencipe@unipi.it organization: Department of Computer Science, Università degli Studi di Pisa – sequence: 5 givenname: Nicola surname: Santoro fullname: Santoro, Nicola organization: School of Computer Science, Carleton University |
| BookMark | eNp9kE9LwzAYh4NMcJt-AU8Bz9GkSZvWmwz_wWAXvQkhTZMto0tmkm7021utIHjY6X0Pv-f9vTwzMHHeaQCuCb4lGPO7iDFjBcIZQ8NWUMTPwJQwmiHM8mwCppjwEmWc4wswi3GLMaaEZFPwsXIwbTTc-6MO0BtY-841uoEy9k5tgnf9PVTeHXRYa6c0rHsou-Sd3_kuwuBrnyI82rSBrd3ZNJAHG21tW5v6S3BuZBv11e-cg_enx7fFC1qunl8XD0ukaEETItSwXFdF0TQVJ9IwoxtWN7VsTJYbrTjVSmWmorksZKXymudcKmJKoktKVEXn4Ga8uw_-s9Mxia3vghsqBcUlLzCjJR5S2ZhSwccYtBH7YHcy9IJg8W1RjBbFYFH8WBR8gMp_kLJJJutdCtK2p1E6onHocWsd_r46QX0BMTGLDg |
| CitedBy_id | crossref_primary_10_1016_j_jpdc_2025_105129 |
| Cites_doi | 10.1137/050645221 10.1109/ICDCS.2013.27 10.1016/j.tcs.2012.04.038 10.1109/70.795787 10.1137/060665257 10.1016/j.jda.2015.10.005 10.1007/978-3-031-02008-7 10.1016/j.tcs.2007.04.023 10.1016/j.tcs.2010.01.037 10.1007/s00446-014-0220-9 10.1016/j.tcs.2020.10.015 10.1007/s00446-017-0293-3 10.1145/3060272 10.1007/s00446-018-0325-7 10.1007/978-3-642-22212-2_12 10.1145/3154273.3154322 10.1007/978-3-030-54921-3_4 10.1093/comjnl/bxaa182 10.1016/j.tcs.2008.10.005 10.1007/978-3-642-22012-8_52 10.1145/3465084.3467910 10.1007/978-3-540-75142-7_24 10.1007/978-3-030-11072-7_6 10.1007/978-3-030-11072-7_1 10.1137/S0097539704446475 10.1137/100797916 10.1016/j.tcs.2005.01.001 10.1145/1462187.1462196 10.1137/S009753979628292X 10.1016/j.tcs.2008.07.026 10.1007/978-3-319-59647-1_6 10.1007/978-3-319-03578-9_17 10.1137/040620564 10.1145/1989493.1989515 10.1145/2933057.2933063 10.1007/s00446-016-0291-x 10.1109/ACCESS.2021.3089081 10.1145/2484239.2484266 10.1137/100796534 10.1007/s00446-018-0333-7 10.1007/978-3-642-10877-8_7 10.1007/s00446-015-0248-5 10.1007/s00446-019-00359-x 10.1002/scj.20331 10.1016/j.jda.2015.04.001 |
| ContentType | Journal Article |
| Copyright | The Author(s) 2024 The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| Copyright_xml | – notice: The Author(s) 2024 – notice: The Author(s) 2024. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. |
| DBID | C6C AAYXX CITATION 3V. 7RQ 7SC 7XB 8AL 8AO 8FD 8FE 8FG 8FK ABUWG AFKRA ARAPS AZQEC BENPR BGLVJ CCPQU DWQXO GNUQQ HCIFZ JQ2 K7- L7M L~C L~D M0N P5Z P62 PHGZM PHGZT PKEHL PQEST PQGLB PQQKQ PQUKI PRINS Q9U U9A |
| DOI | 10.1007/s00446-024-00463-7 |
| DatabaseName | Springer Nature OA Free Journals CrossRef ProQuest Central (Corporate) Career & Technical Education Database Computer and Information Systems Abstracts ProQuest Central (purchase pre-March 2016) Computing Database (Alumni Edition) ProQuest Pharma Collection Technology Research Database ProQuest SciTech Collection ProQuest Technology Collection ProQuest Central (Alumni) (purchase pre-March 2016) ProQuest Central (Alumni) ProQuest Central UK/Ireland Advanced Technologies & Computer Science Collection ProQuest Central Essentials ProQuest Central ProQuest Technology Collection ProQuest One Community College ProQuest Central ProQuest Central Student SciTech Premium Collection ProQuest Computer Science Collection Computer Science Database Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Computing Database Advanced Technologies & Aerospace Database ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Premium ProQuest One Academic (New) ProQuest One Academic Middle East (New) ProQuest One Academic Eastern Edition (DO NOT USE) ProQuest One Applied & Life Sciences ProQuest One Academic (retired) ProQuest One Academic UKI Edition ProQuest Central China ProQuest Central Basic |
| DatabaseTitle | CrossRef Computer Science Database ProQuest Central Student Technology Collection Technology Research Database Computer and Information Systems Abstracts – Academic ProQuest One Academic Middle East (New) ProQuest Advanced Technologies & Aerospace Collection ProQuest Central Essentials ProQuest Computer Science Collection Computer and Information Systems Abstracts ProQuest Central (Alumni Edition) SciTech Premium Collection ProQuest One Community College ProQuest Pharma Collection ProQuest Central China ProQuest Central ProQuest One Applied & Life Sciences ProQuest Central Korea ProQuest Central (New) Advanced Technologies Database with Aerospace Career and Technical Education (Alumni Edition) Advanced Technologies & Aerospace Collection ProQuest Computing ProQuest Central Basic ProQuest Computing (Alumni Edition) ProQuest One Academic Eastern Edition ProQuest Technology Collection ProQuest SciTech Collection Computer and Information Systems Abstracts Professional Advanced Technologies & Aerospace Database ProQuest Career and Technical Education ProQuest One Academic UKI Edition ProQuest One Academic ProQuest One Academic (New) ProQuest Central (Alumni) |
| DatabaseTitleList | Computer Science Database CrossRef |
| Database_xml | – sequence: 1 dbid: 7RQ name: Career & Technical Education Database url: https://search.proquest.com/career sourceTypes: Aggregation Database |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1432-0452 |
| EndPage | 308 |
| ExternalDocumentID | 10_1007_s00446_024_00463_7 |
| GrantInformation_xml | – fundername: Università di Pisa |
| GroupedDBID | -4Z -59 -5G -BR -EM -Y2 -~C -~X .4S .86 .DC .VR 06D 0R~ 0VY 1N0 1SB 203 28- 29G 2J2 2JN 2JY 2KG 2LR 2P1 2VQ 2~H 30V 3V. 4.4 406 408 409 40D 40E 5GY 5QI 5VS 67Z 6NX 78A 7RQ 8AO 8FE 8FG 8UJ 95- 95. 95~ 96X AAAVM AABHQ AACDK AAHNG AAIAL AAJBT AAJKR AANZL AAOBN AARHV AARTL AASML AATNV AATVU AAUYE AAWCG AAYIU AAYOK AAYQN AAYTO AAYZH ABAKF ABBBX ABBXA ABDBF ABDPE ABDZT ABECU ABFTD ABFTV ABHLI ABHQN ABJNI ABJOX ABKCH ABKTR ABMNI ABMQK ABNWP ABQBU ABQSL ABSXP ABTEG ABTHY ABTKH ABTMW ABULA ABUWG ABWNU ABXPI ACAOD ACBXY ACDTI ACGFS ACHSB ACHXU ACKNC ACMDZ ACMLO ACOKC ACOMO ACPIV ACUHS ACZOJ ADHHG ADHIR ADIMF ADINQ ADKNI ADKPE ADMLS ADRFC ADTPH ADURQ ADYFF ADZKW AEBTG AEFIE AEFQL AEGAL AEGNC AEJHL AEJRE AEKMD AEMSY AENEX AEOHA AEPYU AESKC AETLH AEVLU AEXYK AFBBN AFEXP AFGCZ AFKRA AFLOW AFQWF AFWTZ AFZKB AGAYW AGDGC AGGDS AGJBK AGMZJ AGQEE AGQMX AGRTI AGWIL AGWZB AGYKE AHAVH AHBYD AHKAY AHSBF AHYZX AIAKS AIGIU AIIXL AILAN AITGF AJBLW AJRNO AJZVZ ALMA_UNASSIGNED_HOLDINGS ALWAN AMKLP AMXSW AMYLF AMYQR AOCGG ARAPS ARCSS ARMRJ ASPBG AVWKF AXYYD AYJHY AZFZN AZQEC B-. B0M BA0 BBWZM BDATZ BENPR BGLVJ BGNMA BPHCQ BSONS C6C CAG CCPQU COF CS3 CSCUP DDRTE DL5 DNIVK DPUIP DU5 DWQXO EAD EAP EBD EBLON EBS EDO EIOEI EJD EMK EPL ESBYG ESX FEDTE FERAY FFXSO FIGPU FINBP FNLPD FRRFC FSGXE FWDCC GGCAI GGRSB GJIRD GNUQQ GNWQR GQ6 GQ7 GQ8 GXS H13 HCIFZ HF~ HG5 HG6 HMJXF HQYDN HRMNR HVGLF HZ~ H~9 I-F I09 IHE IJ- IKXTQ ITM IWAJR IXC IZIGR IZQ I~X I~Z J-C J0Z JBSCW JCJTX JZLTJ K6V K7- KDC KOV KOW LAS LLZTM M0N M4Y MA- N2Q N9A NDZJH NPVJJ NQJWS NU0 O9- O93 O9G O9I O9J OAM P19 P2P P62 P9O PF0 PQQKQ PROAC PT4 PT5 Q2X QOK QOS R4E R89 R9I RHV RIG RNI ROL RPX RSV RZK S16 S1Z S26 S27 S28 S3B SAP SCJ SCLPG SCO SDH SDM SHX SISQX SJYHP SNE SNPRN SNX SOHCF SOJ SPISZ SRMVM SSLCW STPWE SZN T13 T16 TN5 TSG TSK TSV TUC TUS U2A UG4 UOJIU UTJUX UZXMN VC2 VFIZW W23 W48 WK8 YLTOR YZZ Z45 Z7X Z83 Z88 Z8R Z8W Z92 ZCA ZMTXR ~8M ~EX AAPKM AAYXX ABBRH ABDBE ABFSG ABRTQ ACSTC ADHKG AETEA AEZWR AFDZB AFFHD AFHIU AFOHR AGQPQ AHPBZ AHWEU AIXLP ATHPR AYFIA CITATION PHGZM PHGZT PQGLB 7SC 7XB 8AL 8FD 8FK JQ2 L7M L~C L~D PKEHL PQEST PQUKI PRINS Q9U U9A |
| ID | FETCH-LOGICAL-c363t-13f45e966dd971af4fed4bdbadf25fec73ecc2f935a6a9c5b757ac1f81e831c93 |
| IEDL.DBID | RSV |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001199154700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0178-2770 |
| IngestDate | Tue Dec 02 15:58:25 EST 2025 Sat Nov 29 06:13:26 EST 2025 Tue Nov 18 21:28:19 EST 2025 Fri Feb 21 02:38:48 EST 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Keywords | Mobile robots Asynchronous computation Distributed geometric algorithms |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c363t-13f45e966dd971af4fed4bdbadf25fec73ecc2f935a6a9c5b757ac1f81e831c93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| OpenAccessLink | https://link.springer.com/10.1007/s00446-024-00463-7 |
| PQID | 3087604380 |
| PQPubID | 31799 |
| PageCount | 30 |
| ParticipantIDs | proquest_journals_3087604380 crossref_primary_10_1007_s00446_024_00463_7 crossref_citationtrail_10_1007_s00446_024_00463_7 springer_journals_10_1007_s00446_024_00463_7 |
| PublicationCentury | 2000 |
| PublicationDate | 20240900 2024-09-00 20240901 |
| PublicationDateYYYYMMDD | 2024-09-01 |
| PublicationDate_xml | – month: 9 year: 2024 text: 20240900 |
| PublicationDecade | 2020 |
| PublicationPlace | Berlin/Heidelberg |
| PublicationPlace_xml | – name: Berlin/Heidelberg – name: Heidelberg |
| PublicationTitle | Distributed computing |
| PublicationTitleAbbrev | Distrib. Comput |
| PublicationYear | 2024 |
| Publisher | Springer Berlin Heidelberg Springer Nature B.V |
| Publisher_xml | – name: Springer Berlin Heidelberg – name: Springer Nature B.V |
| References | CohenRPelegDConvergence properties of the gravitational algorithm in asynchronous robot systemsSIAM J. Comput.200534615161528216575310.1137/S0097539704446475 Pattanayak, D., Mondal, K., Mandal, P.S., Schmid, S.: Convergence of even simpler robots without position information. In: El Abbadi, A., Garbinato, B. (eds.) Networked Systems (NETYS). Lecture Notes in Computer Science, vol. 10299, pp. 69–85. Springer (2017) CiceroneSDi StefanoGNavarraAAsynchronous arbitrary pattern formation: the effects of a rigorous approachDistrib. Comput.201932291132392553910.1007/s00446-018-0325-7 Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: ACM Symposium on Principles of Distributed Computing (PODC), pp. 250–259 (2013) PrencipeGImpossibility of gathering by a set of autonomous mobile robotsTheor. Comput. Sci.20073842–3222231235330310.1016/j.tcs.2007.04.023 YamauchiYUeharaTKijimaSYamashitaMPlane formation by synchronous mobile robots in the three-dimensional Euclidean spaceJ. ACM20176431611643366685910.1145/3060272 Kirkpatrick, D., Kostitsyna, I., Navarra, A., Prencipe, G., Santoro, N.: Separating bounded and unbounded asynchrony for autonomous robots: point convergence with limited visibility. In: 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 9–19 (2021) Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: 21st International Symposium on Distributed Computing (DISC), pp. 298–312 (2007) FlocchiniPPrencipeGSantoroNVigliettaGDistributed computing by mobile robots: uniform circle formationDistrib. Comput.2017306413457370929510.1007/s00446-016-0291-x CiceroneSDi StefanoGNavarraASolving the pattern formation by mobile robots with chiralityIEEE Access20219881778820410.1109/ACCESS.2021.3089081 Flocchini, P., Prencipe, G., Santoro, N.: Moving and computing models: robots. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science, Springer, vol. 11340, pp. 3–14 (2019). https://doi.org/10.1007/978-3-030-11072-7_1 FlocchiniPPrencipeGSantoroNWidmayerPArbitrary pattern formation by asynchronous oblivious robotsTheor. Comput. Sci.20084071–3412447246302610.1016/j.tcs.2008.07.026 FlocchiniPPrencipeGSantoroNWidmayerPGathering of asynchronous robots with limited visibilityTheor. Comput. Sci.20053371–3147168214121910.1016/j.tcs.2005.01.001 Braun, M., Castenow, J., Heide, F.M.: Local gathering of mobile robots in three dimensions. CoRR abs/2005.07495 (2020) Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1), 1–27 (2009) Bhagat, S., Chaudhuri, S.G., Mukhopadyaya, K.: Gathering of opaque robots in 3D space. In: 19th International ACM Conference on Distributed Computing and Networking (ICDCN), pp. 1–10 (2018) CiceroneSDi StefanoGNavarraAGathering of robots on meeting-points: feasibility and optimal resolution algorithmsDistrib. Comput.2018311150374501710.1007/s00446-017-0293-3 Bouzid, Z., Potop-Butucaru, M.G., Tixeuil, S.: Byzantine convergence in robot networks: the price of asynchrony. In: Proceedings of 13th International Conference Principles of Distributed Systems (OPODIS), pp. 54–70 (2009) Défago, X., Potop-Butucaru, M., Parvédy, P.R.: Self-stabilizing gathering of mobile robots under crash or byzantine faults. Distrib. Comput. 33(5), 393–421 (2020) KasuyaMItoNInuzukaNWadaKA pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axisSyst. Comput. Japan200637108910010.1002/scj.20331 SuzukiIYamashitaMDistributed anonymous mobile robots: formation of geometric patternsSIAM J. Comput.199928413471363168101010.1137/S009753979628292X ChaudhuriSGMukhopadhyayaKLeader election and gathering for asynchronous fat robots without common chiralityJ. Discrete Algorithms201533171192335494010.1016/j.jda.2015.04.001 FlocchiniPPrencipeGSantoroNDistributed Computing by Oblivious Mobile Robots2012WillistonMorgan & Claypool10.1007/978-3-031-02008-7 PagliLPrencipeGVigliettaGGetting close without touching: near-gathering for autonomous mobile robotsDistrib. Comput.2015285333349340314610.1007/s00446-015-0248-5 IzumiTSouissiSKatayamaYInuzukaNDefagoXWadaKYamashitaMThe gathering problem for two oblivious robots with unreliable compassesSIAM J. Comput.20124112646288832010.1137/100797916 CiceroneSDi StefanoGNavarraAEmbedded pattern formation by asynchronous robots without chiralityDistrib. Comput.2019324291315398058010.1007/s00446-018-0333-7 Bar-Lev, A., Cohen, R.: Convergence of asynchronous autonomous mobile robots with inaccurate sensors. In: Algorithms and Experiments for Wireless Networks (ALGOSENSORS). Springer, Berlin, Heidelberg (2020) (under review) Katreniak, B.: Convergence with limited visibility by asynchronous mobile robots. In: Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science, vol. 6796, pp. 125–137. Springer (2011) BoseKKunduMKAdhikaryRSauBArbitrary pattern formation by asynchronous opaque robots with lightsTheor. Comput. Sci.2021849138158417912010.1016/j.tcs.2020.10.015 YamashitaMSuzukiICharacterizing geometric patterns formable by oblivious anonymous mobile robotsTheor. Comput. Sci.201041126–2824332453266633810.1016/j.tcs.2010.01.037 AndoHOasaYSuzukiIYamashitaMDistributed memoryless point convergence algorithm for mobile robots with limited visibilityIEEE Trans. Robot. Autom.199915581882810.1109/70.795787 AgmonNPelegDFault-tolerant gathering algorithms for autonomous mobile robotsSIAM J. Comput.2006365682223164010.1137/050645221 YamamotoKIzumiTKatayamaYInuzukaNWadaKThe optimal tolerance of uniform observation error for mobile robot convergenceTheor. Comput. Sci.20124447786292818310.1016/j.tcs.2012.04.038 Yamauchi, Y., Uehara, T., Yamashita, M.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space. In: Giakkoupis, G. (ed.) Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 447–449 (2016). https://doi.org/10.1145/2933057.2933063 Yamauchi, Y.: Symmetry of anonymous robots. Chapter 8 of: P. Flocchini, G. Prencipe, N. Santoro (eds.), Distributed Computing by Mobile Entities. Springer (2019) LinJMorseASAndersonBDOThe multi-agent rendezvous problem. Part 2: the asynchronous caseSIAM J. Control Optim.200746621202147236931210.1137/040620564 CzyzowiczJGasieniecLPelcAGathering few fat mobile robots in the planeTheor. Comput. Sci.20094106–7481499249232410.1016/j.tcs.2008.10.005 CieliebakMFlocchiniPPrencipeGSantoroNDistributed computing by mobile robots: gatheringSIAM J. Comput.2012414829879297475510.1137/100796534 Yamauchi, Y., Yamashita, M.: Pattern formation by mobile robots with limited visibility. In: 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013). Lecture Notes in Computer Science, vol. 8179, pp. 201–212. Springer. https://doi.org/10.1007/978-3-319-03578-9_17 (2013) BhagatSChaudhuriSGMukhopadyayaKFault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreementJ. Discrete Algorithms2016365062345389310.1016/j.jda.2015.10.005 DasSFlocchiniPSantoroNYamashitaMForming sequence of geometric patterns with oblivious mobile robotsDistrib. Comput.201528131145332615310.1007/s00446-014-0220-9 Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., Märtens, M., Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A new approach for analyzing convergence algorithms for mobile robots. In: Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 6756, pp. 650–661. Springer (2011) CohenRPelegDConvergence of autonomous mobile robots with inaccurate sensors and movementsSIAM J. Comput.2008381276302239952810.1137/060665257 PattanayakDMondalKMandalPSSchmidSArea convergence of monoculus robots with additional capabilitiesComput. J. (COMPJ)202110.1093/comjnl/bxaa182 Degener, B., Kempkes, B., Langner, T., Heide, F.M., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 139–148 (2011) Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 337–346 (2013) S Cicerone (463_CR14) 2018; 31 P Flocchini (463_CR38) 2017; 30 463_CR18 463_CR37 463_CR24 463_CR23 463_CR45 463_CR22 463_CR44 P Flocchini (463_CR10) 2008; 407 463_CR40 J Lin (463_CR19) 2007; 46 Y Yamauchi (463_CR6) 2017; 64 N Agmon (463_CR12) 2006; 36 H Ando (463_CR21) 1999; 15 P Flocchini (463_CR32) 2005; 337 J Czyzowicz (463_CR16) 2009; 410 D Pattanayak (463_CR29) 2021 R Cohen (463_CR26) 2008; 38 M Yamashita (463_CR36) 2010; 411 G Prencipe (463_CR20) 2007; 384 S Cicerone (463_CR9) 2021; 9 S Bhagat (463_CR39) 2016; 36 S Das (463_CR42) 2015; 28 K Yamamoto (463_CR30) 2012; 444 R Cohen (463_CR25) 2005; 34 K Bose (463_CR7) 2021; 849 S Cicerone (463_CR41) 2019; 32 463_CR28 463_CR27 I Suzuki (463_CR35) 1999; 28 463_CR1 463_CR13 M Kasuya (463_CR11) 2006; 37 463_CR34 L Pagli (463_CR43) 2015; 28 463_CR3 463_CR33 SG Chaudhuri (463_CR46) 2015; 33 463_CR4 S Cicerone (463_CR8) 2019; 32 T Izumi (463_CR17) 2012; 41 463_CR31 M Cieliebak (463_CR15) 2012; 41 P Flocchini (463_CR2) 2012 463_CR5 |
| References_xml | – reference: PattanayakDMondalKMandalPSSchmidSArea convergence of monoculus robots with additional capabilitiesComput. J. (COMPJ)202110.1093/comjnl/bxaa182 – reference: CiceroneSDi StefanoGNavarraAEmbedded pattern formation by asynchronous robots without chiralityDistrib. Comput.2019324291315398058010.1007/s00446-018-0333-7 – reference: Braun, M., Castenow, J., Heide, F.M.: Local gathering of mobile robots in three dimensions. CoRR abs/2005.07495 (2020) – reference: FlocchiniPPrencipeGSantoroNDistributed Computing by Oblivious Mobile Robots2012WillistonMorgan & Claypool10.1007/978-3-031-02008-7 – reference: AndoHOasaYSuzukiIYamashitaMDistributed memoryless point convergence algorithm for mobile robots with limited visibilityIEEE Trans. Robot. Autom.199915581882810.1109/70.795787 – reference: Bar-Lev, A., Cohen, R.: Convergence of asynchronous autonomous mobile robots with inaccurate sensors. In: Algorithms and Experiments for Wireless Networks (ALGOSENSORS). Springer, Berlin, Heidelberg (2020) (under review) – reference: YamashitaMSuzukiICharacterizing geometric patterns formable by oblivious anonymous mobile robotsTheor. Comput. Sci.201041126–2824332453266633810.1016/j.tcs.2010.01.037 – reference: YamauchiYUeharaTKijimaSYamashitaMPlane formation by synchronous mobile robots in the three-dimensional Euclidean spaceJ. ACM20176431611643366685910.1145/3060272 – reference: Degener, B., Kempkes, B., Langner, T., Heide, F.M., Pietrzyk, P., Wattenhofer, R.: A tight runtime bound for synchronous gathering of autonomous robots with limited visibility. In: Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pp. 139–148 (2011) – reference: FlocchiniPPrencipeGSantoroNWidmayerPGathering of asynchronous robots with limited visibilityTheor. Comput. Sci.20053371–3147168214121910.1016/j.tcs.2005.01.001 – reference: Izumi, T., Katayama, Y., Inuzuka, N., Wada, K.: Gathering autonomous mobile robots with dynamic compasses: an optimal result. In: 21st International Symposium on Distributed Computing (DISC), pp. 298–312 (2007) – reference: KasuyaMItoNInuzukaNWadaKA pattern formation algorithm for a set of autonomous distributed robots with agreement on orientation along one axisSyst. Comput. Japan200637108910010.1002/scj.20331 – reference: CohenRPelegDConvergence properties of the gravitational algorithm in asynchronous robot systemsSIAM J. Comput.200534615161528216575310.1137/S0097539704446475 – reference: YamamotoKIzumiTKatayamaYInuzukaNWadaKThe optimal tolerance of uniform observation error for mobile robot convergenceTheor. Comput. Sci.20124447786292818310.1016/j.tcs.2012.04.038 – reference: ChaudhuriSGMukhopadhyayaKLeader election and gathering for asynchronous fat robots without common chiralityJ. Discrete Algorithms201533171192335494010.1016/j.jda.2015.04.001 – reference: Yamauchi, Y., Uehara, T., Yamashita, M.: Brief announcement: pattern formation problem for synchronous mobile robots in the three dimensional Euclidean space. In: Giakkoupis, G. (ed.) Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC), pp. 447–449 (2016). https://doi.org/10.1145/2933057.2933063 – reference: LinJMorseASAndersonBDOThe multi-agent rendezvous problem. Part 2: the asynchronous caseSIAM J. Control Optim.200746621202147236931210.1137/040620564 – reference: CohenRPelegDConvergence of autonomous mobile robots with inaccurate sensors and movementsSIAM J. Comput.2008381276302239952810.1137/060665257 – reference: Souissi, S., Défago, X., Yamashita, M.: Using eventually consistent compasses to gather memory-less mobile robots with limited visibility. ACM Trans. Auton. Adapt. Syst. 4(1), 1–27 (2009) – reference: CieliebakMFlocchiniPPrencipeGSantoroNDistributed computing by mobile robots: gatheringSIAM J. Comput.2012414829879297475510.1137/100796534 – reference: SuzukiIYamashitaMDistributed anonymous mobile robots: formation of geometric patternsSIAM J. Comput.199928413471363168101010.1137/S009753979628292X – reference: Kirkpatrick, D., Kostitsyna, I., Navarra, A., Prencipe, G., Santoro, N.: Separating bounded and unbounded asynchrony for autonomous robots: point convergence with limited visibility. In: 40th ACM Symposium on Principles of Distributed Computing (PODC), pp. 9–19 (2021) – reference: PrencipeGImpossibility of gathering by a set of autonomous mobile robotsTheor. Comput. Sci.20073842–3222231235330310.1016/j.tcs.2007.04.023 – reference: CiceroneSDi StefanoGNavarraAGathering of robots on meeting-points: feasibility and optimal resolution algorithmsDistrib. Comput.2018311150374501710.1007/s00446-017-0293-3 – reference: Yamauchi, Y.: Symmetry of anonymous robots. Chapter 8 of: P. Flocchini, G. Prencipe, N. Santoro (eds.), Distributed Computing by Mobile Entities. Springer (2019) – reference: Défago, X., Potop-Butucaru, M., Parvédy, P.R.: Self-stabilizing gathering of mobile robots under crash or byzantine faults. Distrib. Comput. 33(5), 393–421 (2020) – reference: AgmonNPelegDFault-tolerant gathering algorithms for autonomous mobile robotsSIAM J. Comput.2006365682223164010.1137/050645221 – reference: Cord-Landwehr, A., Degener, B., Fischer, M., Hüllmann, M., Kempkes, B., Klaas, A., Kling, P., Kurras, S., Märtens, M., Heide, F., Raupach, C., Swierkot, K., Warner, D., Weddemann, C., Wonisch, D.: A new approach for analyzing convergence algorithms for mobile robots. In: Automata, Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 6756, pp. 650–661. Springer (2011) – reference: BoseKKunduMKAdhikaryRSauBArbitrary pattern formation by asynchronous opaque robots with lightsTheor. Comput. Sci.2021849138158417912010.1016/j.tcs.2020.10.015 – reference: Bhagat, S., Chaudhuri, S.G., Mukhopadyaya, K.: Gathering of opaque robots in 3D space. In: 19th International ACM Conference on Distributed Computing and Networking (ICDCN), pp. 1–10 (2018) – reference: CiceroneSDi StefanoGNavarraAAsynchronous arbitrary pattern formation: the effects of a rigorous approachDistrib. Comput.201932291132392553910.1007/s00446-018-0325-7 – reference: CzyzowiczJGasieniecLPelcAGathering few fat mobile robots in the planeTheor. Comput. Sci.20094106–7481499249232410.1016/j.tcs.2008.10.005 – reference: DasSFlocchiniPSantoroNYamashitaMForming sequence of geometric patterns with oblivious mobile robotsDistrib. Comput.201528131145332615310.1007/s00446-014-0220-9 – reference: BhagatSChaudhuriSGMukhopadyayaKFault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreementJ. Discrete Algorithms2016365062345389310.1016/j.jda.2015.10.005 – reference: Katreniak, B.: Convergence with limited visibility by asynchronous mobile robots. In: Structural Information and Communication Complexity (SIROCCO). Lecture Notes in Computer Science, vol. 6796, pp. 125–137. Springer (2011) – reference: Bouzid, Z., Potop-Butucaru, M.G., Tixeuil, S.: Byzantine convergence in robot networks: the price of asynchrony. In: Proceedings of 13th International Conference Principles of Distributed Systems (OPODIS), pp. 54–70 (2009) – reference: Agathangelou, C., Georgiou, C., Mavronicolas, M.: A distributed algorithm for gathering many fat mobile robots in the plane. In: ACM Symposium on Principles of Distributed Computing (PODC), pp. 250–259 (2013) – reference: FlocchiniPPrencipeGSantoroNVigliettaGDistributed computing by mobile robots: uniform circle formationDistrib. Comput.2017306413457370929510.1007/s00446-016-0291-x – reference: Flocchini, P., Prencipe, G., Santoro, N.: Moving and computing models: robots. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science, Springer, vol. 11340, pp. 3–14 (2019). https://doi.org/10.1007/978-3-030-11072-7_1 – reference: FlocchiniPPrencipeGSantoroNWidmayerPArbitrary pattern formation by asynchronous oblivious robotsTheor. Comput. Sci.20084071–3412447246302610.1016/j.tcs.2008.07.026 – reference: Pattanayak, D., Mondal, K., Mandal, P.S., Schmid, S.: Convergence of even simpler robots without position information. In: El Abbadi, A., Garbinato, B. (eds.) Networked Systems (NETYS). Lecture Notes in Computer Science, vol. 10299, pp. 69–85. Springer (2017) – reference: IzumiTSouissiSKatayamaYInuzukaNDefagoXWadaKYamashitaMThe gathering problem for two oblivious robots with unreliable compassesSIAM J. Comput.20124112646288832010.1137/100797916 – reference: CiceroneSDi StefanoGNavarraASolving the pattern formation by mobile robots with chiralityIEEE Access20219881778820410.1109/ACCESS.2021.3089081 – reference: Yamauchi, Y., Yamashita, M.: Pattern formation by mobile robots with limited visibility. In: 20th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2013). Lecture Notes in Computer Science, vol. 8179, pp. 201–212. Springer. https://doi.org/10.1007/978-3-319-03578-9_17 (2013) – reference: Bouzid, Z., Das, S., Tixeuil, S.: Gathering of mobile robots tolerating multiple crash faults. In: 33rd International Conference on Distributed Computing Systems (ICDCS), pp. 337–346 (2013) – reference: PagliLPrencipeGVigliettaGGetting close without touching: near-gathering for autonomous mobile robotsDistrib. Comput.2015285333349340314610.1007/s00446-015-0248-5 – volume: 36 start-page: 56 year: 2006 ident: 463_CR12 publication-title: SIAM J. Comput. doi: 10.1137/050645221 – ident: 463_CR13 doi: 10.1109/ICDCS.2013.27 – volume: 444 start-page: 77 year: 2012 ident: 463_CR30 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2012.04.038 – volume: 15 start-page: 818 issue: 5 year: 1999 ident: 463_CR21 publication-title: IEEE Trans. Robot. Autom. doi: 10.1109/70.795787 – volume: 38 start-page: 276 issue: 1 year: 2008 ident: 463_CR26 publication-title: SIAM J. Comput. doi: 10.1137/060665257 – volume: 36 start-page: 50 year: 2016 ident: 463_CR39 publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2015.10.005 – volume-title: Distributed Computing by Oblivious Mobile Robots year: 2012 ident: 463_CR2 doi: 10.1007/978-3-031-02008-7 – volume: 384 start-page: 222 issue: 2–3 year: 2007 ident: 463_CR20 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2007.04.023 – volume: 411 start-page: 2433 issue: 26–28 year: 2010 ident: 463_CR36 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.01.037 – volume: 28 start-page: 131 year: 2015 ident: 463_CR42 publication-title: Distrib. Comput. doi: 10.1007/s00446-014-0220-9 – volume: 849 start-page: 138 year: 2021 ident: 463_CR7 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2020.10.015 – volume: 31 start-page: 1 issue: 1 year: 2018 ident: 463_CR14 publication-title: Distrib. Comput. doi: 10.1007/s00446-017-0293-3 – volume: 64 start-page: 16 issue: 3 year: 2017 ident: 463_CR6 publication-title: J. ACM doi: 10.1145/3060272 – volume: 32 start-page: 91 issue: 2 year: 2019 ident: 463_CR8 publication-title: Distrib. Comput. doi: 10.1007/s00446-018-0325-7 – ident: 463_CR27 doi: 10.1007/978-3-642-22212-2_12 – ident: 463_CR4 doi: 10.1145/3154273.3154322 – ident: 463_CR3 doi: 10.1007/978-3-030-54921-3_4 – year: 2021 ident: 463_CR29 publication-title: Comput. J. (COMPJ) doi: 10.1093/comjnl/bxaa182 – volume: 410 start-page: 481 issue: 6–7 year: 2009 ident: 463_CR16 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.10.005 – ident: 463_CR24 doi: 10.1007/978-3-642-22012-8_52 – ident: 463_CR1 doi: 10.1145/3465084.3467910 – ident: 463_CR18 doi: 10.1007/978-3-540-75142-7_24 – ident: 463_CR22 – ident: 463_CR37 doi: 10.1007/978-3-030-11072-7_6 – ident: 463_CR44 doi: 10.1007/978-3-030-11072-7_1 – volume: 34 start-page: 1516 issue: 6 year: 2005 ident: 463_CR25 publication-title: SIAM J. Comput. doi: 10.1137/S0097539704446475 – volume: 41 start-page: 26 issue: 1 year: 2012 ident: 463_CR17 publication-title: SIAM J. Comput. doi: 10.1137/100797916 – volume: 337 start-page: 147 issue: 1–3 year: 2005 ident: 463_CR32 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2005.01.001 – ident: 463_CR33 doi: 10.1145/1462187.1462196 – volume: 28 start-page: 1347 issue: 4 year: 1999 ident: 463_CR35 publication-title: SIAM J. Comput. doi: 10.1137/S009753979628292X – volume: 407 start-page: 412 issue: 1–3 year: 2008 ident: 463_CR10 publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.07.026 – ident: 463_CR28 doi: 10.1007/978-3-319-59647-1_6 – ident: 463_CR34 doi: 10.1007/978-3-319-03578-9_17 – volume: 46 start-page: 2120 issue: 6 year: 2007 ident: 463_CR19 publication-title: SIAM J. Control Optim. doi: 10.1137/040620564 – ident: 463_CR31 doi: 10.1145/1989493.1989515 – ident: 463_CR5 doi: 10.1145/2933057.2933063 – volume: 30 start-page: 413 issue: 6 year: 2017 ident: 463_CR38 publication-title: Distrib. Comput. doi: 10.1007/s00446-016-0291-x – volume: 9 start-page: 88177 year: 2021 ident: 463_CR9 publication-title: IEEE Access doi: 10.1109/ACCESS.2021.3089081 – ident: 463_CR45 doi: 10.1145/2484239.2484266 – volume: 41 start-page: 829 issue: 4 year: 2012 ident: 463_CR15 publication-title: SIAM J. Comput. doi: 10.1137/100796534 – volume: 32 start-page: 291 issue: 4 year: 2019 ident: 463_CR41 publication-title: Distrib. Comput. doi: 10.1007/s00446-018-0333-7 – ident: 463_CR23 doi: 10.1007/978-3-642-10877-8_7 – volume: 28 start-page: 333 issue: 5 year: 2015 ident: 463_CR43 publication-title: Distrib. Comput. doi: 10.1007/s00446-015-0248-5 – ident: 463_CR40 doi: 10.1007/s00446-019-00359-x – volume: 37 start-page: 89 issue: 10 year: 2006 ident: 463_CR11 publication-title: Syst. Comput. Japan doi: 10.1002/scj.20331 – volume: 33 start-page: 171 year: 2015 ident: 463_CR46 publication-title: J. Discrete Algorithms doi: 10.1016/j.jda.2015.04.001 |
| SSID | ssj0003112 |
| Score | 2.385769 |
| Snippet | A distributed algorithm
A
solves the
Point Convergence
task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under... A distributed algorithm $${\mathcal {A}}$$ A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary... A distributed algorithm A solves the Point Convergence task if an arbitrarily large collection of entities, starting in an arbitrary configuration, move under... |
| SourceID | proquest crossref springer |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 279 |
| SubjectTerms | Algorithms Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Configurations Constraints Convergence Euclidean geometry Power Robot control Robots Scheduling Software Engineering/Programming and Operating Systems Theory of Computation Visibility |
| SummonAdditionalLinks | – databaseName: Computer Science Database dbid: K7- link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3NS8MwFA86PXhxfuJ0Sg7eNLg0bdN6ERGHIEwPCjsIJZ8gSDvXTuh_b1-Wbii4i-e2IfT3kvf9fgidi9RQaoQknOrGQRExhTMXE6qDRuHwgRxY7cgm-GiUjMfpsw-4lb6ssr0T3UWtCwUx8iuYXBe7-eg3k08CrFGQXfUUGutogwYBBTl_5GRxEzPqsp3AQE8Czge-aca1zrlMJmk0FAEXkRH-UzEtrc1fCVKnd4bd_-54B217ixPfzkVkF62ZfA91WzYH7A_3Pnp7ynFjDeIJ8KbhwmIJjEtGY1HWuYIZuvU1dkXqrl_TYFljMaugKaKYlXhayKIqMcR18ce8awpD47orvq0P0Ovw_uXugXjuBaJYzICh3oaRaXwhrVNOhQ2t0aHUUmgbRNYozhrsA5uySMQiVZHkEReK2oSahFGVskPUyYvcHCFMuY11GsaDRLJQMSlYaEXEAhlLFTbWRw_R9sdnyg8mB36Mj2wxUtmBlTVgZQ6sjPfQxeKbyXwsx8q3-y1CmT-iZbaEp4cuW4yXj_9e7Xj1aidoK3BiBXVofdSppjNzijbVV_VeTs-cgH4Dk83rrg priority: 102 providerName: ProQuest |
| Title | On the power of bounded asynchrony: convergence by autonomous robots with limited visibility |
| URI | https://link.springer.com/article/10.1007/s00446-024-00463-7 https://www.proquest.com/docview/3087604380 |
| Volume | 37 |
| WOSCitedRecordID | wos001199154700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAVX databaseName: SpringerLINK Contemporary 1997-Present customDbUrl: eissn: 1432-0452 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0003112 issn: 0178-2770 databaseCode: RSV dateStart: 19970101 isFulltext: true titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22 providerName: Springer Nature |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8NAEB58Hbz4Fuuj7MGbLnSzSTbxptIiCLXWB0WEsE8QJJGmFfrv3d0mLYoKegmEbJYws7Mzm5lvPoBjnmpCNBeYEWUPKDwmzuZiTFRgHQ5riZZRnmyCdbvJYJD2KlBYWVe71ylJv1PPwG4-94itT8HuUEcxW4Rl6-4SZ479u8fZ_kuJz3E63nkcMNaqoDLfz_HZHc1jzC9pUe9tOuv_-84NWKuiS3Q-XQ6bsKDzLVivmRtQZcjb8HyTIxv5oTfHkYYKg4RjV9IK8XKSS9cvd3KGfEG6x2ZqJCaIj0cOAFGMSzQsRDEqkfuHi16nCCnkQOq-0HayAw-d9v3lFa54FrCkMXVs9CaMtD33KJUywk1otAqFElyZIDJaMmr1HJiURjzmqYwEixiXxCREJ5TIlO7CUl7keg8QYSZWaRi3EkFDSQWnoeERDUQsZGgjjQaQWtyZrJqQOy6M12zWPtmLL7Piy7z4MtaAk9k7b9MWHL-OPqy1mFXmWGau7WHsm-s34LTW2vzxz7Pt_234AawGXvGuBu0QlkbDsT6CFfk-eimHTVhk_dsmLF-0u72-vbtm2F570VPTL-APTdXmWA |
| linkProvider | Springer Nature |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bS9xAFD6IFdoXL63FbW07D_WpDt3JTDIboRSpFUW7-qAgpZDOFQRJtpvdlvwpf2PnzCa7VNA3H_qcZGAy37nNuXwA71XuGHNKU8lsCFBUxlDmMspsEgyO7Ou-t5FsQg6Hg6ur_HwJbrteGCyr7HRiVNS2MnhH_hEn12VxPvrn0S-KrFGYXe0oNGawOHHNnxCy1Z-OD8L57iTJ4deLL0e0ZRWghmccude9SF3w8q3NJVNeeGeFtlpZn6TeGcnDrhKf81RlKjeplqlUhvkBcwPODA5fCir_iRAhWAryc55-n2t-zmJ2FRnvaSJlv23Sia16MXNKg0WkGJJyKv81hAvv9k5CNtq5w7X_7Q-tw2rrUZP9mQhswJIrn8Nax1ZBWuX1An6clSR4u2SEvHCk8kQjo5SzRNVNaXBGcLNHYhF-7Ed1RDdETSfY9FFNazKudDWpCd5bk5tZVxjBxvxYXNxswuWj7PElLJdV6baAMOkzm4usP9BcGK4VF16lPNGZNiJ4Vz1g3UEXph28jvwfN8V8ZHQERxHAUURwFLIHH-bfjGZjRx58e7tDRNGqoLpYwKEHux2mFo_vX-3Vw6u9g6dHF99Oi9Pj4clreJZESGPN3TYsT8ZT9wZWzO_JdT1-G4WDwM_HxtpfLDRM5A |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1bS9xAFD6IldIXrdbiVq3zoE8a3MkkmY0gUqqLoqz7UEGkkM4VhCXZbnYt-Wv-OufMJrtU0DcffE4yMJnv3OZcPoBdkRpKjZABp9oFKCKhKHNJQHXoDA5vy7bVnmyC93qd29u0vwCPTS8MllU2OtEral0ovCM_xMl1iZ-Pfmjrsoj-afdk-DdABinMtDZ0GlOIXJrqnwvfyuOLU3fWe2HYPfv18zyoGQYCxRKGPOw2io3z-LVOORU2skZHUkuhbRhbozhzOwxtymKRiFTFksdcKGo71HQYVTiIyan_D9zFmChd_fhuZgUY9ZlWB3iHRM7bdcOOb9vzWdTAWccAw1MW8P-N4tzTfZac9Tavu_Ke_9ZnWK49bfJjKhqrsGDyNVhpWCxIrdS-wO_rnDgvmAyRL44UlkhkmjKaiLLKFc4Oro6IL873faqGyIqIyRibQYpJSUaFLMYlwftsMph2ixFs2PdFx9U63LzJHr_CYl7kZgMI5TbRaZS0O5JFiknBIitiFspEqsh5XS2gzaFnqh7Ijrwgg2w2StoDJXNAyTxQMt6C_dk3w-k4klff3mrQkdWqqczm0GjBQYOv-eOXV_v2-mo78NFBLLu66F1uwqfQoxtL8bZgcTyamG1YUg_j-3L03csJgT9vDbUntHJVtw |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=On+the+power+of+bounded+asynchrony%3A+convergence+by+autonomous+robots+with+limited+visibility&rft.jtitle=Distributed+computing&rft.au=Kirkpatrick%2C+David&rft.au=Kostitsyna%2C+Irina&rft.au=Navarra%2C+Alfredo&rft.au=Prencipe%2C+Giuseppe&rft.date=2024-09-01&rft.pub=Springer+Berlin+Heidelberg&rft.issn=0178-2770&rft.eissn=1432-0452&rft.volume=37&rft.issue=3&rft.spage=279&rft.epage=308&rft_id=info:doi/10.1007%2Fs00446-024-00463-7&rft.externalDocID=10_1007_s00446_024_00463_7 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0178-2770&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0178-2770&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0178-2770&client=summon |