{"id":"W4312250476","doi":"10.1609/icaps.v32i1.19798","title":"Multi-Agent Path Finding with Temporal Jump Point Search","year":2022,"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":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada; Monash University; National Science Foundation; Northeast Normal University; National Natural Science Foundation of China; Canadian Institute for Advanced Research","keywords":"Pathfinding; Jump; Path (computing); Computer science; Point (geometry); Grid; Planner; Mathematical optimization; Work (physics); Algorithm; Artificial intelligence; Mathematics; Theoretical computer science; Shortest path problem; 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.0005114531,0.0004610443,0.0005747394,0.0005771643,0.000496732,0.0006193323,0.0009290795,0.0005709804,0.002729383],"category_scores_gemma":[0.001514882,0.0002434298,0.000375808,0.0008622356,0.0006610873,0.000992225,0.001241167,0.000929713,0.0004246925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005634865,"about_ca_system_score_gemma":0.001704658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006566016,"about_ca_topic_score_gemma":0.008282413,"domain_scores_codex":[0.9996151,0.00009731066,0.00002260001,0.00007380806,0.0001440607,0.00004711761],"domain_scores_gemma":[0.9995091,0.0002081575,0.00004299248,0.00008397803,0.0001013372,0.00005450263],"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.0003809164,0.0001396888,0.001239255,0.0001568843,0.00005054195,0.0001615793,0.0001265263,0.7086121,0.009121652,0.04657548,0.003317424,0.2301179],"study_design_scores_gemma":[0.00002901484,0.00005310652,0.00008585736,0.000003591176,0.00000685551,0.00002292889,0.00001211319,0.9901888,0.002163088,0.005747238,0.001681899,0.00000554804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01707758,0.0001228721,0.9781099,0.00008275056,0.00004016337,0.00006780021,0.00006334748,0.001287185,0.003148423],"genre_scores_gemma":[0.3938951,0.0001170961,0.6028639,0.00006313562,0.00001935624,0.0001313045,0.0002423284,0.0001195079,0.002548263],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006566016,"threshold_uncertainty_score":0.01305562,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06576627797060018,"score_gpt":0.3031903675507545,"score_spread":0.2374240895801543,"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."}}