{"id":"W3080419432","doi":"10.3233/faia200470","title":"Entropy-based adaptive exploit-explore coefficient for Monte-Carlo path planning","year":2020,"lang":"en","type":"preprint","venue":"Open Archive Toulouse Archive Ouverte (University of Toulouse)","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Queen's University","funders":"Agence Nationale de la Recherche","keywords":"Computer science; Motion planning; Mathematical optimization; Monte Carlo method; Convergence (economics); Context (archaeology); Entropy (arrow of time); Artificial intelligence; Mathematics; Robot","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.001421603,0.0007588989,0.0008242881,0.0007252998,0.0004374186,0.0007915259,0.001558847,0.001017978,0.001811369],"category_scores_gemma":[0.008578669,0.0003982598,0.0005166489,0.0004433245,0.0008646902,0.001059526,0.001225047,0.001528241,0.0002624177],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009073077,"about_ca_system_score_gemma":0.001734024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003989973,"about_ca_topic_score_gemma":0.004081341,"domain_scores_codex":[0.9992918,0.0002107164,0.00003555935,0.00009696242,0.0002572506,0.0001076119],"domain_scores_gemma":[0.9967034,0.002379306,0.0002451159,0.0001702085,0.0003886604,0.000113304],"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.00006485757,0.0000326163,0.0007468256,0.00004601948,0.00001839429,0.00003613402,0.00004076745,0.9658778,0.001599991,0.005672394,0.0003609593,0.02550316],"study_design_scores_gemma":[0.000005326694,0.00001942131,0.00009782768,0.000007438772,0.000004390827,0.00001133865,0.000003939896,0.9979791,0.0005809485,0.00108332,0.0002021063,0.00000475662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0329227,0.0005473162,0.9619185,0.0001829929,0.00005197332,0.000080604,0.00005217663,0.0004211204,0.003822648],"genre_scores_gemma":[0.8539274,0.0003003835,0.1439165,0.0001037294,0.00003776652,0.0002110904,0.0001202694,0.0001230372,0.001259817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003989973,"threshold_uncertainty_score":0.007933497,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08950398227348327,"score_gpt":0.2736771996396457,"score_spread":0.1841732173661624,"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."}}