{"id":"W135686785","doi":"10.1609/aaai.v28i1.9035","title":"Adding Local Exploration to Greedy Best-First Search in Satisficing Planning","year":2014,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Alberta Innovates; Alberta Innovates - Technology Futures","keywords":"Satisficing; Local search (optimization); Guided Local Search; Best-first search; Mathematical optimization; Beam search; Incremental heuristic search; Heuristic; Greedy algorithm; Mathematics; Hill climbing; Search algorithm; Computer science; 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.002948186,0.001074721,0.001208024,0.001120818,0.0007082117,0.001162546,0.001604396,0.001234908,0.002410259],"category_scores_gemma":[0.009413754,0.0007924043,0.0009224899,0.001194343,0.002064047,0.002393,0.002653409,0.001820128,0.00054767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001203291,"about_ca_system_score_gemma":0.002391823,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005099509,"about_ca_topic_score_gemma":0.009135818,"domain_scores_codex":[0.9978837,0.001205792,0.00008823844,0.0002254081,0.0004139926,0.0001828003],"domain_scores_gemma":[0.9962663,0.002768515,0.0002129322,0.0004078564,0.0002201087,0.0001243797],"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.0002962635,0.0001374942,0.00133966,0.0002272142,0.00007281578,0.0001387458,0.0003728842,0.7947907,0.003174161,0.03207554,0.002270241,0.1651043],"study_design_scores_gemma":[0.0000583491,0.0001550833,0.0001307088,0.00003257301,0.0000297552,0.00005666246,0.00004757898,0.9693653,0.001943674,0.0263725,0.001785443,0.00002245662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02623177,0.0007534036,0.9653505,0.0003312525,0.00003628459,0.0001230794,0.00004066329,0.00230279,0.004830362],"genre_scores_gemma":[0.4747643,0.0004216861,0.5219108,0.0002595371,0.00004066696,0.0002774617,0.000121936,0.0003594627,0.00184402],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005099509,"threshold_uncertainty_score":0.01559168,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1138181047269164,"score_gpt":0.3124380235152062,"score_spread":0.1986199187882898,"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."}}