{"id":"W3201099806","doi":"10.1109/lra.2021.3139145","title":"Learning Selective Communication for Multi-Agent Path Finding","year":2021,"lang":"en","type":"article","venue":"IEEE Robotics and Automation Letters","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Computer science; Overhead (engineering); Imitation; Reinforcement learning; Artificial intelligence; Path (computing); Focus (optics); Simple (philosophy); Scheme (mathematics); Machine learning; Telecommunications network; Distributed computing; Computer network; Mathematics","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.001630703,0.0009836124,0.001268404,0.0005844554,0.0008006617,0.0008592272,0.002040206,0.001530223,0.003028846],"category_scores_gemma":[0.007139929,0.0006338161,0.0006350814,0.0005231675,0.001339839,0.001604169,0.002177468,0.001976926,0.0004196239],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001116676,"about_ca_system_score_gemma":0.002001766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00424629,"about_ca_topic_score_gemma":0.004051891,"domain_scores_codex":[0.9991672,0.0002289475,0.00004902303,0.0002421315,0.0001671497,0.0001454983],"domain_scores_gemma":[0.9964001,0.002359322,0.0004188342,0.0003134135,0.0002972574,0.0002109608],"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.0000869358,0.00006282356,0.0006811466,0.0000693389,0.00003614687,0.00008520042,0.0001112921,0.938713,0.001302746,0.01601465,0.001089373,0.04174741],"study_design_scores_gemma":[0.00001048232,0.00001583505,0.00002882756,0.000002392852,0.00000343297,0.000006232267,0.000006576826,0.9944394,0.0002296452,0.005062898,0.0001916928,0.000002736653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02721179,0.000160041,0.9689175,0.0003447011,0.00004234392,0.00007367916,0.00004039703,0.0007162922,0.002493219],"genre_scores_gemma":[0.8458142,0.0001472857,0.1493534,0.0002160843,0.00005057884,0.0003376442,0.0001357253,0.0001103941,0.00383458],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00424629,"threshold_uncertainty_score":0.01013249,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03388270364324859,"score_gpt":0.2801529579146556,"score_spread":0.246270254271407,"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."}}