{"id":"W3177062893","doi":"10.1609/icaps.v31i1.15964","title":"LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions","year":2021,"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":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristics; Heuristic; Operator (biology); Simple (philosophy); State (computer science); Mathematical optimization; Computer science; Consistent heuristic; Algorithm; Mathematics; Null-move heuristic; Constant (computer programming); Incremental heuristic search; Search algorithm; Beam search","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.001627076,0.0009740963,0.0007617449,0.001061298,0.0005475946,0.001067435,0.001399721,0.001041042,0.005993613],"category_scores_gemma":[0.005903268,0.0004631768,0.0007176895,0.001375658,0.001663511,0.001579544,0.001093441,0.001835589,0.0005387756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001734801,"about_ca_system_score_gemma":0.001905738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002855798,"about_ca_topic_score_gemma":0.004125028,"domain_scores_codex":[0.998776,0.0005135125,0.00007175098,0.0001706941,0.0003304142,0.0001375119],"domain_scores_gemma":[0.9972325,0.00197563,0.0002461239,0.0002502782,0.0001788128,0.0001167674],"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.0002070332,0.0001215725,0.0004054828,0.0002481152,0.00002199474,0.0001221623,0.00009223571,0.8449719,0.002602716,0.07299747,0.002384773,0.07582454],"study_design_scores_gemma":[0.00004956601,0.00008125955,0.00013214,0.00004336852,0.000009928606,0.00004018759,0.00003160301,0.9290458,0.001843421,0.06647202,0.002236895,0.0000137446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03117618,0.0003580237,0.9517906,0.0003345891,0.00008015077,0.0002122161,0.0002918559,0.0009255299,0.01483094],"genre_scores_gemma":[0.2751556,0.0001666194,0.7211844,0.0001744638,0.00003317382,0.0003111727,0.0004498716,0.0001730156,0.00235171],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005993613,"threshold_uncertainty_score":0.02005059,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0314566558341207,"score_gpt":0.2930029595744092,"score_spread":0.2615463037402885,"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."}}