Position Paper: Incremental Search Algorithms Considered Poorly Understood Article Swipe
Carlos Hernández
,
Jorge A. Baier
,
Tansel Uras
,
Sven Koenig
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1609/socs.v3i1.18268
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1609/socs.v3i1.18268
Incremental search algorithms, such as D* Lite, reuse information from previous searches to speed up the current search and can thus solve sequences of similar search problems faster than Repeated A*, which performs repeated A* searches. In this position paper, we study goal-directed navigation in initially unknown terrain and point out that it is currently not well understood when D* Lite runs faster than Repeated A*. In general, it appears that Repeated A* runs faster than D* Lite for easy navigation problems (where the agent reaches the goal with only a small number of searches), which means that it runs faster than D* Lite quite often in practice. We draw two conclusions, namely that incremental search algorithms need to be evaluated in more diverse testbeds to improve our understanding of their properties and that they can be improved to be more competitive for easy navigation problems.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1609/socs.v3i1.18268
- https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059
- OA Status
- diamond
- Cited By
- 7
- References
- 2
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W2408216402
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W2408216402Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1609/socs.v3i1.18268Digital Object Identifier
- Title
-
Position Paper: Incremental Search Algorithms Considered Poorly UnderstoodWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-08-20Full publication date if available
- Authors
-
Carlos Hernández, Jorge A. Baier, Tansel Uras, Sven KoenigList of authors in order
- Landing page
-
https://doi.org/10.1609/socs.v3i1.18268Publisher landing page
- PDF URL
-
https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
diamondOpen access status per OpenAlex
- OA URL
-
https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059Direct OA link when available
- Concepts
-
Computer science, Position (finance), Incremental heuristic search, Point (geometry), Algorithm, Search algorithm, Beam search, Terrain, Reuse, Search problem, Mathematics, Engineering, Economics, Waste management, Finance, Ecology, Biology, GeometryTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
7Total citation count in OpenAlex
- Citations by year (recent)
-
2021: 1, 2016: 1, 2015: 1, 2014: 3, 2013: 1Per-year citation counts (last 5 years)
- References (count)
-
2Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W2408216402 |
|---|---|
| doi | https://doi.org/10.1609/socs.v3i1.18268 |
| ids.doi | https://doi.org/10.1609/socs.v3i1.18268 |
| ids.mag | 2408216402 |
| ids.openalex | https://openalex.org/W2408216402 |
| fwci | 0.10221948 |
| type | article |
| title | Position Paper: Incremental Search Algorithms Considered Poorly Understood |
| biblio.issue | 1 |
| biblio.volume | 3 |
| biblio.last_page | 161 |
| biblio.first_page | 159 |
| topics[0].id | https://openalex.org/T10586 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.9990000128746033 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1707 |
| topics[0].subfield.display_name | Computer Vision and Pattern Recognition |
| topics[0].display_name | Robotic Path Planning Algorithms |
| topics[1].id | https://openalex.org/T12288 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.9955000281333923 |
| 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 | Optimization and Search Problems |
| topics[2].id | https://openalex.org/T10906 |
| topics[2].field.id | https://openalex.org/fields/17 |
| topics[2].field.display_name | Computer Science |
| topics[2].score | 0.9937000274658203 |
| topics[2].domain.id | https://openalex.org/domains/3 |
| topics[2].domain.display_name | Physical Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1702 |
| topics[2].subfield.display_name | Artificial Intelligence |
| topics[2].display_name | AI-based Problem Solving and Planning |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| concepts[0].id | https://openalex.org/C41008148 |
| concepts[0].level | 0 |
| concepts[0].score | 0.7283246517181396 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[0].display_name | Computer science |
| concepts[1].id | https://openalex.org/C198082294 |
| concepts[1].level | 2 |
| concepts[1].score | 0.7027267217636108 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q3399648 |
| concepts[1].display_name | Position (finance) |
| concepts[2].id | https://openalex.org/C139979381 |
| concepts[2].level | 4 |
| concepts[2].score | 0.5569524168968201 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q17056021 |
| concepts[2].display_name | Incremental heuristic search |
| concepts[3].id | https://openalex.org/C28719098 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5498356223106384 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q44946 |
| concepts[3].display_name | Point (geometry) |
| concepts[4].id | https://openalex.org/C11413529 |
| concepts[4].level | 1 |
| concepts[4].score | 0.5121688842773438 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[4].display_name | Algorithm |
| concepts[5].id | https://openalex.org/C125583679 |
| concepts[5].level | 2 |
| concepts[5].score | 0.5100768208503723 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q755673 |
| concepts[5].display_name | Search algorithm |
| concepts[6].id | https://openalex.org/C19889080 |
| concepts[6].level | 3 |
| concepts[6].score | 0.44048476219177246 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q2835852 |
| concepts[6].display_name | Beam search |
| concepts[7].id | https://openalex.org/C161840515 |
| concepts[7].level | 2 |
| concepts[7].score | 0.43637317419052124 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q186131 |
| concepts[7].display_name | Terrain |
| concepts[8].id | https://openalex.org/C206588197 |
| concepts[8].level | 2 |
| concepts[8].score | 0.42707979679107666 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q846574 |
| concepts[8].display_name | Reuse |
| concepts[9].id | https://openalex.org/C201789804 |
| concepts[9].level | 2 |
| concepts[9].score | 0.4144655466079712 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q2362762 |
| concepts[9].display_name | Search problem |
| concepts[10].id | https://openalex.org/C33923547 |
| concepts[10].level | 0 |
| concepts[10].score | 0.17630413174629211 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[10].display_name | Mathematics |
| concepts[11].id | https://openalex.org/C127413603 |
| concepts[11].level | 0 |
| concepts[11].score | 0.05863267183303833 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q11023 |
| concepts[11].display_name | Engineering |
| concepts[12].id | https://openalex.org/C162324750 |
| concepts[12].level | 0 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8134 |
| concepts[12].display_name | Economics |
| concepts[13].id | https://openalex.org/C548081761 |
| concepts[13].level | 1 |
| concepts[13].score | 0.0 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q180388 |
| concepts[13].display_name | Waste management |
| concepts[14].id | https://openalex.org/C10138342 |
| concepts[14].level | 1 |
| concepts[14].score | 0.0 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q43015 |
| concepts[14].display_name | Finance |
| concepts[15].id | https://openalex.org/C18903297 |
| concepts[15].level | 1 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q7150 |
| concepts[15].display_name | Ecology |
| concepts[16].id | https://openalex.org/C86803240 |
| concepts[16].level | 0 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[16].display_name | Biology |
| concepts[17].id | https://openalex.org/C2524010 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[17].display_name | Geometry |
| keywords[0].id | https://openalex.org/keywords/computer-science |
| keywords[0].score | 0.7283246517181396 |
| keywords[0].display_name | Computer science |
| keywords[1].id | https://openalex.org/keywords/position |
| keywords[1].score | 0.7027267217636108 |
| keywords[1].display_name | Position (finance) |
| keywords[2].id | https://openalex.org/keywords/incremental-heuristic-search |
| keywords[2].score | 0.5569524168968201 |
| keywords[2].display_name | Incremental heuristic search |
| keywords[3].id | https://openalex.org/keywords/point |
| keywords[3].score | 0.5498356223106384 |
| keywords[3].display_name | Point (geometry) |
| keywords[4].id | https://openalex.org/keywords/algorithm |
| keywords[4].score | 0.5121688842773438 |
| keywords[4].display_name | Algorithm |
| keywords[5].id | https://openalex.org/keywords/search-algorithm |
| keywords[5].score | 0.5100768208503723 |
| keywords[5].display_name | Search algorithm |
| keywords[6].id | https://openalex.org/keywords/beam-search |
| keywords[6].score | 0.44048476219177246 |
| keywords[6].display_name | Beam search |
| keywords[7].id | https://openalex.org/keywords/terrain |
| keywords[7].score | 0.43637317419052124 |
| keywords[7].display_name | Terrain |
| keywords[8].id | https://openalex.org/keywords/reuse |
| keywords[8].score | 0.42707979679107666 |
| keywords[8].display_name | Reuse |
| keywords[9].id | https://openalex.org/keywords/search-problem |
| keywords[9].score | 0.4144655466079712 |
| keywords[9].display_name | Search problem |
| keywords[10].id | https://openalex.org/keywords/mathematics |
| keywords[10].score | 0.17630413174629211 |
| keywords[10].display_name | Mathematics |
| keywords[11].id | https://openalex.org/keywords/engineering |
| keywords[11].score | 0.05863267183303833 |
| keywords[11].display_name | Engineering |
| language | en |
| locations[0].id | doi:10.1609/socs.v3i1.18268 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4387284494 |
| locations[0].source.issn | 2832-9163, 2832-9171 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2832-9163 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | Proceedings of the International Symposium on Combinatorial Search |
| locations[0].source.host_organization | |
| locations[0].source.host_organization_name | |
| locations[0].license | |
| locations[0].pdf_url | https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059 |
| 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 | Proceedings of the International Symposium on Combinatorial Search |
| locations[0].landing_page_url | https://doi.org/10.1609/socs.v3i1.18268 |
| indexed_in | crossref |
| authorships[0].author.id | https://openalex.org/A5007629410 |
| authorships[0].author.orcid | https://orcid.org/0000-0001-7947-3684 |
| authorships[0].author.display_name | Carlos Hernández |
| authorships[0].countries | CL |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I38685851 |
| authorships[0].affiliations[0].raw_affiliation_string | Universidad Católica de la Santísima Concepción |
| authorships[0].institutions[0].id | https://openalex.org/I38685851 |
| authorships[0].institutions[0].ror | https://ror.org/03y6k2j68 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I38685851 |
| authorships[0].institutions[0].country_code | CL |
| authorships[0].institutions[0].display_name | Universidad Católica de la Santísima Concepción |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Carlos Hernandez |
| authorships[0].is_corresponding | False |
| authorships[0].raw_affiliation_strings | Universidad Católica de la Santísima Concepción |
| authorships[1].author.id | https://openalex.org/A5030967950 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-6280-5619 |
| authorships[1].author.display_name | Jorge A. Baier |
| authorships[1].countries | CL |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I162148367 |
| authorships[1].affiliations[0].raw_affiliation_string | Pontificia Universidad Catolica de Chile |
| authorships[1].institutions[0].id | https://openalex.org/I162148367 |
| authorships[1].institutions[0].ror | https://ror.org/04teye511 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I162148367 |
| authorships[1].institutions[0].country_code | CL |
| authorships[1].institutions[0].display_name | Pontificia Universidad Católica de Chile |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Jorge Baier |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Pontificia Universidad Catolica de Chile |
| authorships[2].author.id | https://openalex.org/A5071178866 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Tansel Uras |
| authorships[2].countries | US |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I1174212, https://openalex.org/I2800817003 |
| authorships[2].affiliations[0].raw_affiliation_string | University of Southern California |
| authorships[2].institutions[0].id | https://openalex.org/I2800817003 |
| authorships[2].institutions[0].ror | https://ror.org/058zz0t50 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I2800817003 |
| authorships[2].institutions[0].country_code | US |
| authorships[2].institutions[0].display_name | Southern California University for Professional Studies |
| authorships[2].institutions[1].id | https://openalex.org/I1174212 |
| authorships[2].institutions[1].ror | https://ror.org/03taz7m60 |
| authorships[2].institutions[1].type | education |
| authorships[2].institutions[1].lineage | https://openalex.org/I1174212 |
| authorships[2].institutions[1].country_code | US |
| authorships[2].institutions[1].display_name | University of Southern California |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Tansel Uras |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | University of Southern California |
| authorships[3].author.id | https://openalex.org/A5026549557 |
| authorships[3].author.orcid | https://orcid.org/0000-0002-5458-094X |
| authorships[3].author.display_name | Sven Koenig |
| authorships[3].countries | US |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I1174212, https://openalex.org/I2800817003 |
| authorships[3].affiliations[0].raw_affiliation_string | University of Southern California |
| authorships[3].institutions[0].id | https://openalex.org/I2800817003 |
| authorships[3].institutions[0].ror | https://ror.org/058zz0t50 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I2800817003 |
| authorships[3].institutions[0].country_code | US |
| authorships[3].institutions[0].display_name | Southern California University for Professional Studies |
| authorships[3].institutions[1].id | https://openalex.org/I1174212 |
| authorships[3].institutions[1].ror | https://ror.org/03taz7m60 |
| authorships[3].institutions[1].type | education |
| authorships[3].institutions[1].lineage | https://openalex.org/I1174212 |
| authorships[3].institutions[1].country_code | US |
| authorships[3].institutions[1].display_name | University of Southern California |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Sven Koenig |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | University of Southern California |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Position Paper: Incremental Search Algorithms Considered Poorly Understood |
| has_fulltext | True |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T10586 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.9990000128746033 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1707 |
| primary_topic.subfield.display_name | Computer Vision and Pattern Recognition |
| primary_topic.display_name | Robotic Path Planning Algorithms |
| related_works | https://openalex.org/W2064794194, https://openalex.org/W2358427436, https://openalex.org/W2808808802, https://openalex.org/W4386269615, https://openalex.org/W4200104947, https://openalex.org/W1994919150, https://openalex.org/W4390091683, https://openalex.org/W2397806795, https://openalex.org/W2998661990, https://openalex.org/W3192236608 |
| cited_by_count | 7 |
| counts_by_year[0].year | 2021 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2016 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2015 |
| counts_by_year[2].cited_by_count | 1 |
| counts_by_year[3].year | 2014 |
| counts_by_year[3].cited_by_count | 3 |
| counts_by_year[4].year | 2013 |
| counts_by_year[4].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1609/socs.v3i1.18268 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4387284494 |
| best_oa_location.source.issn | 2832-9163, 2832-9171 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2832-9163 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | Proceedings of the International Symposium on Combinatorial Search |
| best_oa_location.source.host_organization | |
| best_oa_location.source.host_organization_name | |
| best_oa_location.license | |
| best_oa_location.pdf_url | https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Proceedings of the International Symposium on Combinatorial Search |
| best_oa_location.landing_page_url | https://doi.org/10.1609/socs.v3i1.18268 |
| primary_location.id | doi:10.1609/socs.v3i1.18268 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4387284494 |
| primary_location.source.issn | 2832-9163, 2832-9171 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2832-9163 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | Proceedings of the International Symposium on Combinatorial Search |
| primary_location.source.host_organization | |
| primary_location.source.host_organization_name | |
| primary_location.license | |
| primary_location.pdf_url | https://ojs.aaai.org/index.php/SOCS/article/download/18268/18059 |
| 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 | Proceedings of the International Symposium on Combinatorial Search |
| primary_location.landing_page_url | https://doi.org/10.1609/socs.v3i1.18268 |
| publication_date | 2021-08-20 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W6676804497, https://openalex.org/W2113256452 |
| referenced_works_count | 2 |
| abstract_inverted_index.a | 90 |
| abstract_inverted_index.A* | 34, 72 |
| abstract_inverted_index.D* | 5, 59, 76, 102 |
| abstract_inverted_index.In | 36, 66 |
| abstract_inverted_index.We | 108 |
| abstract_inverted_index.as | 4 |
| abstract_inverted_index.be | 119, 136, 139 |
| abstract_inverted_index.in | 44, 106, 121 |
| abstract_inverted_index.is | 53 |
| abstract_inverted_index.it | 52, 68, 98 |
| abstract_inverted_index.of | 23, 93, 129 |
| abstract_inverted_index.to | 12, 118, 125, 138 |
| abstract_inverted_index.up | 14 |
| abstract_inverted_index.we | 40 |
| abstract_inverted_index.A*, | 30 |
| abstract_inverted_index.A*. | 65 |
| abstract_inverted_index.and | 18, 48, 132 |
| abstract_inverted_index.can | 19, 135 |
| abstract_inverted_index.for | 78, 142 |
| abstract_inverted_index.not | 55 |
| abstract_inverted_index.our | 127 |
| abstract_inverted_index.out | 50 |
| abstract_inverted_index.the | 15, 83, 86 |
| abstract_inverted_index.two | 110 |
| abstract_inverted_index.Lite | 60, 77, 103 |
| abstract_inverted_index.draw | 109 |
| abstract_inverted_index.easy | 79, 143 |
| abstract_inverted_index.from | 9 |
| abstract_inverted_index.goal | 87 |
| abstract_inverted_index.more | 122, 140 |
| abstract_inverted_index.need | 117 |
| abstract_inverted_index.only | 89 |
| abstract_inverted_index.runs | 61, 73, 99 |
| abstract_inverted_index.such | 3 |
| abstract_inverted_index.than | 28, 63, 75, 101 |
| abstract_inverted_index.that | 51, 70, 97, 113, 133 |
| abstract_inverted_index.they | 134 |
| abstract_inverted_index.this | 37 |
| abstract_inverted_index.thus | 20 |
| abstract_inverted_index.well | 56 |
| abstract_inverted_index.when | 58 |
| abstract_inverted_index.with | 88 |
| abstract_inverted_index.Lite, | 6 |
| abstract_inverted_index.agent | 84 |
| abstract_inverted_index.means | 96 |
| abstract_inverted_index.often | 105 |
| abstract_inverted_index.point | 49 |
| abstract_inverted_index.quite | 104 |
| abstract_inverted_index.reuse | 7 |
| abstract_inverted_index.small | 91 |
| abstract_inverted_index.solve | 21 |
| abstract_inverted_index.speed | 13 |
| abstract_inverted_index.study | 41 |
| abstract_inverted_index.their | 130 |
| abstract_inverted_index.which | 31, 95 |
| abstract_inverted_index.(where | 82 |
| abstract_inverted_index.faster | 27, 62, 74, 100 |
| abstract_inverted_index.namely | 112 |
| abstract_inverted_index.number | 92 |
| abstract_inverted_index.paper, | 39 |
| abstract_inverted_index.search | 1, 17, 25, 115 |
| abstract_inverted_index.appears | 69 |
| abstract_inverted_index.current | 16 |
| abstract_inverted_index.diverse | 123 |
| abstract_inverted_index.improve | 126 |
| abstract_inverted_index.reaches | 85 |
| abstract_inverted_index.similar | 24 |
| abstract_inverted_index.terrain | 47 |
| abstract_inverted_index.unknown | 46 |
| abstract_inverted_index.Repeated | 29, 64, 71 |
| abstract_inverted_index.general, | 67 |
| abstract_inverted_index.improved | 137 |
| abstract_inverted_index.performs | 32 |
| abstract_inverted_index.position | 38 |
| abstract_inverted_index.previous | 10 |
| abstract_inverted_index.problems | 26, 81 |
| abstract_inverted_index.repeated | 33 |
| abstract_inverted_index.searches | 11 |
| abstract_inverted_index.testbeds | 124 |
| abstract_inverted_index.currently | 54 |
| abstract_inverted_index.evaluated | 120 |
| abstract_inverted_index.initially | 45 |
| abstract_inverted_index.practice. | 107 |
| abstract_inverted_index.problems. | 145 |
| abstract_inverted_index.searches. | 35 |
| abstract_inverted_index.sequences | 22 |
| abstract_inverted_index.algorithms | 116 |
| abstract_inverted_index.navigation | 43, 80, 144 |
| abstract_inverted_index.properties | 131 |
| abstract_inverted_index.searches), | 94 |
| abstract_inverted_index.understood | 57 |
| abstract_inverted_index.Incremental | 0 |
| abstract_inverted_index.algorithms, | 2 |
| abstract_inverted_index.competitive | 141 |
| abstract_inverted_index.incremental | 114 |
| abstract_inverted_index.information | 8 |
| abstract_inverted_index.conclusions, | 111 |
| abstract_inverted_index.goal-directed | 42 |
| abstract_inverted_index.understanding | 128 |
| cited_by_percentile_year.max | 97 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 2 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile.value | 0.34848532 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |