{"id":"W3197573625","doi":"10.1609/socs.v12i1.18594","title":"Speeding Up Heuristic Function Synthesis via Extending the Formula Grammar","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Heuristics; Heuristic; Computer science; Grammar; Consistent heuristic; Function (biology); Incremental heuristic search; Null-move heuristic; Quality (philosophy); Pathfinding; Artificial intelligence; Beam search; Algorithm; Theoretical computer science; Search algorithm","routes":{"ca_aff":true,"ca_fund":false,"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.001782603,0.001117845,0.0008471786,0.0009634174,0.0005317587,0.001506943,0.001603721,0.001047916,0.005210977],"category_scores_gemma":[0.01024594,0.0006628541,0.001398186,0.0007249374,0.001621999,0.002284338,0.001773202,0.001911297,0.001000392],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001084626,"about_ca_system_score_gemma":0.001703849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00428579,"about_ca_topic_score_gemma":0.006537242,"domain_scores_codex":[0.9985865,0.0004716491,0.0001159585,0.0002533869,0.0004412761,0.0001312665],"domain_scores_gemma":[0.9941207,0.003981159,0.0001714832,0.001122528,0.0005346886,0.00006948119],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002192776,0.0002326623,0.002103562,0.0004834999,0.00009488332,0.0004296716,0.000466907,0.3644739,0.03895392,0.06720941,0.003902536,0.5214298],"study_design_scores_gemma":[0.00008763164,0.000170833,0.0002614314,0.00006913681,0.00008630982,0.0001611923,0.00008951218,0.9029732,0.02571252,0.05692921,0.01342669,0.00003223791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03181493,0.0002179581,0.9567364,0.0002162189,0.00009267772,0.0001715563,0.0001321103,0.004518621,0.006099485],"genre_scores_gemma":[0.2043129,0.0002208956,0.7921059,0.0001780508,0.00003913228,0.000172555,0.0003584224,0.001066709,0.001545427],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005210977,"threshold_uncertainty_score":0.01743239,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01931449743107994,"score_gpt":0.2549824422958675,"score_spread":0.2356679448647875,"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."}}