{"id":"W4382866847","doi":"10.1609/icaps.v33i1.27201","title":"Solving Domain-Independent Dynamic Programming Problems with Anytime Heuristic Search","year":2023,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Travelling salesman problem; Mathematical optimization; Heuristic; Domain (mathematical analysis); Computer science; Constraint programming; Dynamic programming; Constraint satisfaction problem; Mathematics; Stochastic programming; 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.000664034,0.0001778542,0.0001761263,0.0002309455,0.0001581351,0.0002361611,0.000368849,0.00007883961,0.000008613083],"category_scores_gemma":[0.0001104374,0.0001385071,0.00003249177,0.0004023591,0.00006250085,0.000148462,0.0001083105,0.0003385046,0.00000577233],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006676124,"about_ca_system_score_gemma":0.00003394063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005398419,"about_ca_topic_score_gemma":5.92136e-7,"domain_scores_codex":[0.9986985,0.00001081913,0.0002759915,0.0002440285,0.0004880631,0.0002826338],"domain_scores_gemma":[0.999406,0.00008009521,0.0001096632,0.00007112973,0.0002708674,0.00006221359],"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.00004568711,0.0000237773,0.02207583,0.0003302198,0.0001734805,0.000006347512,0.002896147,0.9209042,0.04772167,0.003135127,0.00004221576,0.002645275],"study_design_scores_gemma":[0.000290935,0.00004154637,0.005430016,0.001154917,0.0000120802,0.00002832574,0.001153112,0.9888298,0.002625031,0.0002526023,0.00001731425,0.0001643262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9916792,0.00003214848,0.003576491,0.0003504037,0.0001704512,0.0002229344,0.000006058566,0.001505991,0.002456346],"genre_scores_gemma":[0.9597281,0.00001449838,0.04006394,0.00001272133,0.0000222996,0.00002060218,0.000007951144,0.00003660859,0.00009325466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.06792556,"threshold_uncertainty_score":0.5648155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02913668222290711,"score_gpt":0.2891739207322735,"score_spread":0.2600372385093664,"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."}}