{"id":"W2230033167","doi":"","title":"Adversarial hierarchical-task network planning for complex real-time games","year":2015,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":77,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Computer science; Adversarial system; Task (project management); Tree (set theory); Theoretical computer science; Artificial intelligence; Combinatorial game theory; Point (geometry); Machine learning; Game theory; Sequential game; Monte Carlo method; Mathematics; Mathematical economics","routes":{"ca_aff":true,"ca_fund":false,"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.001673571,0.0009428684,0.0008605099,0.0005359966,0.0006067909,0.0007429241,0.001320283,0.0007561723,0.003800185],"category_scores_gemma":[0.00686293,0.0003755555,0.0006135935,0.0006007868,0.001317901,0.002233011,0.001561657,0.001663691,0.0003176051],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00179096,"about_ca_system_score_gemma":0.001865946,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.011899,"about_ca_topic_score_gemma":0.01345698,"domain_scores_codex":[0.9992285,0.0003424017,0.00003494546,0.0001372136,0.0001564209,0.0001005917],"domain_scores_gemma":[0.9955583,0.003667763,0.0002428907,0.0001827218,0.0001400335,0.0002082907],"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.00005689155,0.0000340409,0.0003110099,0.00004306756,0.00001698665,0.00003356813,0.00006294162,0.9558778,0.0002818358,0.03057133,0.0007596906,0.01195076],"study_design_scores_gemma":[0.000006158169,0.00001221078,0.00003210011,0.000002913566,0.000002651383,0.000005643222,0.00000684285,0.9837036,0.00007848453,0.0159035,0.0002433628,0.000002483794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03679334,0.0002591226,0.9568267,0.0002871021,0.00003182156,0.0001031354,0.0001010358,0.0003246814,0.005272948],"genre_scores_gemma":[0.8025454,0.0003503318,0.1925594,0.0001465667,0.00003212614,0.0002459135,0.0002559138,0.0001169837,0.003747279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.011899,"threshold_uncertainty_score":0.02365947,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2196141500131067,"score_gpt":0.3844458776644416,"score_spread":0.1648317276513349,"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."}}