A structured methodology for designing distributed algorithms for mobile entities
Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algorithms and the writing of the required correctness...
Saved in:
| Published in: | Information sciences Vol. 574; pp. 111 - 132 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.10.2021
|
| Subjects: | |
| ISSN: | 0020-0255, 1872-6291 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algorithms and the writing of the required correctness proofs. We would encourage the usage of a common framework in order to help both algorithm designers and reviewers in the intricate work of delivering and analyzing the proposed resolution strategies.
We demonstrate the effectiveness and usefulness of the new methodology by highlighting various peculiarities arising in different scenarios. In particular, we consider two different tasks for asynchronous entities moving in the Euclidean plane and in graphs, respectively. We show how two resolution strategies have been designed by following the accurate guide dictated by the methodology. Furthermore, we also show how the corresponding correctness proofs are obtained. |
|---|---|
| AbstractList | Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology to tackle the arisen problems. The aim is to simplify both the design of the resolution algorithms and the writing of the required correctness proofs. We would encourage the usage of a common framework in order to help both algorithm designers and reviewers in the intricate work of delivering and analyzing the proposed resolution strategies.
We demonstrate the effectiveness and usefulness of the new methodology by highlighting various peculiarities arising in different scenarios. In particular, we consider two different tasks for asynchronous entities moving in the Euclidean plane and in graphs, respectively. We show how two resolution strategies have been designed by following the accurate guide dictated by the methodology. Furthermore, we also show how the corresponding correctness proofs are obtained. |
| Author | Di Stefano, Gabriele Navarra, Alfredo Cicerone, Serafino |
| Author_xml | – sequence: 1 givenname: Serafino surname: Cicerone fullname: Cicerone, Serafino email: serafino.cicerone@univaq.it organization: Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università degli Studi dell’Aquila, Via Vetoio I-67100, L’Aquila, Italy – sequence: 2 givenname: Gabriele surname: Di Stefano fullname: Di Stefano, Gabriele email: gabriele.distefano@univaq.it organization: Dipartimento di Ingegneria e Scienze dell’Informazione e Matematica, Università degli Studi dell’Aquila, Via Vetoio I-67100, L’Aquila, Italy – sequence: 3 givenname: Alfredo surname: Navarra fullname: Navarra, Alfredo email: alfredo.navarra@unipg.it organization: Dipartimento di Matematica e Informatica, Università degli Studi di Perugia, Via Vanvitelli I-06123, Perugia, Italy |
| BookMark | eNp9kE1LAzEQhoNUsK3-AG_7B3adpPvRxVMpfkFBBD2HbDK7nbJNJEmF_ntT68mDlxmGeZ-BeWZsYp1Fxm45FBx4fbcryIZCgOAFVAWUiws25ctG5LVo-YRNAQTkIKrqis1C2AFA2dT1lL2tshD9QceDR5PtMW6dcaMbjlnvfGYw0GDJDpmhFKPuEFNKjYPzFLf78BPau45GzNBGioThml32agx489vn7OPx4X39nG9en17Wq02uBRcxVS1Q6b41baWqvmu6Zd2lCUveLUtI60aZXiF0i8YYzftS85QwQoiS97pdzFlzvqu9C8FjLzVFFcnZ6BWNkoM8mZE7mczIkxkJlUxmEsn_kJ-e9sof_2Xuzwyml74IvQya0Go05FFHaRz9Q38DGYCBgA |
| CitedBy_id | crossref_primary_10_1016_j_tcs_2024_114510 crossref_primary_10_1016_j_jpdc_2025_105129 crossref_primary_10_1016_j_ins_2022_02_055 crossref_primary_10_1016_j_tcs_2025_115553 crossref_primary_10_1109_ACCESS_2023_3244844 crossref_primary_10_1016_j_tcs_2022_11_021 crossref_primary_10_1109_ACCESS_2021_3123510 crossref_primary_10_1016_j_pmcj_2023_101842 |
| Cites_doi | 10.1109/LRA.2019.2930432 10.1016/j.jpdc.2018.09.015 10.1137/0212052 10.1016/j.tcs.2015.09.018 10.1016/j.tcs.2018.05.002 10.1109/70.795787 10.1007/978-3-030-11072-7 10.1007/978-3-030-17402-6_15 10.1109/ROBOT.1990.126059 10.1007/978-3-031-02008-7 10.1109/MRA.2007.339623 10.1016/j.tcs.2010.01.037 10.1016/j.jcss.2007.09.004 10.1016/j.ins.2020.06.040 10.1007/978-3-030-03232-6_22 10.1007/s10846-015-0237-8 10.1007/s00446-018-0325-7 10.1137/S009753979628292X 10.1016/j.swevo.2019.100565 10.1007/978-3-030-11072-7_12 10.1162/artl_r_00061 10.1007/978-3-540-30552-1_2 10.1007/978-3-319-49259-9_7 10.1007/s00446-014-0220-9 10.1007/s00446-014-0212-9 10.1007/s00446-018-0333-7 10.1016/j.ic.2018.09.010 10.1145/3427796.3427833 10.1007/978-3-642-15763-9_26 10.1016/j.tcs.2008.07.026 10.1007/s00446-014-0226-3 10.1137/140958682 10.1137/100796534 10.1109/ICDCS.2017.80 10.3389/frobt.2020.591402 10.1007/s00453-016-0233-9 10.1109/ICRA.2012.6224638 |
| ContentType | Journal Article |
| Copyright | 2021 Elsevier Inc. |
| Copyright_xml | – notice: 2021 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.ins.2021.05.043 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering Library & Information Science |
| EISSN | 1872-6291 |
| EndPage | 132 |
| ExternalDocumentID | 10_1016_j_ins_2021_05_043 S002002552100503X |
| GroupedDBID | --K --M --Z -~X .DC .~1 0R~ 1B1 1OL 1RT 1~. 1~5 29I 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN ABAOU ABBOA ABEFU ABFNM ABJNI ABMAC ABTAH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD APLSM ARUGR ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q GBLVA GBOLZ HAMUX HLZ HVGLF HZ~ H~9 IHE J1W JJJVA KOM LG9 LY1 M41 MHUIS MO0 MS~ N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SST SSV SSW SSZ T5K TN5 TWZ UHS WH7 WUQ XPP YYP ZMT ZY4 ~02 ~G- 77I 9DU AATTM AAXKI AAYWO AAYXX ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c212t-c2c2eacf9d95a5fb7b86bf9de41b840c2c7adfae0b37ddc1f4c186bd22241fc93 |
| ISSN | 0020-0255 |
| IngestDate | Sat Nov 29 06:58:10 EST 2025 Tue Nov 18 21:53:46 EST 2025 Fri Feb 23 02:42:57 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Pattern formation 68Q25 Mobile entities Asynchrony 68W15 Distributed algorithms 68Q10 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c212t-c2c2eacf9d95a5fb7b86bf9de41b840c2c7adfae0b37ddc1f4c186bd22241fc93 |
| PageCount | 22 |
| ParticipantIDs | crossref_citationtrail_10_1016_j_ins_2021_05_043 crossref_primary_10_1016_j_ins_2021_05_043 elsevier_sciencedirect_doi_10_1016_j_ins_2021_05_043 |
| PublicationCentury | 2000 |
| PublicationDate | October 2021 2021-10-00 |
| PublicationDateYYYYMMDD | 2021-10-01 |
| PublicationDate_xml | – month: 10 year: 2021 text: October 2021 |
| PublicationDecade | 2020 |
| PublicationTitle | Information sciences |
| PublicationYear | 2021 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Kawamura, Kobayashi (b0240) 2015; 28 Yim, Shen, Salemi, Rus, Moll, Lipson, Klavins, Chirikjian (b0035) 2007; 14 Ahmadzadeh, Masehian, Asadpour (b0045) 2016; 81 D’Angelo, Di Stefano, Navarra (b0130) 2014; 27 S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs, in: Proc. 22nd Int.’l Conf. on Distributed Computing and Networking (ICDCN), ACM, New York, NY, USA, 2021, p. 56–65. doi:10.1145/3427796.3427833. D’Emidio, Di Stefano, Frigioni, Navarra (b0135) 2018; 263 E. Sahin, Swarm robotics: From sources of inspiration to domains of application, in: E. Sahin, W.M. Spears (Eds.), Swarm Robotics, SAB 2004 Int’.l Workshop, Santa Monica, CA, USA, July 17, 2004, Revised Selected Papers, Vol. 3342 of Lecture Notes in Computer Science, Springer, 2004, pp. 10–20. doi:10.1007/978-3-540-30552-1_2. Y. Dieudonné, F. Petit, V. Villain, Leader election problem versus pattern formation problem, in: Proc. 24th Int’.l Symp. on Distributed Computing (DISC), Vol. 6343 of LNCS, Springer, 2010, pp. 267–281. T. Fukuda, Y. Kawauchi, Cellular robotic system (CEBOT) as one of the realization of self-organizing intelligent universal manipulator, in: Proc. of the 1990 IEEE Int’.l Conf. on Robotics and Automation, Cincinnati, Ohio, USA, May 13–18, 1990, IEEE, 1990, pp. 662–667. doi:10.1109/ROBOT.1990.126059. Ando, Oasa, Suzuki, Yamashita (b0165) 1999; 15 Gasieniec, Klasing, Martin, Navarra, Zhang (b0225) 2008; 74 M. Rubenstein, C. Ahler, R. Nagpal, Kilobot: A low cost scalable robot system for collective behaviors, in: IEEE Int’.l Conf. on Robotics and Automation (ICRA), IEEE, 2012, pp. 3293–3298. doi:10.1109/ICRA.2012.6224638. Y. Kim, Y. Katayama, K. Wada, Pairbot: A novel model for autonomous mobile robot systems consisting of paired robots (2020). arXiv:2009.14426. Cicerone, Di Stefano, Navarra (b0175) 2019; 32 Das, Focardi, Luccio, Markou, Squarcina (b0160) 2019; 764 P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of Lecture Notes in Computer Science, Springer, 2019. doi:10.1007/978-3-030-11072-7. H.T.T. Doan, F. Bonnet, K. Ogata, Model checking of robot gathering, in: 21st Int’.l Conf. on Principles of Distributed Systems (OPODIS) 2017, Vol. 95 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, pp. 12:1–12:16. M. Potop-Butucaru, N. Sznajder, S. Tixeuil, X. Urbain, Formal methods for mobile robots, in: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of Lecture Notes in Computer Science, Springer, 2019, pp. 278–313. doi:10.1007/978-3-030-11072-7_12. Fujinaga, Yamauchi, Ono, Kijima, Yamashita (b0100) 2015; 44 Xu, Liu, Chen, Sun (b0025) 2021; 542 Das, Flocchini, Santoro, Yamashita (b0195) 2015; 28 Suzuki, Yamashita (b0200) 1999; 28 Q. Bramas, S. Tixeuil, Arbitrary pattern formation with four robots, in: Proc. 20th Int’.l Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), Vol. 11201 of LNCS, Springer, 2018, pp. 333–348. D’Angelo, D’Emidio, Das, Navarra, Prencipe (b0060) 2020 Cicerone, Di Stefano, Navarra (b0095) 2019; 32 Q. Bramas, S. Tixeuil, Probabilistic asynchronous arbitrary pattern formation, CoRR abs/1508.03714. URL: https://arxiv.org/abs/1508.03714 Liu, Whitzer, Yim (b0015) 2019; 4 A.L. Christensen, Self-Reconfigurable Robots - An Introduction., Artif. Life 18 (2) (2012) 237–240. doi:10.1162/artl_r_00061. T. Tucci, B. Piranda, J. Bourgeois, A distributed self-assembly planning algorithm for modular robots, in: E. André, S. Koenig, M. Dastani, G. Sukthankar (Eds.), Proc. of the 17th Int’.l Conf. on Autonomous Agents and MultiAgent Systems (AAMAS), International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA/ ACM, 2018, pp. 550–558. Das, Flocchini, Prencipe, Santoro, Yamashita (b0140) 2016; 609 Pattanayak, Mondal, Ramesh, Mandal (b0145) 2019; 123 Ahmadzadeh, Masehian, Asadpour (b0005) 2016; 81 M. Bournat, S. Dubois, F. Petit, Computability of perpetual exploration in highly dynamic rings, in: K. Lee, L. Liu (Eds.), 37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017, IEEE Computer Society, 2017, pp. 794–804. doi:10.1109/ICDCS.2017.80. Czyzowicz, Gasieniec, Kosowski, Kranakis, Krizanc, Taleb (b0235) 2017; 79 Cieliebak, Flocchini, Prencipe, Santoro (b0250) 2012; 41 S. Cicerone, G. Di Stefano, A. Navarra, A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study, CoRR abs/2010.12463. URL: https://arxiv.org/abs/2010.12463 Amir, Bruckstein (b0020) 2019 Niehs, Schmidt, Scheffer, Biediger, Yannuzzi, Jenett, Abdel-Rahman, Cheung, Becker, Fekete (b0065) 2020 P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of LNCS, Springer, 2019. doi:10.1007/978-3-030-11072-7. S. Cicerone, G. Di Stefano, L. Gasieniec, T. Jurdzinski, A. Navarra, T. Radzik, G. Stachowiak, Fair hitting sequence problem: Scheduling activities with varied frequency requirements, in: Algorithms and Complexity - 11th International Conference, CIAC, Vol. 11485 of LNCS, Springer, 2019, pp. 174–186. doi:10.1007/978-3-030-17402-6_15. P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2012. N. Nedjah, L.S. Junior, Review of methodologies and tasks in swarm robotics towards standardization, Swarm Evol. Comput. 50. doi:10.1016/j.swevo.2019.100565. Yamashita, Suzuki (b0205) 2010; 411 Megiddo (b0245) 1983; 12 Pásztor (b0155) 2014; 21 Flocchini, Prencipe, Santoro, Widmayer (b0215) 2008; 407 Salman, Garzón-Ramos, Hasselmann, Birattari (b0150) 2020; 7 S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs, CoRR abs/2010.14152. URL: https://arxiv.org/abs/2010.14152 Q. Bramas, S. Tixeuil, Brief Announcement: Probabilistic asynchronous arbitrary pattern formation, in: Proc. 18th Int’.l Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), Vol. 10083 of LNCS, 2016, pp. 88–93. Y. Dieudonné, F. Petit, V. Villain, Leader election problem versus pattern formation problem, CoRR abs/0902.2851. URL: http://arxiv.org/abs/0902.2851. Ahmadzadeh (10.1016/j.ins.2021.05.043_b0005) 2016; 81 Cicerone (10.1016/j.ins.2021.05.043_b0095) 2019; 32 Cieliebak (10.1016/j.ins.2021.05.043_b0250) 2012; 41 Liu (10.1016/j.ins.2021.05.043_b0015) 2019; 4 Fujinaga (10.1016/j.ins.2021.05.043_b0100) 2015; 44 Megiddo (10.1016/j.ins.2021.05.043_b0245) 1983; 12 Flocchini (10.1016/j.ins.2021.05.043_b0215) 2008; 407 Pattanayak (10.1016/j.ins.2021.05.043_b0145) 2019; 123 Xu (10.1016/j.ins.2021.05.043_b0025) 2021; 542 10.1016/j.ins.2021.05.043_b0010 10.1016/j.ins.2021.05.043_b0055 10.1016/j.ins.2021.05.043_b0210 10.1016/j.ins.2021.05.043_b0170 10.1016/j.ins.2021.05.043_b0050 10.1016/j.ins.2021.05.043_b0090 Suzuki (10.1016/j.ins.2021.05.043_b0200) 1999; 28 Salman (10.1016/j.ins.2021.05.043_b0150) 2020; 7 Cicerone (10.1016/j.ins.2021.05.043_b0175) 2019; 32 Niehs (10.1016/j.ins.2021.05.043_b0065) 2020 Yamashita (10.1016/j.ins.2021.05.043_b0205) 2010; 411 Czyzowicz (10.1016/j.ins.2021.05.043_b0235) 2017; 79 10.1016/j.ins.2021.05.043_b0125 Amir (10.1016/j.ins.2021.05.043_b0020) 2019 Ando (10.1016/j.ins.2021.05.043_b0165) 1999; 15 Ahmadzadeh (10.1016/j.ins.2021.05.043_b0045) 2016; 81 Gasieniec (10.1016/j.ins.2021.05.043_b0225) 2008; 74 10.1016/j.ins.2021.05.043_b0120 10.1016/j.ins.2021.05.043_b0040 10.1016/j.ins.2021.05.043_b0085 10.1016/j.ins.2021.05.043_b0080 Das (10.1016/j.ins.2021.05.043_b0140) 2016; 609 10.1016/j.ins.2021.05.043_b0105 D’Emidio (10.1016/j.ins.2021.05.043_b0135) 2018; 263 10.1016/j.ins.2021.05.043_b0115 10.1016/j.ins.2021.05.043_b0075 10.1016/j.ins.2021.05.043_b0230 10.1016/j.ins.2021.05.043_b0110 10.1016/j.ins.2021.05.043_b0030 10.1016/j.ins.2021.05.043_b0190 10.1016/j.ins.2021.05.043_b0070 D’Angelo (10.1016/j.ins.2021.05.043_b0060) 2020 Das (10.1016/j.ins.2021.05.043_b0195) 2015; 28 D’Angelo (10.1016/j.ins.2021.05.043_b0130) 2014; 27 Pásztor (10.1016/j.ins.2021.05.043_b0155) 2014; 21 10.1016/j.ins.2021.05.043_b0185 Das (10.1016/j.ins.2021.05.043_b0160) 2019; 764 10.1016/j.ins.2021.05.043_b0220 Kawamura (10.1016/j.ins.2021.05.043_b0240) 2015; 28 Yim (10.1016/j.ins.2021.05.043_b0035) 2007; 14 10.1016/j.ins.2021.05.043_b0180 |
| References_xml | – volume: 14 start-page: 43 year: 2007 end-page: 52 ident: b0035 article-title: Modular self-reconfigurable robot systems [grand challenges of robotics] publication-title: IEEE Robotics Automation Magazine – reference: T. Fukuda, Y. Kawauchi, Cellular robotic system (CEBOT) as one of the realization of self-organizing intelligent universal manipulator, in: Proc. of the 1990 IEEE Int’.l Conf. on Robotics and Automation, Cincinnati, Ohio, USA, May 13–18, 1990, IEEE, 1990, pp. 662–667. doi:10.1109/ROBOT.1990.126059. – volume: 15 start-page: 818 year: 1999 end-page: 828 ident: b0165 article-title: Distributed memoryless point convergence algorithm for mobile robots with limited visibility publication-title: IEEE Trans. Robotics Autom. – reference: S. Cicerone, G. Di Stefano, A. Navarra, A methodology to design distributed algorithms for mobile entities: the pattern formation problem as case study, CoRR abs/2010.12463. URL: https://arxiv.org/abs/2010.12463 – start-page: 276 year: 2020 end-page: 284 ident: b0060 article-title: Leader election and compaction for asynchronous silent programmable matter publication-title: Proc. 19th Int’.l Conf. on Autonomous Agents and Multiagent Systems (AAMAS), International Foundation for Autonomous Agents and Multiagent Systems – reference: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of Lecture Notes in Computer Science, Springer, 2019. doi:10.1007/978-3-030-11072-7. – reference: M. Rubenstein, C. Ahler, R. Nagpal, Kilobot: A low cost scalable robot system for collective behaviors, in: IEEE Int’.l Conf. on Robotics and Automation (ICRA), IEEE, 2012, pp. 3293–3298. doi:10.1109/ICRA.2012.6224638. – start-page: 8252 year: 2020 end-page: 8259 ident: b0065 article-title: Recognition and reconfiguration of lattice-based cellular structures by simple robots publication-title: Proc. of the IEEE International Conf. on Robotics and Automation (ICRA) – reference: S. Cicerone, G. Di Stefano, L. Gasieniec, T. Jurdzinski, A. Navarra, T. Radzik, G. Stachowiak, Fair hitting sequence problem: Scheduling activities with varied frequency requirements, in: Algorithms and Complexity - 11th International Conference, CIAC, Vol. 11485 of LNCS, Springer, 2019, pp. 174–186. doi:10.1007/978-3-030-17402-6_15. – reference: Q. Bramas, S. Tixeuil, Arbitrary pattern formation with four robots, in: Proc. 20th Int’.l Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), Vol. 11201 of LNCS, Springer, 2018, pp. 333–348. – reference: H.T.T. Doan, F. Bonnet, K. Ogata, Model checking of robot gathering, in: 21st Int’.l Conf. on Principles of Distributed Systems (OPODIS) 2017, Vol. 95 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018, pp. 12:1–12:16. – reference: M. Potop-Butucaru, N. Sznajder, S. Tixeuil, X. Urbain, Formal methods for mobile robots, in: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of Lecture Notes in Computer Science, Springer, 2019, pp. 278–313. doi:10.1007/978-3-030-11072-7_12. – volume: 263 start-page: 57 year: 2018 end-page: 74 ident: b0135 article-title: Characterizing the computational power of mobile robots on graphs and implications for the euclidean plane publication-title: Inf. Comput. – volume: 4 start-page: 4231 year: 2019 end-page: 4238 ident: b0015 article-title: A distributed reconfiguration planning algorithm for modular robots publication-title: IEEE Robotics Automation Letters – reference: Q. Bramas, S. Tixeuil, Brief Announcement: Probabilistic asynchronous arbitrary pattern formation, in: Proc. 18th Int’.l Symp. on Stabilization, Safety, and Security of Distributed Systems (SSS), Vol. 10083 of LNCS, 2016, pp. 88–93. – reference: Y. Dieudonné, F. Petit, V. Villain, Leader election problem versus pattern formation problem, in: Proc. 24th Int’.l Symp. on Distributed Computing (DISC), Vol. 6343 of LNCS, Springer, 2010, pp. 267–281. – reference: M. Bournat, S. Dubois, F. Petit, Computability of perpetual exploration in highly dynamic rings, in: K. Lee, L. Liu (Eds.), 37th IEEE International Conference on Distributed Computing Systems, ICDCS 2017, Atlanta, GA, USA, June 5-8, 2017, IEEE Computer Society, 2017, pp. 794–804. doi:10.1109/ICDCS.2017.80. – volume: 12 start-page: 759 year: 1983 end-page: 776 ident: b0245 article-title: Linear-time algorithms for linear programming in R publication-title: SIAM J. Comput. – reference: Y. Kim, Y. Katayama, K. Wada, Pairbot: A novel model for autonomous mobile robot systems consisting of paired robots (2020). arXiv:2009.14426. – volume: 28 start-page: 131 year: 2015 end-page: 145 ident: b0195 article-title: Forming sequences of geometric patterns with oblivious mobile robots publication-title: Distrib. Comput. – volume: 27 start-page: 255 year: 2014 end-page: 285 ident: b0130 article-title: Gathering on rings under the look-compute-move model publication-title: Distrib. Comput. – volume: 79 start-page: 925 year: 2017 end-page: 940 ident: b0235 article-title: When patrolmen become corrupted: Monitoring a graph using faulty mobile robots publication-title: Algorithmica – volume: 764 start-page: 42 year: 2019 end-page: 60 ident: b0160 article-title: Gathering of robots in a ring with mobile faults publication-title: Theor. Comput. Sci. – volume: 81 start-page: 317 year: 2016 end-page: 357 ident: b0005 article-title: Modular robotic systems: Characteristics and applications publication-title: J. Intell. Robotic Syst. – reference: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Mobile Entities, Current Research in Moving and Computing, Vol. 11340 of LNCS, Springer, 2019. doi:10.1007/978-3-030-11072-7. – volume: 21 start-page: 1073 year: 2014 end-page: 1080 ident: b0155 article-title: Gathering simulation of real robot swarm publication-title: Tehnicki vjesnik – reference: T. Tucci, B. Piranda, J. Bourgeois, A distributed self-assembly planning algorithm for modular robots, in: E. André, S. Koenig, M. Dastani, G. Sukthankar (Eds.), Proc. of the 17th Int’.l Conf. on Autonomous Agents and MultiAgent Systems (AAMAS), International Foundation for Autonomous Agents and Multiagent Systems Richland, SC, USA/ ACM, 2018, pp. 550–558. – reference: A.L. Christensen, Self-Reconfigurable Robots - An Introduction., Artif. Life 18 (2) (2012) 237–240. doi:10.1162/artl_r_00061. – volume: 32 start-page: 91 year: 2019 end-page: 132 ident: b0095 article-title: Asynchronous arbitrary pattern formation: the effects of a rigorous approach publication-title: Distrib. Comput. – reference: N. Nedjah, L.S. Junior, Review of methodologies and tasks in swarm robotics towards standardization, Swarm Evol. Comput. 50. doi:10.1016/j.swevo.2019.100565. – reference: Q. Bramas, S. Tixeuil, Probabilistic asynchronous arbitrary pattern formation, CoRR abs/1508.03714. URL: https://arxiv.org/abs/1508.03714 – volume: 123 start-page: 145 year: 2019 end-page: 155 ident: b0145 article-title: Gathering of mobile robots with weak multiplicity detection in presence of crash-faults publication-title: J. Parallel Distrib. Comput. – reference: P. Flocchini, G. Prencipe, N. Santoro (Eds.), Distributed Computing by Oblivious Mobile Robots, Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2012. – volume: 7 year: 2020 ident: b0150 article-title: Phormica: Photochromic pheromone release and detection system for stigmergic coordination in robot swarms publication-title: Frontiers Robotics AI – reference: E. Sahin, Swarm robotics: From sources of inspiration to domains of application, in: E. Sahin, W.M. Spears (Eds.), Swarm Robotics, SAB 2004 Int’.l Workshop, Santa Monica, CA, USA, July 17, 2004, Revised Selected Papers, Vol. 3342 of Lecture Notes in Computer Science, Springer, 2004, pp. 10–20. doi:10.1007/978-3-540-30552-1_2. – start-page: 113 year: 2019 end-page: 121 ident: b0020 article-title: Minimizing travel in the uniform dispersal problem for robotic sensors publication-title: Proc. 18th Int’.l Conf. on Autonomous Agents and MultiAgent Systems (AAMAS), International Foundation for Autonomous Agents and Multiagent Systems – reference: Y. Dieudonné, F. Petit, V. Villain, Leader election problem versus pattern formation problem, CoRR abs/0902.2851. URL: http://arxiv.org/abs/0902.2851. – volume: 542 start-page: 286 year: 2021 end-page: 301 ident: b0025 article-title: An artificial moment method for conflict resolutions with robots being close to their targets publication-title: Inf. Sci. – volume: 28 start-page: 147 year: 2015 end-page: 154 ident: b0240 article-title: Fence patrolling by mobile agents with distinct speeds publication-title: Distrib. Comput. – volume: 74 start-page: 808 year: 2008 end-page: 822 ident: b0225 article-title: Fast periodic graph exploration with constant memory publication-title: J. Comput. Syst. Sci. – volume: 32 start-page: 291 year: 2019 end-page: 315 ident: b0175 article-title: Embedded pattern formation by asynchronous robots without chirality publication-title: Distrib. Comput. – reference: S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs, CoRR abs/2010.14152. URL: https://arxiv.org/abs/2010.14152 – volume: 609 start-page: 171 year: 2016 end-page: 184 ident: b0140 article-title: Autonomous mobile robots with lights publication-title: Theor. Comput. Sci. – volume: 407 start-page: 412 year: 2008 end-page: 447 ident: b0215 article-title: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots publication-title: Theor. Comput. Sci. – reference: S. Cicerone, A. Di Fonso, G. Di Stefano, A. Navarra, Arbitrary pattern formation on infinite regular tessellation graphs, in: Proc. 22nd Int.’l Conf. on Distributed Computing and Networking (ICDCN), ACM, New York, NY, USA, 2021, p. 56–65. doi:10.1145/3427796.3427833. – volume: 44 start-page: 740 year: 2015 end-page: 785 ident: b0100 article-title: Pattern formation by oblivious asynchronous mobile robots publication-title: SIAM J. Computing – volume: 28 start-page: 1347 year: 1999 end-page: 1363 ident: b0200 article-title: Distributed anonymous mobile robots: Formation of geometric patterns publication-title: SIAM J. Comput. – volume: 41 start-page: 829 year: 2012 end-page: 879 ident: b0250 article-title: Distributed computing by mobile robots: Gathering publication-title: SIAM J. on Computing – volume: 81 start-page: 317 year: 2016 end-page: 357 ident: b0045 article-title: Modular robotic systems: Characteristics and applications publication-title: J. Intell. Robotic Syst. – volume: 411 start-page: 2433 year: 2010 end-page: 2453 ident: b0205 article-title: Characterizing geometric patterns formable by oblivious anonymous mobile robots publication-title: Theor. Comput. Sci. – volume: 4 start-page: 4231 issue: 4 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0015 article-title: A distributed reconfiguration planning algorithm for modular robots publication-title: IEEE Robotics Automation Letters doi: 10.1109/LRA.2019.2930432 – volume: 123 start-page: 145 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0145 article-title: Gathering of mobile robots with weak multiplicity detection in presence of crash-faults publication-title: J. Parallel Distrib. Comput. doi: 10.1016/j.jpdc.2018.09.015 – ident: 10.1016/j.ins.2021.05.043_b0180 – volume: 12 start-page: 759 issue: 4 year: 1983 ident: 10.1016/j.ins.2021.05.043_b0245 article-title: Linear-time algorithms for linear programming in R3 and related problems publication-title: SIAM J. Comput. doi: 10.1137/0212052 – volume: 609 start-page: 171 year: 2016 ident: 10.1016/j.ins.2021.05.043_b0140 article-title: Autonomous mobile robots with lights publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2015.09.018 – volume: 764 start-page: 42 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0160 article-title: Gathering of robots in a ring with mobile faults publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2018.05.002 – volume: 15 start-page: 818 issue: 5 year: 1999 ident: 10.1016/j.ins.2021.05.043_b0165 article-title: Distributed memoryless point convergence algorithm for mobile robots with limited visibility publication-title: IEEE Trans. Robotics Autom. doi: 10.1109/70.795787 – ident: 10.1016/j.ins.2021.05.043_b0085 doi: 10.1007/978-3-030-11072-7 – ident: 10.1016/j.ins.2021.05.043_b0190 – ident: 10.1016/j.ins.2021.05.043_b0230 doi: 10.1007/978-3-030-17402-6_15 – ident: 10.1016/j.ins.2021.05.043_b0040 doi: 10.1109/ROBOT.1990.126059 – start-page: 8252 year: 2020 ident: 10.1016/j.ins.2021.05.043_b0065 article-title: Recognition and reconfiguration of lattice-based cellular structures by simple robots – ident: 10.1016/j.ins.2021.05.043_b0080 doi: 10.1007/978-3-031-02008-7 – volume: 14 start-page: 43 issue: 1 year: 2007 ident: 10.1016/j.ins.2021.05.043_b0035 article-title: Modular self-reconfigurable robot systems [grand challenges of robotics] publication-title: IEEE Robotics Automation Magazine doi: 10.1109/MRA.2007.339623 – volume: 411 start-page: 2433 issue: 26–28 year: 2010 ident: 10.1016/j.ins.2021.05.043_b0205 article-title: Characterizing geometric patterns formable by oblivious anonymous mobile robots publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2010.01.037 – volume: 74 start-page: 808 issue: 5 year: 2008 ident: 10.1016/j.ins.2021.05.043_b0225 article-title: Fast periodic graph exploration with constant memory publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2007.09.004 – volume: 542 start-page: 286 year: 2021 ident: 10.1016/j.ins.2021.05.043_b0025 article-title: An artificial moment method for conflict resolutions with robots being close to their targets publication-title: Inf. Sci. doi: 10.1016/j.ins.2020.06.040 – ident: 10.1016/j.ins.2021.05.043_b0210 doi: 10.1007/978-3-030-03232-6_22 – ident: 10.1016/j.ins.2021.05.043_b0075 doi: 10.1007/978-3-030-11072-7 – volume: 81 start-page: 317 issue: 3–4 year: 2016 ident: 10.1016/j.ins.2021.05.043_b0045 article-title: Modular robotic systems: Characteristics and applications publication-title: J. Intell. Robotic Syst. doi: 10.1007/s10846-015-0237-8 – volume: 32 start-page: 91 issue: 2 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0095 article-title: Asynchronous arbitrary pattern formation: the effects of a rigorous approach publication-title: Distrib. Comput. doi: 10.1007/s00446-018-0325-7 – volume: 28 start-page: 1347 issue: 4 year: 1999 ident: 10.1016/j.ins.2021.05.043_b0200 article-title: Distributed anonymous mobile robots: Formation of geometric patterns publication-title: SIAM J. Comput. doi: 10.1137/S009753979628292X – volume: 21 start-page: 1073 issue: 5 year: 2014 ident: 10.1016/j.ins.2021.05.043_b0155 article-title: Gathering simulation of real robot swarm publication-title: Tehnicki vjesnik – ident: 10.1016/j.ins.2021.05.043_b0170 doi: 10.1016/j.swevo.2019.100565 – ident: 10.1016/j.ins.2021.05.043_b0090 doi: 10.1007/978-3-030-11072-7_12 – ident: 10.1016/j.ins.2021.05.043_b0050 – ident: 10.1016/j.ins.2021.05.043_b0010 doi: 10.1162/artl_r_00061 – ident: 10.1016/j.ins.2021.05.043_b0030 doi: 10.1007/978-3-540-30552-1_2 – start-page: 113 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0020 article-title: Minimizing travel in the uniform dispersal problem for robotic sensors – ident: 10.1016/j.ins.2021.05.043_b0105 doi: 10.1007/978-3-319-49259-9_7 – volume: 28 start-page: 131 issue: 2 year: 2015 ident: 10.1016/j.ins.2021.05.043_b0195 article-title: Forming sequences of geometric patterns with oblivious mobile robots publication-title: Distrib. Comput. doi: 10.1007/s00446-014-0220-9 – volume: 27 start-page: 255 issue: 4 year: 2014 ident: 10.1016/j.ins.2021.05.043_b0130 article-title: Gathering on rings under the look-compute-move model publication-title: Distrib. Comput. doi: 10.1007/s00446-014-0212-9 – volume: 32 start-page: 291 issue: 4 year: 2019 ident: 10.1016/j.ins.2021.05.043_b0175 article-title: Embedded pattern formation by asynchronous robots without chirality publication-title: Distrib. Comput. doi: 10.1007/s00446-018-0333-7 – volume: 263 start-page: 57 year: 2018 ident: 10.1016/j.ins.2021.05.043_b0135 article-title: Characterizing the computational power of mobile robots on graphs and implications for the euclidean plane publication-title: Inf. Comput. doi: 10.1016/j.ic.2018.09.010 – ident: 10.1016/j.ins.2021.05.043_b0185 doi: 10.1145/3427796.3427833 – volume: 81 start-page: 317 issue: 3–4 year: 2016 ident: 10.1016/j.ins.2021.05.043_b0005 article-title: Modular robotic systems: Characteristics and applications publication-title: J. Intell. Robotic Syst. doi: 10.1007/s10846-015-0237-8 – ident: 10.1016/j.ins.2021.05.043_b0120 doi: 10.1007/978-3-642-15763-9_26 – ident: 10.1016/j.ins.2021.05.043_b0070 – volume: 407 start-page: 412 issue: 1–3 year: 2008 ident: 10.1016/j.ins.2021.05.043_b0215 article-title: Arbitrary pattern formation by asynchronous, anonymous, oblivious robots publication-title: Theor. Comput. Sci. doi: 10.1016/j.tcs.2008.07.026 – volume: 28 start-page: 147 issue: 2 year: 2015 ident: 10.1016/j.ins.2021.05.043_b0240 article-title: Fence patrolling by mobile agents with distinct speeds publication-title: Distrib. Comput. doi: 10.1007/s00446-014-0226-3 – start-page: 276 year: 2020 ident: 10.1016/j.ins.2021.05.043_b0060 article-title: Leader election and compaction for asynchronous silent programmable matter – volume: 44 start-page: 740 issue: 3 year: 2015 ident: 10.1016/j.ins.2021.05.043_b0100 article-title: Pattern formation by oblivious asynchronous mobile robots publication-title: SIAM J. Computing doi: 10.1137/140958682 – ident: 10.1016/j.ins.2021.05.043_b0110 – volume: 41 start-page: 829 issue: 4 year: 2012 ident: 10.1016/j.ins.2021.05.043_b0250 article-title: Distributed computing by mobile robots: Gathering publication-title: SIAM J. on Computing doi: 10.1137/100796534 – ident: 10.1016/j.ins.2021.05.043_b0220 doi: 10.1109/ICDCS.2017.80 – volume: 7 year: 2020 ident: 10.1016/j.ins.2021.05.043_b0150 article-title: Phormica: Photochromic pheromone release and detection system for stigmergic coordination in robot swarms publication-title: Frontiers Robotics AI doi: 10.3389/frobt.2020.591402 – volume: 79 start-page: 925 issue: 3 year: 2017 ident: 10.1016/j.ins.2021.05.043_b0235 article-title: When patrolmen become corrupted: Monitoring a graph using faulty mobile robots publication-title: Algorithmica doi: 10.1007/s00453-016-0233-9 – ident: 10.1016/j.ins.2021.05.043_b0115 – ident: 10.1016/j.ins.2021.05.043_b0125 – ident: 10.1016/j.ins.2021.05.043_b0055 doi: 10.1109/ICRA.2012.6224638 |
| SSID | ssj0004766 |
| Score | 2.4424458 |
| Snippet | Following the wide investigation in distributed computing issues by mobile entities of the last two decades, we consider the need of a structured methodology... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 111 |
| SubjectTerms | Asynchrony Distributed algorithms Mobile entities Pattern formation |
| Title | A structured methodology for designing distributed algorithms for mobile entities |
| URI | https://dx.doi.org/10.1016/j.ins.2021.05.043 |
| Volume | 574 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1872-6291 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0004766 issn: 0020-0255 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1LbxMxELag5QAHVAqIUop8QByIVtp17Hj3GFVtAaEKpIJyW_kJqdJNtQ1Vf37HO_ZmWx4CJC5WsrGTyPN5PDMef0PIq2JiyolmLhPSWXBQRJ5V2vIstxOmGJOOdWU6v3yQx8flbFZ9jDHdi66cgGya8uqqOv-vooZnIOxwdfYvxN1_KTyA1yB0aEHs0P6R4Kcj5IT9HjLLsUA08iyFhELbJWyE8IANjLmh2BX0Uouvy3a--obkDKOzpQZdMUp0q0P7Nd5e6kATN8_eKN8HndMuMUIKKkj5ebPs7eR5yCfzqiv0PTpSug0X2_tItLpUbYsR3oUPFKbDYAQr-rS2GCFLt2RuJHEGkzQLvgvuOahoS8myCcNKXUkTC8kHujRpYdyWCwyD_qDxMfhwCm5KIF9nRcfDisxPt4i0w7l050KBlxtYcGZ3ySaTogJduDl9dzB7v75PK_GMO_3vdBre5QXe-qGf2zMDG-VkizyMzgWdIigekTuu2SYPBpST22QvXlShr-lAljSq-Mfk05Su4UMH8KHQmfbwoQP40DV8uk4IH5rg84R8Pjw42X-bxbIbmQE7ZgWtYbAd-8pWQgmvpYbVDO8cL3TJc_hYKuuVy_VYWmsKz00BPSwL1qA31fgp2WgAbc8IZWPYQITVYzDbeakd-LK28JXhnOXCSLdD8jR5tYmc9KE0yqJOyYenNcx3Hea7zkUN871D3vRDzpGQ5XedeZJIHRcFWoo1wOfXw57_27Bdcn-9Jl6QDZCW2yP3zOVqftG-jCC7Bl3QnYg |
| linkProvider | Elsevier |
| 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=A+structured+methodology+for+designing+distributed+algorithms+for+mobile+entities&rft.jtitle=Information+sciences&rft.au=Cicerone%2C+Serafino&rft.au=Di+Stefano%2C+Gabriele&rft.au=Navarra%2C+Alfredo&rft.date=2021-10-01&rft.pub=Elsevier+Inc&rft.issn=0020-0255&rft.eissn=1872-6291&rft.volume=574&rft.spage=111&rft.epage=132&rft_id=info:doi/10.1016%2Fj.ins.2021.05.043&rft.externalDocID=S002002552100503X |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0020-0255&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0020-0255&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0020-0255&client=summon |