{"id":"W3190502896","doi":"10.24963/ijcai.2021/557","title":"Type-WA*: Using Exploration in Bounded Suboptimal Planning","year":2021,"lang":"en","type":"article","venue":"","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University; Schwartz/Reisman Emergency Medicine Institute; Vector Institute; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Microsoft Research","keywords":"Satisficing; Heuristics; Bounded function; Mathematical optimization; Heuristic; Computer science; Greedy algorithm; Quality (philosophy); Mathematics; Artificial intelligence","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.0002542923,0.00008361933,0.0001009434,0.00008626437,0.0001047366,0.00022133,0.0001879123,0.00005247181,0.00003334898],"category_scores_gemma":[0.00004783281,0.00008606676,0.00002086518,0.0005497321,0.000009461279,0.0007336988,0.00009993818,0.0001296352,0.0000269274],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004456581,"about_ca_system_score_gemma":0.0001911565,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006344273,"about_ca_topic_score_gemma":0.00001715505,"domain_scores_codex":[0.9991417,0.00006773875,0.0001661742,0.0002618469,0.000142508,0.0002200643],"domain_scores_gemma":[0.9995432,0.00007403544,0.00004011536,0.0002310855,0.00006748666,0.00004405504],"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.00006980521,0.0002799778,0.1351963,0.0001191787,0.00006141346,0.002247425,0.0212141,0.636229,0.04219699,0.1357167,0.00469969,0.02196936],"study_design_scores_gemma":[0.0003032153,0.00003984878,0.00116791,0.0001104796,0.000002908474,0.00004430276,0.0002485688,0.9841621,0.008202036,0.004228808,0.00125486,0.000234941],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1911144,0.0002715129,0.8027914,0.0004641756,0.0003016167,0.00004139249,2.826093e-7,0.0001364877,0.004878796],"genre_scores_gemma":[0.7389091,0.00000255384,0.2604155,0.0002802873,0.00004132587,0.000001567475,0.000008424367,0.000006027801,0.0003351494],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5477948,"threshold_uncertainty_score":0.3509701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1001390083551027,"score_gpt":0.3128713688615996,"score_spread":0.2127323605064969,"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."}}