{"id":"W4409363599","doi":"10.1609/aaai.v39i25.34873","title":"Inapproximability of Optimal Multi-Agent Pathfinding Problems","year":2025,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"Natural Sciences and Engineering Research Council of Canada; Lakehead University","keywords":"Pathfinding; Computer science; Theoretical computer science; Shortest path problem","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004438721,0.001686847,0.002111557,0.001416099,0.001441935,0.005487994,0.003534719,0.002460322,0.00647841],"category_scores_gemma":[0.0347789,0.001172321,0.002180827,0.002149628,0.00316275,0.00630824,0.002742381,0.004973948,0.0008472137],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002980609,"about_ca_system_score_gemma":0.002305226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003278502,"about_ca_topic_score_gemma":0.002866686,"domain_scores_codex":[0.9959546,0.001500787,0.0002054914,0.0009036779,0.0008064489,0.0006289522],"domain_scores_gemma":[0.9619928,0.03374374,0.001474747,0.001491066,0.0007570458,0.0005406017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000442541,0.0003735968,0.00283158,0.0008193555,0.0001424609,0.0002234297,0.0006153971,0.7625237,0.001755191,0.1828197,0.007778211,0.03967491],"study_design_scores_gemma":[0.0000768447,0.00008937712,0.0004251474,0.00009210274,0.00003830869,0.0001354583,0.000230441,0.6978073,0.00134355,0.2973694,0.002371119,0.00002091067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.225233,0.00327892,0.7159302,0.008307128,0.0001677902,0.0003324967,0.001571379,0.001203711,0.04397544],"genre_scores_gemma":[0.8016281,0.002271004,0.1865194,0.0006631247,0.0003080786,0.0005658613,0.00165842,0.0003190939,0.006066847],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00647841,"threshold_uncertainty_score":0.02347445,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09230795298380508,"score_gpt":0.3135191796714521,"score_spread":0.221211226687647,"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."}}