{"id":"W2966291835","doi":"10.1609/icaps.v29i1.3474","title":"A Multi-Label A* Algorithm for Multi-Agent Pathfinding","year":2019,"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":69,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Pathfinding; Computer science; Computation; Pickup; Set (abstract data type); Heuristic; Sequence (biology); Mathematical optimization; Path (computing); Job shop scheduling; Algorithm; Theoretical computer science; Artificial intelligence; Shortest path problem; Mathematics; Schedule; Graph","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.0005456024,0.0002114858,0.0002421364,0.0001752242,0.000161829,0.0003152151,0.001225693,0.0001040571,0.000003871513],"category_scores_gemma":[0.0002073517,0.000166992,0.00006796462,0.0001620926,0.00004092362,0.0003440425,0.000306988,0.0002494476,0.00001229849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005613477,"about_ca_system_score_gemma":0.00006496481,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008790404,"about_ca_topic_score_gemma":5.504985e-8,"domain_scores_codex":[0.9984575,0.00000909221,0.0003481616,0.0004747837,0.0004208462,0.0002896246],"domain_scores_gemma":[0.9988872,0.0001044415,0.0003694637,0.0001358514,0.0004276138,0.00007545287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002293906,0.001620932,0.1121326,0.0008227231,0.001330996,0.00002966023,0.02097951,0.02349365,0.5235699,0.1477986,0.001103694,0.1668884],"study_design_scores_gemma":[0.001147953,0.00008843892,0.002781506,0.0007675031,0.000009450765,0.00002452725,0.0003400457,0.9891583,0.005277244,0.000186525,0.00001985158,0.0001986742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.5144677,0.000106334,0.4799628,0.001014113,0.002024107,0.0007325503,0.00003797234,0.000801792,0.0008527072],"genre_scores_gemma":[0.3532882,0.000004088219,0.6462588,0.0001129003,0.00002963586,0.00002128579,0.000003331495,0.0000118547,0.0002699379],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9656646,"threshold_uncertainty_score":0.6809736,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08975077837246882,"score_gpt":0.3315500664996794,"score_spread":0.2417992881272106,"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."}}