{"id":"W3038024331","doi":"10.1609/icaps.v30i1.6661","title":"New Techniques for Pairwise Symmetry Breaking in Multi-Agent Path Finding","year":2020,"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":45,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"University of Southern California; National Science Foundation","keywords":"Pairwise comparison; Homogeneous space; Path (computing); Symmetry (geometry); Context (archaeology); Rotational symmetry; Computer science; Symmetry breaking; Class (philosophy); Local symmetry; Theoretical computer science; Algorithm; Theoretical physics; Mathematics; Artificial intelligence; Physics; Geometry; Quantum mechanics","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.0004069417,0.0001718121,0.0002129947,0.0001658168,0.00009767483,0.0002504384,0.001018466,0.00008786319,0.00000170067],"category_scores_gemma":[0.0005232299,0.0001424218,0.0000555185,0.0002674311,0.00002364495,0.0002995337,0.000268099,0.0002604432,0.000001245621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005000848,"about_ca_system_score_gemma":0.00008302837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002299134,"about_ca_topic_score_gemma":1.394982e-7,"domain_scores_codex":[0.998705,0.00000883238,0.0003460828,0.0003914073,0.000325242,0.0002234882],"domain_scores_gemma":[0.9992477,0.0001104854,0.0002934099,0.00007488434,0.0001783682,0.00009515846],"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.0005176116,0.0004158381,0.2204984,0.001098139,0.0004886928,0.00006765495,0.03906827,0.02830141,0.2692081,0.3028401,0.004170359,0.1333254],"study_design_scores_gemma":[0.0004108325,0.00009469302,0.002936938,0.001185134,0.000005884293,0.0000121926,0.0003128041,0.9794981,0.01470778,0.0006336751,0.00004130943,0.0001606294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3889994,0.0001678697,0.5929308,0.01213563,0.0007876237,0.0008356404,0.00002166452,0.001720793,0.002400544],"genre_scores_gemma":[0.6392721,0.000003758103,0.3604127,0.0002228608,0.00004741578,0.00001085557,0.000001515465,0.00000826313,0.00002051121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9511967,"threshold_uncertainty_score":0.5807792,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09075200892442147,"score_gpt":0.32523314933394,"score_spread":0.2344811404095186,"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."}}