{"id":"W3206082228","doi":"10.1109/icra48506.2021.9560748","title":"Distributed Heuristic Multi-Agent Path Finding with Communication","year":2021,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":102,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Heuristic; Multi-agent system; Path (computing); Distributed computing; Mathematical optimization; Artificial intelligence; Mathematics; Computer network","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.0001689217,0.0001008645,0.0001178367,0.00002930278,0.0001606938,0.0001555589,0.0005720143,0.00003326527,0.00001284782],"category_scores_gemma":[0.0000918511,0.00008283347,0.0000235206,0.0003904919,0.00002707493,0.0001826961,0.0002764406,0.0001281059,0.00006370452],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005476945,"about_ca_system_score_gemma":0.00008922265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002520129,"about_ca_topic_score_gemma":0.000004890827,"domain_scores_codex":[0.999052,0.000104771,0.0001519845,0.000275532,0.0002052539,0.0002104826],"domain_scores_gemma":[0.9987152,0.00013291,0.0000643373,0.0008880383,0.0001176358,0.00008188387],"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.00006063639,0.005468382,0.2031183,0.0004332606,0.0009716129,0.009699961,0.02113601,0.284758,0.008334333,0.2594936,0.04670407,0.1598219],"study_design_scores_gemma":[0.0005680236,0.00004287439,0.03594026,0.00008796972,0.000009708981,0.0001378977,0.0001167329,0.9606447,0.001209588,0.0001702939,0.0008377256,0.0002342208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0024791,0.0001285694,0.9956903,0.000709219,0.00009473671,0.00006653835,0.000006110842,0.000222672,0.0006027895],"genre_scores_gemma":[0.3007006,0.000008587925,0.6986186,0.0001283767,0.000007866118,0.000007735443,0.0000555102,0.000005345227,0.0004673842],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6758867,"threshold_uncertainty_score":0.3377851,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03813261038376044,"score_gpt":0.2721603191303243,"score_spread":0.2340277087465638,"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."}}