{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001446263,0.0002305785,0.0002729323,0.0003313429,0.0003150361,0.0003325781,0.001585716,0.00009942116,0.00001549804],"category_scores_gemma":[0.0006292717,0.000196043,0.00006196406,0.001071168,0.0001135316,0.0006740197,0.0004055867,0.0004431956,0.000117435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008840878,"about_ca_system_score_gemma":0.00007906898,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002492576,"about_ca_topic_score_gemma":0.00007079978,"domain_scores_codex":[0.9977452,0.00004191594,0.0005813119,0.0005729128,0.0005648691,0.0004938142],"domain_scores_gemma":[0.99867,0.0003477145,0.0002090641,0.0002881057,0.0003547782,0.0001303333],"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.00008434173,0.00009886828,0.003865959,0.00009280079,0.000008655461,0.000001735069,0.01560692,0.0615933,0.01087461,0.6341127,0.0001596682,0.2735004],"study_design_scores_gemma":[0.00004760989,0.000466941,0.0004270353,0.001924685,0.000006078225,0.000004409371,0.002437605,0.789782,0.1675139,0.03680954,0.0002116934,0.0003684749],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1750641,0.00001860437,0.8115137,0.005568256,0.0003420267,0.0004350657,0.000001842157,0.000114795,0.006941628],"genre_scores_gemma":[0.9881065,0.000005015431,0.01142476,0.0002777003,0.00007525738,0.00002904432,5.992023e-7,0.0000144515,0.00006670336],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8130423,"threshold_uncertainty_score":0.7994399,"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."}}