{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001049947,0.0002507073,0.0003929294,0.0002140149,0.0001724968,0.0001381757,0.002703361,0.0001178218,0.00001095653],"category_scores_gemma":[0.0007804161,0.0001935866,0.0001523001,0.001144129,0.0003874037,0.0003277521,0.0007530882,0.0003592437,0.00001792339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008111367,"about_ca_system_score_gemma":0.000200105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005018718,"about_ca_topic_score_gemma":0.000001599575,"domain_scores_codex":[0.9976179,0.00003258868,0.0008381309,0.0006195518,0.0004986267,0.0003932141],"domain_scores_gemma":[0.9980053,0.0001406499,0.0005253496,0.0004916991,0.0007666071,0.0000703488],"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.00004708881,0.0007230274,0.003160504,0.0003329743,0.00004958779,8.318165e-7,0.004164155,0.003807611,0.06527005,0.8321493,0.00007780061,0.09021702],"study_design_scores_gemma":[0.00005214963,0.0001561737,0.001342551,0.0006313209,0.00001460637,0.000002288175,0.0004526507,0.4930807,0.4671392,0.03690642,0.00002571131,0.0001961969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1843815,0.00005509119,0.8060506,0.002029625,0.0009163314,0.0009976833,0.000008233383,0.0001571544,0.005403785],"genre_scores_gemma":[0.9025081,0.00001071068,0.09714217,0.00005972511,0.00001584988,0.00003658944,3.027631e-7,0.000007391689,0.0002191911],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7952429,"threshold_uncertainty_score":0.7894234,"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."}}