{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008782938,0.000252546,0.0003054329,0.0002377744,0.0001735117,0.000153886,0.002297662,0.0001235669,0.00001772397],"category_scores_gemma":[0.0001477823,0.0001986271,0.00009529084,0.0007539277,0.0002941472,0.0002700904,0.0004012224,0.0005536628,0.00003470021],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005654649,"about_ca_system_score_gemma":0.0001466575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002713294,"about_ca_topic_score_gemma":0.00001257219,"domain_scores_codex":[0.9977986,0.00003934575,0.0005657328,0.0005893951,0.0004768774,0.0005301038],"domain_scores_gemma":[0.9989315,0.0001208149,0.0002281118,0.0003312855,0.0002728325,0.000115407],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003650886,0.0006186141,0.0111114,0.0002458166,0.00003732035,0.00002368902,0.05304107,0.006120344,0.006111701,0.7150496,0.000121138,0.2071543],"study_design_scores_gemma":[0.00005532171,0.0003589108,0.002204133,0.0005671733,0.00001018095,0.00001816905,0.002356276,0.877156,0.08558845,0.03131228,0.00001000656,0.0003631138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6562998,0.0000964386,0.2723218,0.0005792192,0.0004041435,0.0007543141,0.000005720867,0.0002266381,0.06931186],"genre_scores_gemma":[0.9883753,0.000003713835,0.01135891,0.00008185652,0.00002573823,0.00002973638,2.197732e-7,0.00001375444,0.0001107599],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8710356,"threshold_uncertainty_score":0.8099779,"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."}}