{"id":"W4311072863","doi":"10.1613/jair.1.13769","title":"Asymmetric Action Abstractions for Planning in Real-Time Strategy Games","year":2022,"lang":"en","type":"article","venue":"Journal of Artificial Intelligence Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de Minas Gerais; University of Alberta; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Universidade Federal de Viçosa; Canadian Institute for Advanced Research","keywords":"Computer science; Iterative deepening depth-first search; Action (physics); Search algorithm; Set (abstract data type); Context (archaeology); Theoretical computer science; Greedy algorithm; Combinatorial game theory; Tree (set theory); Abstraction; Search tree; Sequential game; Beam search; Game theory; Algorithm; Best-first search; Mathematics; Mathematical economics; Programming language","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002199017,0.0008583848,0.0009301915,0.0007308251,0.0005689421,0.001455252,0.001321866,0.0007252103,0.002493506],"category_scores_gemma":[0.007171454,0.0003953853,0.0009708248,0.0008120214,0.00168515,0.002741606,0.001979093,0.002426554,0.0002546182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002039751,"about_ca_system_score_gemma":0.002510255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004192201,"about_ca_topic_score_gemma":0.004687677,"domain_scores_codex":[0.9984117,0.0006507785,0.00009965755,0.0001910155,0.0004588792,0.000188124],"domain_scores_gemma":[0.9968252,0.001955024,0.0003479198,0.0004300996,0.0002044923,0.0002371842],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001783659,0.0001010253,0.0008618364,0.00008782648,0.00003649415,0.0000640289,0.0002187251,0.8355477,0.001779586,0.1201472,0.0005947269,0.04038247],"study_design_scores_gemma":[0.00003108632,0.0000611204,0.0001302322,0.00001560416,0.00001127178,0.00001946654,0.00002678081,0.9230773,0.0009215691,0.07483321,0.0008633257,0.000009069699],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04907995,0.0001969976,0.9461004,0.0002057614,0.00002760697,0.0001300614,0.00008042331,0.0003813126,0.003797503],"genre_scores_gemma":[0.6931099,0.0002341381,0.3041637,0.0001152422,0.00001914603,0.000281782,0.0001905166,0.00006876713,0.001816854],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004192201,"threshold_uncertainty_score":0.01479948,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.333043060617828,"score_gpt":0.4888081539774601,"score_spread":0.1557650933596322,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}