{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005820956,0.0002875962,0.000312358,0.0002503904,0.0003360081,0.0005884289,0.001549892,0.000115703,0.00001267516],"category_scores_gemma":[0.0004674568,0.000189915,0.00006860689,0.0002707136,0.0000850943,0.0004345234,0.0004005723,0.0002873723,0.00001020888],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009120654,"about_ca_system_score_gemma":0.00008486884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001399933,"about_ca_topic_score_gemma":8.884126e-7,"domain_scores_codex":[0.9980055,0.00002581922,0.0004012027,0.000551503,0.0006050371,0.0004109524],"domain_scores_gemma":[0.9983884,0.0005197641,0.0004106487,0.000175577,0.0003452069,0.0001604647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004690023,0.0002592992,0.3739962,0.0002597327,0.0006744727,0.00002889539,0.02742135,0.1722432,0.1992484,0.2083191,0.01041528,0.00666507],"study_design_scores_gemma":[0.00066485,0.000156348,0.02121367,0.005553722,0.00002322902,0.00003390291,0.001008706,0.9397348,0.02428031,0.006665633,0.0001878522,0.0004769506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9631098,0.00007256043,0.02280678,0.008585292,0.0004878848,0.0002031862,0.00003430344,0.0006445836,0.004055617],"genre_scores_gemma":[0.9798717,0.000002012325,0.01948644,0.0003272793,0.0001133782,0.000005877075,0.000004137529,0.00001752887,0.0001716415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7674916,"threshold_uncertainty_score":0.7744508,"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."}}