{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":["open_science"],"category_scores_codex":[0.000580819,0.0008586228,0.00143538,0.0006858906,0.0009378527,0.0004976756,0.00874033,0.0002603623,0.00009508962],"category_scores_gemma":[0.0001578299,0.001020296,0.0008231539,0.0004903225,0.0005151856,0.0007983922,0.011619,0.001311912,0.00006617914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002500165,"about_ca_system_score_gemma":0.001471193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001337506,"about_ca_topic_score_gemma":0.0003035925,"domain_scores_codex":[0.9942601,0.00075349,0.000649815,0.002257584,0.001007162,0.001071898],"domain_scores_gemma":[0.9950662,0.0007923389,0.001002728,0.001890953,0.0004224106,0.000825431],"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.002960115,0.001405173,0.0004012684,0.0009119624,0.001076736,0.0005940465,0.07914452,0.7384413,0.0008457898,0.04473294,0.1186365,0.0108496],"study_design_scores_gemma":[0.003619984,0.001180519,0.0003984409,0.0007477281,0.0001173014,0.000004176449,0.003276334,0.9621351,0.00008727278,0.0127017,0.01463519,0.001096309],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001860023,0.00006416362,0.984467,0.002918518,0.0004444626,0.004467319,0.001812496,0.0003926775,0.003573324],"genre_scores_gemma":[0.1724323,0.0001905705,0.8244343,0.0009947669,0.0001191705,0.00007378827,0.0007099091,0.0001539972,0.0008911662],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2236938,"threshold_uncertainty_score":0.9992247,"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."}}