{"id":"W3187649900","doi":"10.1016/j.artint.2021.103574","title":"Pairwise symmetry reasoning for multi-agent path finding search","year":2021,"lang":"en","type":"article","venue":"Artificial Intelligence","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":94,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pairwise comparison; Scalability; Bounded function; Computer science; Variety (cybernetics); Context (archaeology); Homogeneous space; Theoretical computer science; Node (physics); Path (computing); Symmetry (geometry); Combinatorial explosion; Combinatorial search; Algorithm; Mathematics; Search algorithm; Artificial intelligence; Combinatorics; Beam search; Physics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003467222,0.0008936419,0.001850793,0.001589268,0.001527893,0.001968898,0.004076545,0.001824877,0.006129502],"category_scores_gemma":[0.01529306,0.0008309583,0.002187549,0.001632889,0.001962218,0.006219226,0.003815652,0.00278812,0.0007716328],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001513208,"about_ca_system_score_gemma":0.002465742,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006442908,"about_ca_topic_score_gemma":0.005986496,"domain_scores_codex":[0.9973061,0.0009831573,0.0002146863,0.0005158485,0.0007599875,0.000220239],"domain_scores_gemma":[0.9943109,0.003663957,0.0004686925,0.0008438199,0.0005120724,0.0002006174],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006365939,0.0003788056,0.00174791,0.000416852,0.0002254968,0.0003403986,0.0003103183,0.5146628,0.003992308,0.2587772,0.005377709,0.2131336],"study_design_scores_gemma":[0.00003943514,0.00004216116,0.00008777643,0.00001383847,0.00002705349,0.00003729996,0.00003429431,0.8373778,0.001163278,0.1605485,0.0006165924,0.0000118913],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01283189,0.0001666612,0.9832255,0.0002015984,0.00004723117,0.0001010468,0.0001340247,0.00051072,0.002781412],"genre_scores_gemma":[0.4721775,0.000189691,0.5241604,0.0001523422,0.00005640252,0.0002508762,0.0006902306,0.0001732694,0.002149313],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006442908,"threshold_uncertainty_score":0.02050525,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1819009405321721,"score_gpt":0.3722673903453196,"score_spread":0.1903664498131475,"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."}}