Time-Bounded Best-First Search Article Swipe
Carlos Hernández
,
Roberto Asín‐Achá
,
Jorge A. Baier
·
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1609/socs.v5i1.18325
YOU?
·
· 2021
· Open Access
·
· DOI: https://doi.org/10.1609/socs.v5i1.18325
Time-Bounded A* (TBA*) is a single-agent deterministic search algorithm that expands states of a graph in the same order as A* does, but that unlike A* interleaves search and action execution. Although the idea underlying TBA* can be generalized to other single-agent deterministic search algorithms, little is known about the impact on performance that would result from using algorithms other than A*. In this paper we propose Time-Bounded Best-First Search (TB-BFS) a generalization of the time-bounded approach to any best-first search algorithm. Furthermore, we propose restarting strategies that allow TB-BFS to solve search problems in dynamic environments. In static environments, we prove that the resulting framework allows agents to always find a solution if such a solution exists, and prove cost bounds for the solutions returned by Time-Bounded Weighted A* (TB-WA*). We evaluate the performance of TB-WA* and Time-Bounded Greedy Best-First Search (TB-GBFS). We show that in pathfinding applications in static domains, TB-WA* and TB-GBFS are not only faster than TBA* but also find significantly better solutions in terms of cost. In the context of videogame pathfinding, TB-WA* and TB-GBFS perform fewer undesired movements than TBA*. Restarting TB-WA* was also evaluated in dynamic pathfinding random maps, where we also observed improved performance compared to restarting TBA*. Our experimental results seem consistent with theoretical bounds.
Related Topics
Concepts
Bounded function
Pathfinding
Generalization
Computer science
Beam search
Combinatorial search
Best-first search
Search algorithm
Context (archaeology)
Greedy algorithm
Graph
Mathematical optimization
Algorithm
Mathematics
Theoretical computer science
Shortest path problem
Paleontology
Mathematical analysis
Biology
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.1609/socs.v5i1.18325
- https://ojs.aaai.org/index.php/SOCS/article/download/18325/18116
- OA Status
- diamond
- Cited By
- 3
- References
- 26
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W1522500438
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W1522500438Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.1609/socs.v5i1.18325Digital Object Identifier
- Title
-
Time-Bounded Best-First SearchWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2021Year of publication
- Publication date
-
2021-09-01Full publication date if available
- Authors
-
Carlos Hernández, Roberto Asín‐Achá, Jorge A. BaierList of authors in order
- Landing page
-
https://doi.org/10.1609/socs.v5i1.18325Publisher landing page
- PDF URL
-
https://ojs.aaai.org/index.php/SOCS/article/download/18325/18116Direct 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/18325/18116Direct OA link when available
- Concepts
-
Bounded function, Pathfinding, Generalization, Computer science, Beam search, Combinatorial search, Best-first search, Search algorithm, Context (archaeology), Greedy algorithm, Graph, Mathematical optimization, Algorithm, Mathematics, Theoretical computer science, Shortest path problem, Paleontology, Mathematical analysis, BiologyTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
3Total citation count in OpenAlex
- Citations by year (recent)
-
2022: 1, 2020: 1, 2016: 1Per-year citation counts (last 5 years)
- References (count)
-
26Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W1522500438 |
|---|---|
| doi | https://doi.org/10.1609/socs.v5i1.18325 |
| ids.doi | https://doi.org/10.1609/socs.v5i1.18325 |
| ids.mag | 1522500438 |
| ids.openalex | https://openalex.org/W1522500438 |
| fwci | 0.10221948 |
| type | article |
| title | Time-Bounded Best-First Search |
| biblio.issue | 1 |
| biblio.volume | 5 |
| biblio.last_page | 104 |
| biblio.first_page | 97 |
| 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.9994000196456909 |
| 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/T11574 |
| topics[1].field.id | https://openalex.org/fields/17 |
| topics[1].field.display_name | Computer Science |
| topics[1].score | 0.998199999332428 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1702 |
| topics[1].subfield.display_name | Artificial Intelligence |
| topics[1].display_name | Artificial Intelligence in Games |
| 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.9950000047683716 |
| 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/C34388435 |
| concepts[0].level | 2 |
| concepts[0].score | 0.8528275489807129 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q2267362 |
| concepts[0].display_name | Bounded function |
| concepts[1].id | https://openalex.org/C25321074 |
| concepts[1].level | 4 |
| concepts[1].score | 0.7789421081542969 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q1969601 |
| concepts[1].display_name | Pathfinding |
| concepts[2].id | https://openalex.org/C177148314 |
| concepts[2].level | 2 |
| concepts[2].score | 0.5951357483863831 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q170084 |
| concepts[2].display_name | Generalization |
| concepts[3].id | https://openalex.org/C41008148 |
| concepts[3].level | 0 |
| concepts[3].score | 0.5487285256385803 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[3].display_name | Computer science |
| concepts[4].id | https://openalex.org/C19889080 |
| concepts[4].level | 3 |
| concepts[4].score | 0.49941039085388184 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q2835852 |
| concepts[4].display_name | Beam search |
| concepts[5].id | https://openalex.org/C203208320 |
| concepts[5].level | 4 |
| concepts[5].score | 0.48858365416526794 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q5150830 |
| concepts[5].display_name | Combinatorial search |
| concepts[6].id | https://openalex.org/C46011968 |
| concepts[6].level | 4 |
| concepts[6].score | 0.48233315348625183 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q830527 |
| concepts[6].display_name | Best-first search |
| concepts[7].id | https://openalex.org/C125583679 |
| concepts[7].level | 2 |
| concepts[7].score | 0.47079363465309143 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q755673 |
| concepts[7].display_name | Search algorithm |
| concepts[8].id | https://openalex.org/C2779343474 |
| concepts[8].level | 2 |
| concepts[8].score | 0.4665966033935547 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q3109175 |
| concepts[8].display_name | Context (archaeology) |
| concepts[9].id | https://openalex.org/C51823790 |
| concepts[9].level | 2 |
| concepts[9].score | 0.43475329875946045 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q504353 |
| concepts[9].display_name | Greedy algorithm |
| concepts[10].id | https://openalex.org/C132525143 |
| concepts[10].level | 2 |
| concepts[10].score | 0.4346471428871155 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q141488 |
| concepts[10].display_name | Graph |
| concepts[11].id | https://openalex.org/C126255220 |
| concepts[11].level | 1 |
| concepts[11].score | 0.4320729970932007 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[11].display_name | Mathematical optimization |
| concepts[12].id | https://openalex.org/C11413529 |
| concepts[12].level | 1 |
| concepts[12].score | 0.40241917967796326 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q8366 |
| concepts[12].display_name | Algorithm |
| concepts[13].id | https://openalex.org/C33923547 |
| concepts[13].level | 0 |
| concepts[13].score | 0.373513787984848 |
| concepts[13].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[13].display_name | Mathematics |
| concepts[14].id | https://openalex.org/C80444323 |
| concepts[14].level | 1 |
| concepts[14].score | 0.3214704096317291 |
| concepts[14].wikidata | https://www.wikidata.org/wiki/Q2878974 |
| concepts[14].display_name | Theoretical computer science |
| concepts[15].id | https://openalex.org/C22590252 |
| concepts[15].level | 3 |
| concepts[15].score | 0.0 |
| concepts[15].wikidata | https://www.wikidata.org/wiki/Q1058754 |
| concepts[15].display_name | Shortest path problem |
| concepts[16].id | https://openalex.org/C151730666 |
| concepts[16].level | 1 |
| concepts[16].score | 0.0 |
| concepts[16].wikidata | https://www.wikidata.org/wiki/Q7205 |
| concepts[16].display_name | Paleontology |
| concepts[17].id | https://openalex.org/C134306372 |
| concepts[17].level | 1 |
| concepts[17].score | 0.0 |
| concepts[17].wikidata | https://www.wikidata.org/wiki/Q7754 |
| concepts[17].display_name | Mathematical analysis |
| concepts[18].id | https://openalex.org/C86803240 |
| concepts[18].level | 0 |
| concepts[18].score | 0.0 |
| concepts[18].wikidata | https://www.wikidata.org/wiki/Q420 |
| concepts[18].display_name | Biology |
| keywords[0].id | https://openalex.org/keywords/bounded-function |
| keywords[0].score | 0.8528275489807129 |
| keywords[0].display_name | Bounded function |
| keywords[1].id | https://openalex.org/keywords/pathfinding |
| keywords[1].score | 0.7789421081542969 |
| keywords[1].display_name | Pathfinding |
| keywords[2].id | https://openalex.org/keywords/generalization |
| keywords[2].score | 0.5951357483863831 |
| keywords[2].display_name | Generalization |
| keywords[3].id | https://openalex.org/keywords/computer-science |
| keywords[3].score | 0.5487285256385803 |
| keywords[3].display_name | Computer science |
| keywords[4].id | https://openalex.org/keywords/beam-search |
| keywords[4].score | 0.49941039085388184 |
| keywords[4].display_name | Beam search |
| keywords[5].id | https://openalex.org/keywords/combinatorial-search |
| keywords[5].score | 0.48858365416526794 |
| keywords[5].display_name | Combinatorial search |
| keywords[6].id | https://openalex.org/keywords/best-first-search |
| keywords[6].score | 0.48233315348625183 |
| keywords[6].display_name | Best-first search |
| keywords[7].id | https://openalex.org/keywords/search-algorithm |
| keywords[7].score | 0.47079363465309143 |
| keywords[7].display_name | Search algorithm |
| keywords[8].id | https://openalex.org/keywords/context |
| keywords[8].score | 0.4665966033935547 |
| keywords[8].display_name | Context (archaeology) |
| keywords[9].id | https://openalex.org/keywords/greedy-algorithm |
| keywords[9].score | 0.43475329875946045 |
| keywords[9].display_name | Greedy algorithm |
| keywords[10].id | https://openalex.org/keywords/graph |
| keywords[10].score | 0.4346471428871155 |
| keywords[10].display_name | Graph |
| keywords[11].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[11].score | 0.4320729970932007 |
| keywords[11].display_name | Mathematical optimization |
| keywords[12].id | https://openalex.org/keywords/algorithm |
| keywords[12].score | 0.40241917967796326 |
| keywords[12].display_name | Algorithm |
| keywords[13].id | https://openalex.org/keywords/mathematics |
| keywords[13].score | 0.373513787984848 |
| keywords[13].display_name | Mathematics |
| keywords[14].id | https://openalex.org/keywords/theoretical-computer-science |
| keywords[14].score | 0.3214704096317291 |
| keywords[14].display_name | Theoretical computer science |
| language | en |
| locations[0].id | doi:10.1609/socs.v5i1.18325 |
| 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/18325/18116 |
| 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.v5i1.18325 |
| 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/A5077530163 |
| authorships[1].author.orcid | https://orcid.org/0000-0002-1820-9019 |
| authorships[1].author.display_name | Roberto Asín‐Achá |
| authorships[1].countries | CL |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I38685851 |
| authorships[1].affiliations[0].raw_affiliation_string | Universidad Católica de la Santísima Concepción |
| authorships[1].institutions[0].id | https://openalex.org/I38685851 |
| authorships[1].institutions[0].ror | https://ror.org/03y6k2j68 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I38685851 |
| authorships[1].institutions[0].country_code | CL |
| authorships[1].institutions[0].display_name | Universidad Católica de la Santísima Concepción |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Roberto Asin |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | Universidad Católica de la Santísima Concepción |
| authorships[2].author.id | https://openalex.org/A5030967950 |
| authorships[2].author.orcid | https://orcid.org/0000-0002-6280-5619 |
| authorships[2].author.display_name | Jorge A. Baier |
| authorships[2].countries | CL |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I162148367 |
| authorships[2].affiliations[0].raw_affiliation_string | Pontificia universidad catolica de chile |
| authorships[2].institutions[0].id | https://openalex.org/I162148367 |
| authorships[2].institutions[0].ror | https://ror.org/04teye511 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I162148367 |
| authorships[2].institutions[0].country_code | CL |
| authorships[2].institutions[0].display_name | Pontificia Universidad Católica de Chile |
| authorships[2].author_position | last |
| authorships[2].raw_author_name | Jorge Baier |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | Pontificia universidad catolica de chile |
| 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/18325/18116 |
| open_access.oa_status | diamond |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | Time-Bounded Best-First Search |
| 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.9994000196456909 |
| 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/W2045256528, https://openalex.org/W1506385404, https://openalex.org/W1522500438, https://openalex.org/W2273238862, https://openalex.org/W2511246649, https://openalex.org/W1820421037, https://openalex.org/W2146921011, https://openalex.org/W1573854140, https://openalex.org/W128952136, https://openalex.org/W2913902948 |
| cited_by_count | 3 |
| counts_by_year[0].year | 2022 |
| counts_by_year[0].cited_by_count | 1 |
| counts_by_year[1].year | 2020 |
| counts_by_year[1].cited_by_count | 1 |
| counts_by_year[2].year | 2016 |
| counts_by_year[2].cited_by_count | 1 |
| locations_count | 1 |
| best_oa_location.id | doi:10.1609/socs.v5i1.18325 |
| 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/18325/18116 |
| 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.v5i1.18325 |
| primary_location.id | doi:10.1609/socs.v5i1.18325 |
| 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/18325/18116 |
| 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.v5i1.18325 |
| publication_date | 2021-09-01 |
| publication_year | 2021 |
| referenced_works | https://openalex.org/W85094830, https://openalex.org/W2129463847, https://openalex.org/W6676804497, https://openalex.org/W6680996303, https://openalex.org/W2086251647, https://openalex.org/W6655670082, https://openalex.org/W6659469833, https://openalex.org/W6638265882, https://openalex.org/W2050145531, https://openalex.org/W1551562380, https://openalex.org/W6603463683, https://openalex.org/W6680234699, https://openalex.org/W6630686185, https://openalex.org/W2035601288, https://openalex.org/W4324142110, https://openalex.org/W2404262858, https://openalex.org/W2021061679, https://openalex.org/W4313004735, https://openalex.org/W1969483458, https://openalex.org/W1516910121, https://openalex.org/W86291329, https://openalex.org/W2113256452, https://openalex.org/W1516784847, https://openalex.org/W2135125135, https://openalex.org/W1781271953, https://openalex.org/W2141208494 |
| referenced_works_count | 26 |
| abstract_inverted_index.a | 4, 13, 71, 111, 115 |
| abstract_inverted_index.A* | 1, 20, 25, 129 |
| abstract_inverted_index.In | 62, 97, 171 |
| abstract_inverted_index.We | 131, 143 |
| abstract_inverted_index.as | 19 |
| abstract_inverted_index.be | 37 |
| abstract_inverted_index.by | 126 |
| abstract_inverted_index.if | 113 |
| abstract_inverted_index.in | 15, 94, 146, 149, 167, 191 |
| abstract_inverted_index.is | 3, 46 |
| abstract_inverted_index.of | 12, 73, 135, 169, 174 |
| abstract_inverted_index.on | 51 |
| abstract_inverted_index.to | 39, 77, 90, 108, 203 |
| abstract_inverted_index.we | 65, 83, 100, 197 |
| abstract_inverted_index.A*. | 61 |
| abstract_inverted_index.Our | 206 |
| abstract_inverted_index.and | 28, 118, 137, 153, 178 |
| abstract_inverted_index.any | 78 |
| abstract_inverted_index.are | 155 |
| abstract_inverted_index.but | 22, 161 |
| abstract_inverted_index.can | 36 |
| abstract_inverted_index.for | 122 |
| abstract_inverted_index.not | 156 |
| abstract_inverted_index.the | 16, 32, 49, 74, 103, 123, 133, 172 |
| abstract_inverted_index.was | 188 |
| abstract_inverted_index.TBA* | 35, 160 |
| abstract_inverted_index.also | 162, 189, 198 |
| abstract_inverted_index.cost | 120 |
| abstract_inverted_index.find | 110, 163 |
| abstract_inverted_index.from | 56 |
| abstract_inverted_index.idea | 33 |
| abstract_inverted_index.only | 157 |
| abstract_inverted_index.same | 17 |
| abstract_inverted_index.seem | 209 |
| abstract_inverted_index.show | 144 |
| abstract_inverted_index.such | 114 |
| abstract_inverted_index.than | 60, 159, 184 |
| abstract_inverted_index.that | 9, 23, 53, 87, 102, 145 |
| abstract_inverted_index.this | 63 |
| abstract_inverted_index.with | 211 |
| abstract_inverted_index.TBA*. | 185, 205 |
| abstract_inverted_index.about | 48 |
| abstract_inverted_index.allow | 88 |
| abstract_inverted_index.cost. | 170 |
| abstract_inverted_index.does, | 21 |
| abstract_inverted_index.fewer | 181 |
| abstract_inverted_index.graph | 14 |
| abstract_inverted_index.known | 47 |
| abstract_inverted_index.maps, | 195 |
| abstract_inverted_index.order | 18 |
| abstract_inverted_index.other | 40, 59 |
| abstract_inverted_index.paper | 64 |
| abstract_inverted_index.prove | 101, 119 |
| abstract_inverted_index.solve | 91 |
| abstract_inverted_index.terms | 168 |
| abstract_inverted_index.using | 57 |
| abstract_inverted_index.where | 196 |
| abstract_inverted_index.would | 54 |
| abstract_inverted_index.(TBA*) | 2 |
| abstract_inverted_index.Greedy | 139 |
| abstract_inverted_index.Search | 69, 141 |
| abstract_inverted_index.TB-BFS | 89 |
| abstract_inverted_index.TB-WA* | 136, 152, 177, 187 |
| abstract_inverted_index.action | 29 |
| abstract_inverted_index.agents | 107 |
| abstract_inverted_index.allows | 106 |
| abstract_inverted_index.always | 109 |
| abstract_inverted_index.better | 165 |
| abstract_inverted_index.bounds | 121 |
| abstract_inverted_index.faster | 158 |
| abstract_inverted_index.impact | 50 |
| abstract_inverted_index.little | 45 |
| abstract_inverted_index.random | 194 |
| abstract_inverted_index.result | 55 |
| abstract_inverted_index.search | 7, 27, 43, 80, 92 |
| abstract_inverted_index.states | 11 |
| abstract_inverted_index.static | 98, 150 |
| abstract_inverted_index.unlike | 24 |
| abstract_inverted_index.TB-GBFS | 154, 179 |
| abstract_inverted_index.bounds. | 213 |
| abstract_inverted_index.context | 173 |
| abstract_inverted_index.dynamic | 95, 192 |
| abstract_inverted_index.exists, | 117 |
| abstract_inverted_index.expands | 10 |
| abstract_inverted_index.perform | 180 |
| abstract_inverted_index.propose | 66, 84 |
| abstract_inverted_index.results | 208 |
| abstract_inverted_index.(TB-BFS) | 70 |
| abstract_inverted_index.Although | 31 |
| abstract_inverted_index.Weighted | 128 |
| abstract_inverted_index.approach | 76 |
| abstract_inverted_index.compared | 202 |
| abstract_inverted_index.domains, | 151 |
| abstract_inverted_index.evaluate | 132 |
| abstract_inverted_index.improved | 200 |
| abstract_inverted_index.observed | 199 |
| abstract_inverted_index.problems | 93 |
| abstract_inverted_index.returned | 125 |
| abstract_inverted_index.solution | 112, 116 |
| abstract_inverted_index.(TB-WA*). | 130 |
| abstract_inverted_index.algorithm | 8 |
| abstract_inverted_index.evaluated | 190 |
| abstract_inverted_index.framework | 105 |
| abstract_inverted_index.movements | 183 |
| abstract_inverted_index.resulting | 104 |
| abstract_inverted_index.solutions | 124, 166 |
| abstract_inverted_index.undesired | 182 |
| abstract_inverted_index.videogame | 175 |
| abstract_inverted_index.(TB-GBFS). | 142 |
| abstract_inverted_index.Best-First | 68, 140 |
| abstract_inverted_index.Restarting | 186 |
| abstract_inverted_index.algorithm. | 81 |
| abstract_inverted_index.algorithms | 58 |
| abstract_inverted_index.best-first | 79 |
| abstract_inverted_index.consistent | 210 |
| abstract_inverted_index.execution. | 30 |
| abstract_inverted_index.restarting | 85, 204 |
| abstract_inverted_index.strategies | 86 |
| abstract_inverted_index.underlying | 34 |
| abstract_inverted_index.algorithms, | 44 |
| abstract_inverted_index.generalized | 38 |
| abstract_inverted_index.interleaves | 26 |
| abstract_inverted_index.pathfinding | 147, 193 |
| abstract_inverted_index.performance | 52, 134, 201 |
| abstract_inverted_index.theoretical | 212 |
| abstract_inverted_index.Furthermore, | 82 |
| abstract_inverted_index.Time-Bounded | 0, 67, 127, 138 |
| abstract_inverted_index.applications | 148 |
| abstract_inverted_index.experimental | 207 |
| abstract_inverted_index.pathfinding, | 176 |
| abstract_inverted_index.single-agent | 5, 41 |
| abstract_inverted_index.time-bounded | 75 |
| abstract_inverted_index.deterministic | 6, 42 |
| abstract_inverted_index.environments, | 99 |
| abstract_inverted_index.environments. | 96 |
| abstract_inverted_index.significantly | 164 |
| abstract_inverted_index.generalization | 72 |
| cited_by_percentile_year.max | 94 |
| cited_by_percentile_year.min | 89 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 3 |
| citation_normalized_percentile.value | 0.34820511 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |