{"id":"W4312891993","doi":"10.1609/icaps.v32i1.19804","title":"Biased Exploration for Satisficing Heuristic Search","year":2022,"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":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Satisficing; Incremental heuristic search; Heuristic; Mathematical optimization; Beam search; Best-first search; Node (physics); Computer science; Consistent heuristic; Null-move heuristic; Greedy algorithm; Mathematics; Search algorithm; Algorithm; Artificial intelligence; Engineering","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.0008548825,0.0001209333,0.0001347594,0.0001709126,0.000569907,0.0002637566,0.0008250985,0.00003396314,0.000009251613],"category_scores_gemma":[0.0002727256,0.000104945,0.00004574477,0.00021724,0.00002923194,0.0002918592,0.0002952327,0.0002722005,8.964162e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005161922,"about_ca_system_score_gemma":0.00008537908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002031569,"about_ca_topic_score_gemma":1.955952e-7,"domain_scores_codex":[0.9987665,0.00002014996,0.0002601103,0.0002993638,0.0004668561,0.0001869911],"domain_scores_gemma":[0.9991153,0.0002632289,0.0002237587,0.00008109557,0.0002741988,0.00004234457],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000387658,0.0001595017,0.01942224,0.0002885256,0.0001973871,0.000006516889,0.0161153,0.3052772,0.1167186,0.5277792,0.002662238,0.01098566],"study_design_scores_gemma":[0.0003074095,0.0001323822,0.0004709571,0.0002590995,0.000006728489,0.00001472928,0.00104041,0.9867386,0.006991224,0.003816872,0.00009711477,0.0001245196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9438564,0.0000874727,0.0463258,0.00592967,0.0006788853,0.0003511388,0.00003548025,0.0005460683,0.002189083],"genre_scores_gemma":[0.9794974,0.000002898587,0.02011027,0.000189342,0.00003535758,0.00004801048,0.00001061902,0.000009448016,0.00009663215],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6814613,"threshold_uncertainty_score":0.4383321,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08200595162074595,"score_gpt":0.3090906722865417,"score_spread":0.2270847206657958,"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."}}