{"id":"W131788687","doi":"10.1609/aaai.v25i1.8039","title":"A Local Monte Carlo Tree Search Approach in Deterministic Planning","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Monte Carlo tree search; Satisficing; Planner; Computer science; Monte Carlo method; Random walk; Mathematical optimization; Scaling; Tree (set theory); Quality (philosophy); Plan (archaeology); Mathematics; Artificial intelligence; Statistics","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.002381691,0.0005847265,0.0009746784,0.001220313,0.0005768756,0.0008632293,0.001587382,0.001192615,0.003551392],"category_scores_gemma":[0.008632434,0.0007348995,0.0008403727,0.001647842,0.001320446,0.001450393,0.001027011,0.001302586,0.0006324291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001341392,"about_ca_system_score_gemma":0.001402323,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007318804,"about_ca_topic_score_gemma":0.01094548,"domain_scores_codex":[0.9985958,0.000767994,0.00004404651,0.0001828833,0.0003502525,0.00005904826],"domain_scores_gemma":[0.9968003,0.002587891,0.000148199,0.0002054046,0.000181517,0.00007662005],"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.00003583029,0.00002546106,0.0002562154,0.00004830117,0.00002509043,0.00003364805,0.00004937111,0.939202,0.0003327764,0.03385984,0.0007117557,0.0254197],"study_design_scores_gemma":[0.000007713273,0.00001413927,0.00002796013,0.000005417693,0.000004700169,0.000009317053,0.000003009284,0.9875995,0.0000944881,0.01177065,0.0004588278,0.000004309236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005985002,0.0004118469,0.990064,0.0001518307,0.00001989385,0.00004910542,0.00004138149,0.0004247842,0.002852198],"genre_scores_gemma":[0.3374224,0.0006596736,0.6578289,0.0001897122,0.00006113701,0.0004594663,0.0001854696,0.0002574847,0.002935784],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007318804,"threshold_uncertainty_score":0.01455241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1654068452060159,"score_gpt":0.2982410021422671,"score_spread":0.1328341569362512,"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."}}