{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002515489,0.0008900851,0.0008237047,0.0007053128,0.0006005768,0.001220706,0.00180196,0.0008981413,0.002804349],"category_scores_gemma":[0.01221287,0.0005494064,0.0008687923,0.001065594,0.001406841,0.002328602,0.002266034,0.001514617,0.0006108324],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007905331,"about_ca_system_score_gemma":0.002661919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003786396,"about_ca_topic_score_gemma":0.006968011,"domain_scores_codex":[0.998022,0.000937001,0.0001041943,0.0002522142,0.0004821104,0.0002025611],"domain_scores_gemma":[0.9920694,0.005364374,0.0005345219,0.001353453,0.0004611045,0.0002171873],"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.0006053913,0.0002116673,0.004598838,0.0004130529,0.0001357714,0.00017394,0.0003770471,0.5533001,0.008968993,0.04713263,0.006283334,0.3777993],"study_design_scores_gemma":[0.00004970164,0.0001571345,0.0002475601,0.00004009074,0.00002796013,0.00009908663,0.00006597943,0.9614521,0.004001502,0.03036327,0.003476335,0.000019332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04062293,0.0005462107,0.9501504,0.0003190437,0.00006653993,0.0001356436,0.0001252231,0.002727112,0.0053068],"genre_scores_gemma":[0.379837,0.0002396721,0.6170784,0.0002104116,0.00002223166,0.0002516108,0.0002083219,0.0004092037,0.001743117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003786396,"threshold_uncertainty_score":0.01330334,"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."}}