{"id":"W4399177038","doi":"10.1609/icaps.v34i1.31455","title":"Exact Multi-objective Path Finding with Negative Weights","year":2024,"lang":"en","type":"article","venue":"Proceedings of the International Conference on Automated Planning and Scheduling","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"State Government of Victoria; Australian Government","keywords":"Mathematical optimization; Shortest path problem; Computer science; Path (computing); Point (geometry); Graph; Enhanced Data Rates for GSM Evolution; Task (project management); Pareto optimal; Algorithm; Multi-objective optimization; Mathematics; Theoretical computer science; Artificial intelligence; Engineering","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003396671,0.0002052799,0.0001848086,0.0002335061,0.0001756303,0.0006000745,0.0008083051,0.00007366974,0.000003876078],"category_scores_gemma":[0.0001730188,0.0001333236,0.00004572995,0.0003385922,0.00008161081,0.0005467157,0.0001971655,0.000382927,0.000006267143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006602656,"about_ca_system_score_gemma":0.0001093916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001937311,"about_ca_topic_score_gemma":1.753089e-7,"domain_scores_codex":[0.9985948,0.00001221045,0.0002336412,0.0004591164,0.0004812269,0.0002190499],"domain_scores_gemma":[0.9991723,0.0001900846,0.0001805005,0.00009393857,0.0002994076,0.0000637799],"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.0003569915,0.0003859769,0.05100264,0.0007253035,0.001878297,0.0002793874,0.06893633,0.03725786,0.06138104,0.7637227,0.0009955465,0.01307794],"study_design_scores_gemma":[0.0002516813,0.00009747575,0.005438048,0.002926149,0.00001322742,0.00008358515,0.0006118459,0.9797595,0.009021834,0.001607287,0.00001164043,0.0001777601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.927985,0.0002110771,0.05662493,0.002097006,0.00113792,0.0003230696,0.00001893289,0.001564848,0.01003725],"genre_scores_gemma":[0.8678323,0.000006770881,0.1318838,0.0000539148,0.00004256799,0.0000113865,0.000001467137,0.00001200232,0.0001557386],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9425016,"threshold_uncertainty_score":0.5786532,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03990089687618361,"score_gpt":0.2981061731035023,"score_spread":0.2582052762273188,"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."}}