{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003635728,0.001602667,0.001203958,0.002223122,0.001644857,0.002127471,0.005007133,0.001842068,0.004074323],"category_scores_gemma":[0.0152638,0.001112467,0.002897566,0.002326881,0.002362767,0.006254588,0.005041542,0.005784674,0.0009695732],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001197349,"about_ca_system_score_gemma":0.002431926,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002564962,"about_ca_topic_score_gemma":0.003204959,"domain_scores_codex":[0.9946701,0.001189872,0.0004529299,0.0009710874,0.00229697,0.000418977],"domain_scores_gemma":[0.9904093,0.004202351,0.00122278,0.00294897,0.0009630592,0.0002535609],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000315312,0.0004777876,0.002702737,0.0009077336,0.0003013794,0.0007858583,0.000999699,0.1929282,0.03259133,0.2427697,0.008241176,0.5169791],"study_design_scores_gemma":[0.0001140872,0.000155574,0.0004543735,0.0001076405,0.0001034365,0.0005833098,0.0002122971,0.7719958,0.01939492,0.1929944,0.01380243,0.0000817677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003232186,0.000144379,0.9944899,0.0001565446,0.0000451782,0.0001047407,0.00005017758,0.0005988915,0.001177995],"genre_scores_gemma":[0.07862236,0.0001662337,0.9197026,0.0001571671,0.00006196966,0.0001568922,0.000195588,0.0002394297,0.0006976732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005007133,"threshold_uncertainty_score":0.0192278,"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."}}