Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots Article Swipe
Stéphane Devismes
,
Anissa Lamani
,
Franck Petit
,
Pascal Raymond
,
Sébastien Tixeuil
·
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.1093/comjnl/bxz166
YOU?
·
· 2019
· Open Access
·
· DOI: https://doi.org/10.1093/comjnl/bxz166
We consider swarms of asynchronous oblivious robots evolving into an anonymous grid-shaped network. In this context, we investigate optimal (w.r.t. the number of robots) deterministic solutions for the terminating exploration problem. We first show lower bounds in the semi-synchronous model. Precisely, we show that at least three robots are required to explore any grid of at least three nodes, even in the probabilistic case. Then, we show that at least four (resp. five) robots are necessary to deterministically explore a $\bf(2,2)$-Grid (resp. a $\bf(3,3)$-Grid). We then propose deterministic algorithms in the asynchronous model. This latter being strictly weakest than the semi-synchronous model, all the aforementioned bounds still hold in that context. Our algorithms actually exhibit the optimal number of robots that is necessary to explore a given grid. Overall, our results show that except in two particular cases, three robots are necessary and sufficient to deterministically explore a grid of at least three nodes and then terminate. The optimal number of robots for the two remaining cases is four for the $\bf(2,2)$-Grid and five for the $\bf(3,3)$-Grid, respectively.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1093/comjnl/bxz166
- OA Status
- green
- Cited By
- 18
- References
- 22
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W3012558506
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W3012558506Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1093/comjnl/bxz166Digital Object Identifier
- Title
-
Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious RobotsWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2019Year of publication
- Publication date
-
2019-12-18Full publication date if available
- Authors
-
Stéphane Devismes, Anissa Lamani, Franck Petit, Pascal Raymond, Sébastien TixeuilList of authors in order
- Landing page
-
https://doi.org/10.1093/comjnl/bxz166Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://hal.science/hal-02363013Direct OA link when available
- Concepts
-
Asynchronous communication, Grid, Robot, Computer science, Context (archaeology), Probabilistic logic, Grid network, Theoretical computer science, Distributed computing, Algorithm, Mathematical optimization, Mathematics, Artificial intelligence, Computer network, Biology, Paleontology, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
18Total citation count in OpenAlex
- Citations by year (recent)
-
2025: 4, 2024: 1, 2023: 5, 2022: 5, 2021: 3Per-year citation counts (last 5 years)
- References (count)
-
22Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W3012558506 |
|---|---|
| doi | https://doi.org/10.1093/comjnl/bxz166 |
| ids.doi | https://doi.org/10.1093/comjnl/bxz166 |
| ids.mag | 3012558506 |
| ids.openalex | https://openalex.org/W3012558506 |
| fwci | 1.55331775 |
| type | article |
| title | Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots |
| biblio.issue | 1 |
| biblio.volume | 64 |
| biblio.last_page | 154 |
| biblio.first_page | 132 |
| topics[0].id | https://openalex.org/T12288 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 1.0 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1705 |
| topics[0].subfield.display_name | Computer Networks and Communications |
| topics[0].display_name | Optimization and Search Problems |
| topics[1].id | https://openalex.org/T10772 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9957000017166138 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1705 |
| topics[1].subfield.display_name | Computer Networks and Communications |
| topics[1].display_name | Distributed systems and fault tolerance |
| topics[2].id | https://openalex.org/T12784 |
| topics[2].field.id | https://openalex.org/fields/22 |
| topics[2].field.display_name | Engineering |
| topics[2].score | 0.993399977684021 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/2210 |
| topics[2].subfield.display_name | Mechanical Engineering |
| topics[2].display_name | Modular Robots and Swarm Intelligence |
| is_xpac | False |
| apc_list.value | 2635 |
| apc_list.currency | GBP |
| apc_list.value_usd | 3232 |
| apc_paid | |
| concepts[0].id | https://openalex.org/C151319957 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8325865268707275 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q752739 |
| concepts[0].display_name | Asynchronous communication |
| concepts[1].id | https://openalex.org/C187691185 |
| concepts[1].level | 2 |
| concepts[1].score | 0.8162312507629395 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q2020720 |
| concepts[1].display_name | Grid |
| concepts[2].id | https://openalex.org/C90509273 |
| concepts[2].level | 2 |
| concepts[2].score | 0.7545113563537598 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q11012 |
| concepts[2].display_name | Robot |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.7030379772186279 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C2779343474 |
| concepts[4].level | 2 |
| concepts[4].score | 0.6079827547073364 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q3109175 |
| concepts[4].display_name | Context (archaeology) |
| concepts[5].id | https://openalex.org/C49937458 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5717287659645081 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q2599292 |
| concepts[5].display_name | Probabilistic logic |
| concepts[6].id | https://openalex.org/C24337046 |
| concepts[6].level | 3 |
| concepts[6].score | 0.43373504281044006 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q4394138 |
| concepts[6].display_name | Grid network |
| concepts[7].id | https://openalex.org/C80444323 |
| concepts[7].level | 1 |
| concepts[7].score | 0.4165838658809662 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[7].display_name | Theoretical computer science |
| concepts[8].id | https://openalex.org/C120314980 |
| concepts[8].level | 1 |
| concepts[8].score | 0.41288265585899353 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q180634 |
| concepts[8].display_name | Distributed computing |
| concepts[9].id | https://openalex.org/C11413529 |
| concepts[9].level | 1 |
| concepts[9].score | 0.36990126967430115 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[9].display_name | Algorithm |
| concepts[10].id | https://openalex.org/C126255220 |
| concepts[10].level | 1 |
| concepts[10].score | 0.3406297564506531 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[10].display_name | Mathematical optimization |
| concepts[11].id | https://openalex.org/C33923547 |
| concepts[11].level | 0 |
| concepts[11].score | 0.2587120831012726 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[11].display_name | Mathematics |
| concepts[12].id | https://openalex.org/C154945302 |
| concepts[12].level | 1 |
| concepts[12].score | 0.1821136474609375 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q11660 |
| concepts[12].display_name | Artificial intelligence |
| concepts[13].id | https://openalex.org/C31258907 |
| concepts[13].level | 1 |
| concepts[13].score | 0.12223190069198608 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q1301371 |
| concepts[13].display_name | Computer network |
| concepts[14].id | https://openalex.org/C86803240 |
| concepts[14].level | 0 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[14].display_name | Biology |
| concepts[15].id | https://openalex.org/C151730666 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q7205 |
| concepts[15].display_name | Paleontology |
| concepts[16].id | https://openalex.org/C2524010 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[16].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/asynchronous-communication |
| keywords[0].score | 0.8325865268707275 |
| keywords[0].display_name | Asynchronous communication |
| keywords[1].id | https://openalex.org/keywords/grid |
| keywords[1].score | 0.8162312507629395 |
| keywords[1].display_name | Grid |
| keywords[2].id | https://openalex.org/keywords/robot |
| keywords[2].score | 0.7545113563537598 |
| keywords[2].display_name | Robot |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.7030379772186279 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/context |
| keywords[4].score | 0.6079827547073364 |
| keywords[4].display_name | Context (archaeology) |
| keywords[5].id | https://openalex.org/keywords/probabilistic-logic |
| keywords[5].score | 0.5717287659645081 |
| keywords[5].display_name | Probabilistic logic |
| keywords[6].id | https://openalex.org/keywords/grid-network |
| keywords[6].score | 0.43373504281044006 |
| keywords[6].display_name | Grid network |
| keywords[7].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[7].score | 0.4165838658809662 |
| keywords[7].display_name | Theoretical computer science |
| keywords[8].id | https://openalex.org/keywords/distributed-computing |
| keywords[8].score | 0.41288265585899353 |
| keywords[8].display_name | Distributed computing |
| keywords[9].id | https://openalex.org/keywords/algorithm |
| keywords[9].score | 0.36990126967430115 |
| keywords[9].display_name | Algorithm |
| keywords[10].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[10].score | 0.3406297564506531 |
| keywords[10].display_name | Mathematical optimization |
| keywords[11].id | https://openalex.org/keywords/mathematics |
| keywords[11].score | 0.2587120831012726 |
| keywords[11].display_name | Mathematics |
| keywords[12].id | https://openalex.org/keywords/artificial-intelligence |
| keywords[12].score | 0.1821136474609375 |
| keywords[12].display_name | Artificial intelligence |
| keywords[13].id | https://openalex.org/keywords/computer-network |
| keywords[13].score | 0.12223190069198608 |
| keywords[13].display_name | Computer network |
| language | en |
| locations[0].id | doi:10.1093/comjnl/bxz166 |
| locations[0].is_oa | False |
| locations[0].source.id | https://openalex.org/S44643521 |
| locations[0].source.issn | 0010-4620, 1460-2067 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | False |
| locations[0].source.issn_l | 0010-4620 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | The Computer Journal |
| locations[0].source.host_organization | https://openalex.org/P4310311648 |
| locations[0].source.host_organization_name | Oxford University Press |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310311648 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | The Computer Journal |
| locations[0].landing_page_url | https://doi.org/10.1093/comjnl/bxz166 |
| locations[1].id | pmh:oai:HAL:hal-03007150v1 |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306402512 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[1].source.host_organization | https://openalex.org/I1294671590 |
| locations[1].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[1].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | info:eu-repo/semantics/article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | ISSN: 0010-4620 |
| locations[1].landing_page_url | https://hal.archives-ouvertes.fr/hal-03007150 |
| locations[2].id | pmh:oai:HAL:hal-02363013v1 |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306402512 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | False |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| locations[2].source.host_organization | https://openalex.org/I1294671590 |
| locations[2].source.host_organization_name | Centre National de la Recherche Scientifique |
| locations[2].source.host_organization_lineage | https://openalex.org/I1294671590 |
| locations[2].license | other-oa |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Journal articles |
| locations[2].license_id | https://openalex.org/licenses/other-oa |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | The Computer Journal, 2021, The Computer Journal, 64 (1), pp.132-154. ⟨10.1093/comjnl/bxz166⟩ |
| locations[2].landing_page_url | https://hal.science/hal-02363013 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5004285781 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-8032-9732 |
| authorships[0].author.display_name | Stéphane Devismes |
| authorships[0].countries | FR |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I899635006 |
| authorships[0].affiliations[0].raw_affiliation_string | VERIMAG UMR 5104, Université Grenoble Alpes, 700 avenue centrale, F-38401, Saint Martin d’Hères, France |
| authorships[0].institutions[0].id | https://openalex.org/I899635006 |
| authorships[0].institutions[0].ror | https://ror.org/02rx3b187 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I899635006 |
| authorships[0].institutions[0].country_code | FR |
| authorships[0].institutions[0].display_name | Université Grenoble Alpes |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Stéphane Devismes |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | VERIMAG UMR 5104, Université Grenoble Alpes, 700 avenue centrale, F-38401, Saint Martin d’Hères, France |
| authorships[1].author.id | https://openalex.org/A5043476646 |
| authorships[1].author.orcid | https://orcid.org/0000-0001-7774-8402 |
| authorships[1].author.display_name | Anissa Lamani |
| authorships[1].affiliations[0].raw_affiliation_string | Ecole Internationale des Sciences du Traitement de l’Information, 4 place Jussieu, 75252 Paris CEDEX 05, France |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Anissa Lamani |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Ecole Internationale des Sciences du Traitement de l’Information, 4 place Jussieu, 75252 Paris CEDEX 05, France |
| authorships[2].author.id | https://openalex.org/A5072850029 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-0948-7842 |
| authorships[2].author.display_name | Franck Petit |
| authorships[2].affiliations[0].raw_affiliation_string | DELYS - DistributEd aLgorithms and sYStems (2 rue Simone Iff -CS 42112 -75589 Paris Cedex 12 - France) |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Franck Petit |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | DELYS - DistributEd aLgorithms and sYStems (2 rue Simone Iff -CS 42112 -75589 Paris Cedex 12 - France) |
| authorships[3].author.id | https://openalex.org/A5002817720 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-3876-9125 |
| authorships[3].author.display_name | Pascal Raymond |
| authorships[3].countries | FR |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I1294671590, https://openalex.org/I4210156361 |
| authorships[3].affiliations[0].raw_affiliation_string | VERIMAG UMR 5104, CNRS, 700 avenue centrale, F-38401, Saint Martin d’Hères, France |
| authorships[3].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[3].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[3].institutions[0].type | government |
| authorships[3].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[3].institutions[0].country_code | FR |
| authorships[3].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[3].institutions[1].id | https://openalex.org/I4210156361 |
| authorships[3].institutions[1].ror | https://ror.org/05afmzm11 |
| authorships[3].institutions[1].type | facility |
| authorships[3].institutions[1].lineage | https://openalex.org/I106785703, https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I4210156361, https://openalex.org/I4210159245, https://openalex.org/I899635006 |
| authorships[3].institutions[1].country_code | FR |
| authorships[3].institutions[1].display_name | Verimag |
| authorships[3].author_position | middle |
| authorships[3].raw_author_name | Pascal Raymond |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | VERIMAG UMR 5104, CNRS, 700 avenue centrale, F-38401, Saint Martin d’Hères, France |
| authorships[4].author.id | https://openalex.org/A5073883755 |
| authorships[4].author.orcid | https://orcid.org/0000-0002-0948-7172 |
| authorships[4].author.display_name | Sébastien Tixeuil |
| authorships[4].countries | FR |
| authorships[4].affiliations[0].institution_ids | https://openalex.org/I4210159731, https://openalex.org/I39804081, https://openalex.org/I1294671590 |
| authorships[4].affiliations[0].raw_affiliation_string | Sorbonne Université, CNRS, LIP6, 4 place Jussieu, 75252 Paris CEDEX 05, France |
| authorships[4].institutions[0].id | https://openalex.org/I1294671590 |
| authorships[4].institutions[0].ror | https://ror.org/02feahw73 |
| authorships[4].institutions[0].type | government |
| authorships[4].institutions[0].lineage | https://openalex.org/I1294671590 |
| authorships[4].institutions[0].country_code | FR |
| authorships[4].institutions[0].display_name | Centre National de la Recherche Scientifique |
| authorships[4].institutions[1].id | https://openalex.org/I4210159731 |
| authorships[4].institutions[1].ror | https://ror.org/05krcen59 |
| authorships[4].institutions[1].type | facility |
| authorships[4].institutions[1].lineage | https://openalex.org/I1294671590, https://openalex.org/I1294671590, https://openalex.org/I39804081, https://openalex.org/I4210159245, https://openalex.org/I4210159731 |
| authorships[4].institutions[1].country_code | FR |
| authorships[4].institutions[1].display_name | LIP6 |
| authorships[4].institutions[2].id | https://openalex.org/I39804081 |
| authorships[4].institutions[2].ror | https://ror.org/02en5vm52 |
| authorships[4].institutions[2].type | education |
| authorships[4].institutions[2].lineage | https://openalex.org/I39804081 |
| authorships[4].institutions[2].country_code | FR |
| authorships[4].institutions[2].display_name | Sorbonne Université |
| authorships[4].author_position | last |
| authorships[4].raw_author_name | Sébastien Tixeuil |
| authorships[4].is_corresponding | False |
| authorships[4].raw_affiliation_strings | Sorbonne Université, CNRS, LIP6, 4 place Jussieu, 75252 Paris CEDEX 05, France |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://hal.science/hal-02363013 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12288 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 1.0 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1705 |
| primary_topic.subfield.display_name | Computer Networks and Communications |
| primary_topic.display_name | Optimization and Search Problems |
| related_works | https://openalex.org/W2116677773, https://openalex.org/W2155261584, https://openalex.org/W2584231425, https://openalex.org/W2280368905, https://openalex.org/W1576883264, https://openalex.org/W1968172879, https://openalex.org/W2170183715, https://openalex.org/W1507130066, https://openalex.org/W1547949468, https://openalex.org/W2378883250 |
| cited_by_count | 18 |
| counts_by_year[0].year | 2025 |
| counts_by_year[0].cited_by_count | 4 |
| counts_by_year[1].year | 2024 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2023 |
| counts_by_year[2].cited_by_count | 5 |
| counts_by_year[3].year | 2022 |
| counts_by_year[3].cited_by_count | 5 |
| counts_by_year[4].year | 2021 |
| counts_by_year[4].cited_by_count | 3 |
| locations_count | 3 |
| best_oa_location.id | pmh:oai:HAL:hal-02363013v1 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306402512 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | False |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | HAL (Le Centre pour la Communication Scientifique Directe) |
| best_oa_location.source.host_organization | https://openalex.org/I1294671590 |
| best_oa_location.source.host_organization_name | Centre National de la Recherche Scientifique |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I1294671590 |
| best_oa_location.license | other-oa |
| best_oa_location.pdf_url | |
| best_oa_location.version | submittedVersion |
| best_oa_location.raw_type | Journal articles |
| best_oa_location.license_id | https://openalex.org/licenses/other-oa |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | The Computer Journal, 2021, The Computer Journal, 64 (1), pp.132-154. ⟨10.1093/comjnl/bxz166⟩ |
| best_oa_location.landing_page_url | https://hal.science/hal-02363013 |
| primary_location.id | doi:10.1093/comjnl/bxz166 |
| primary_location.is_oa | False |
| primary_location.source.id | https://openalex.org/S44643521 |
| primary_location.source.issn | 0010-4620, 1460-2067 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | False |
| primary_location.source.issn_l | 0010-4620 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | The Computer Journal |
| primary_location.source.host_organization | https://openalex.org/P4310311648 |
| primary_location.source.host_organization_name | Oxford University Press |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310311648 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | The Computer Journal |
| primary_location.landing_page_url | https://doi.org/10.1093/comjnl/bxz166 |
| publication_date | 2019-12-18 |
| publication_year | 2019 |
| referenced_works | https://openalex.org/W2105366160, https://openalex.org/W2020796742, https://openalex.org/W2048090017, https://openalex.org/W6631652211, https://openalex.org/W3023452807, https://openalex.org/W6747896652, https://openalex.org/W1617059252, https://openalex.org/W3182674124, https://openalex.org/W7057250550, https://openalex.org/W6750395551, https://openalex.org/W2788620024, https://openalex.org/W6633877456, https://openalex.org/W6633171669, https://openalex.org/W2108943074, https://openalex.org/W2062793829, https://openalex.org/W2125415493, https://openalex.org/W1581477113, https://openalex.org/W2044484214, https://openalex.org/W1980710447, https://openalex.org/W4211103781, https://openalex.org/W2755314021, https://openalex.org/W3100969352 |
| referenced_works_count | 22 |
| abstract_inverted_index.a | 80, 83, 126, 148 |
| abstract_inverted_index.In | 14 |
| abstract_inverted_index.We | 1, 32, 85 |
| abstract_inverted_index.an | 10 |
| abstract_inverted_index.at | 45, 56, 69, 151 |
| abstract_inverted_index.in | 37, 61, 90, 109, 135 |
| abstract_inverted_index.is | 122, 168 |
| abstract_inverted_index.of | 4, 23, 55, 119, 150, 161 |
| abstract_inverted_index.to | 51, 77, 124, 145 |
| abstract_inverted_index.we | 17, 42, 66 |
| abstract_inverted_index.Our | 112 |
| abstract_inverted_index.The | 158 |
| abstract_inverted_index.all | 103 |
| abstract_inverted_index.and | 143, 155, 173 |
| abstract_inverted_index.any | 53 |
| abstract_inverted_index.are | 49, 75, 141 |
| abstract_inverted_index.for | 27, 163, 170, 175 |
| abstract_inverted_index.our | 130 |
| abstract_inverted_index.the | 21, 28, 38, 62, 91, 100, 104, 116, 164, 171, 176 |
| abstract_inverted_index.two | 136, 165 |
| abstract_inverted_index.This | 94 |
| abstract_inverted_index.even | 60 |
| abstract_inverted_index.five | 174 |
| abstract_inverted_index.four | 71, 169 |
| abstract_inverted_index.grid | 54, 149 |
| abstract_inverted_index.hold | 108 |
| abstract_inverted_index.into | 9 |
| abstract_inverted_index.show | 34, 43, 67, 132 |
| abstract_inverted_index.than | 99 |
| abstract_inverted_index.that | 44, 68, 110, 121, 133 |
| abstract_inverted_index.then | 86, 156 |
| abstract_inverted_index.this | 15 |
| abstract_inverted_index.Then, | 65 |
| abstract_inverted_index.being | 96 |
| abstract_inverted_index.case. | 64 |
| abstract_inverted_index.cases | 167 |
| abstract_inverted_index.first | 33 |
| abstract_inverted_index.five) | 73 |
| abstract_inverted_index.given | 127 |
| abstract_inverted_index.grid. | 128 |
| abstract_inverted_index.least | 46, 57, 70, 152 |
| abstract_inverted_index.lower | 35 |
| abstract_inverted_index.nodes | 154 |
| abstract_inverted_index.still | 107 |
| abstract_inverted_index.three | 47, 58, 139, 153 |
| abstract_inverted_index.(resp. | 72, 82 |
| abstract_inverted_index.bounds | 36, 106 |
| abstract_inverted_index.cases, | 138 |
| abstract_inverted_index.except | 134 |
| abstract_inverted_index.latter | 95 |
| abstract_inverted_index.model, | 102 |
| abstract_inverted_index.model. | 40, 93 |
| abstract_inverted_index.nodes, | 59 |
| abstract_inverted_index.number | 22, 118, 160 |
| abstract_inverted_index.robots | 7, 48, 74, 120, 140, 162 |
| abstract_inverted_index.swarms | 3 |
| abstract_inverted_index.(w.r.t. | 20 |
| abstract_inverted_index.exhibit | 115 |
| abstract_inverted_index.explore | 52, 79, 125, 147 |
| abstract_inverted_index.optimal | 19, 117, 159 |
| abstract_inverted_index.propose | 87 |
| abstract_inverted_index.results | 131 |
| abstract_inverted_index.robots) | 24 |
| abstract_inverted_index.weakest | 98 |
| abstract_inverted_index.Abstract | 0 |
| abstract_inverted_index.Overall, | 129 |
| abstract_inverted_index.actually | 114 |
| abstract_inverted_index.consider | 2 |
| abstract_inverted_index.context, | 16 |
| abstract_inverted_index.context. | 111 |
| abstract_inverted_index.evolving | 8 |
| abstract_inverted_index.network. | 13 |
| abstract_inverted_index.problem. | 31 |
| abstract_inverted_index.required | 50 |
| abstract_inverted_index.strictly | 97 |
| abstract_inverted_index.anonymous | 11 |
| abstract_inverted_index.necessary | 76, 123, 142 |
| abstract_inverted_index.oblivious | 6 |
| abstract_inverted_index.remaining | 166 |
| abstract_inverted_index.solutions | 26 |
| abstract_inverted_index.Precisely, | 41 |
| abstract_inverted_index.algorithms | 89, 113 |
| abstract_inverted_index.particular | 137 |
| abstract_inverted_index.sufficient | 144 |
| abstract_inverted_index.terminate. | 157 |
| abstract_inverted_index.exploration | 30 |
| abstract_inverted_index.grid-shaped | 12 |
| abstract_inverted_index.investigate | 18 |
| abstract_inverted_index.terminating | 29 |
| abstract_inverted_index.asynchronous | 5, 92 |
| abstract_inverted_index.deterministic | 25, 88 |
| abstract_inverted_index.probabilistic | 63 |
| abstract_inverted_index.respectively. | 178 |
| abstract_inverted_index.aforementioned | 105 |
| abstract_inverted_index.$\bf(2,2)$-Grid | 81, 172 |
| abstract_inverted_index.$\bf(3,3)$-Grid, | 177 |
| abstract_inverted_index.semi-synchronous | 39, 101 |
| abstract_inverted_index.$\bf(3,3)$-Grid). | 84 |
| abstract_inverted_index.deterministically | 78, 146 |
| cited_by_percentile_year.max | 98 |
| cited_by_percentile_year.min | 90 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 5 |
| citation_normalized_percentile.value | 0.8440149 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |