{"id":"W2402290736","doi":"10.1609/socs.v3i1.18259","title":"A* Variants for Optimal Multi-Agent Pathfinding","year":2021,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Natural Language Processing Techniques","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Israel Science Foundation","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.0006324715,0.0001484767,0.0001665691,0.00008182345,0.000186805,0.0003556768,0.002459045,0.00009590787,0.000008391204],"category_scores_gemma":[0.0004770544,0.0001176715,0.000152131,0.0003497099,0.00004647326,0.0004102015,0.001060119,0.0002642812,0.000004138767],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002168234,"about_ca_system_score_gemma":0.0001189043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001675007,"about_ca_topic_score_gemma":4.060516e-7,"domain_scores_codex":[0.9981191,0.00001374705,0.0002865007,0.0004383896,0.0008710921,0.0002712242],"domain_scores_gemma":[0.9981049,0.0001412141,0.0001690762,0.0001900065,0.001330005,0.00006485406],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00005430098,0.0002581319,0.000389243,0.00004426583,0.00004493863,0.000002628246,0.0003259017,0.00001509571,0.3180544,0.6789317,0.0007772495,0.001102167],"study_design_scores_gemma":[0.0009568262,0.000123174,0.0001326645,0.0001586705,0.000008074317,0.00001998043,0.00003411215,0.01140886,0.956706,0.02891323,0.001369776,0.0001685661],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.681987,0.0007432102,0.194572,0.06323588,0.04273497,0.00351802,0.00013634,0.001415612,0.01165693],"genre_scores_gemma":[0.878213,0.00001161523,0.1206907,0.0001931159,0.0003086064,0.00005085956,0.000002887764,0.0000180285,0.0005112558],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6500184,"threshold_uncertainty_score":0.4798505,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02463526732612297,"score_gpt":0.2993281981942744,"score_spread":0.2746929308681514,"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."}}