{"id":"W2574020264","doi":"10.1609/icaps.v26i1.13773","title":"From FOND to Robust Probabilistic Planning: Computing Compact Policies that Bypass Avoidable Deadends","year":2016,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Probabilistic logic; Leverage (statistics); Exploit; Planner; Computer science; Class (philosophy); Mathematical optimization; Artificial intelligence; Mathematics; Computer security","routes":{"ca_aff":true,"ca_fund":true,"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.002523593,0.001188087,0.001162251,0.0007379776,0.0005500137,0.00125192,0.001708522,0.001374224,0.003292712],"category_scores_gemma":[0.01666202,0.0007863921,0.0008970175,0.0007855929,0.001762682,0.002556908,0.002488741,0.002291246,0.0003828112],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001204261,"about_ca_system_score_gemma":0.003050577,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005841655,"about_ca_topic_score_gemma":0.008769387,"domain_scores_codex":[0.998534,0.0004754557,0.00009295596,0.0002658152,0.0004537574,0.0001780349],"domain_scores_gemma":[0.9914072,0.006447691,0.000481231,0.001000697,0.000391469,0.0002716843],"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.0001272948,0.00005216053,0.0005820984,0.0001127161,0.00002773471,0.00006497955,0.00005898827,0.9412,0.0008473005,0.01675772,0.001332331,0.03883663],"study_design_scores_gemma":[0.00001909227,0.00004402167,0.0000678951,0.00001133349,0.000007427148,0.00001938486,0.00001251404,0.975674,0.0007402183,0.02282408,0.0005734622,0.000006557474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07132992,0.0005822197,0.9168584,0.00060919,0.00008665494,0.0001366765,0.000351594,0.004186802,0.005858541],"genre_scores_gemma":[0.6351615,0.00032042,0.3611915,0.0002633244,0.0000415176,0.0002140501,0.0006990144,0.0005322398,0.001576399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005841655,"threshold_uncertainty_score":0.01334614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06966296944873947,"score_gpt":0.2992959930767713,"score_spread":0.2296330236280319,"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."}}