{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007609857,0.0001743056,0.0001816591,0.0002079592,0.0004427804,0.000278212,0.001345737,0.00003796534,0.00001272761],"category_scores_gemma":[0.0000863782,0.0001310552,0.00004303701,0.0003095941,0.00006017337,0.0002715855,0.0007187189,0.0004855584,0.000002571771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009652558,"about_ca_system_score_gemma":0.0001156827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003504631,"about_ca_topic_score_gemma":1.219119e-7,"domain_scores_codex":[0.9981912,0.00002395653,0.0002733092,0.0004130355,0.0008373263,0.0002611566],"domain_scores_gemma":[0.9992115,0.00006612952,0.0002684668,0.0001279844,0.0002510053,0.00007487569],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004305229,0.0007161903,0.4250985,0.0002403387,0.0006101788,0.0001694524,0.03081581,0.3840314,0.07320419,0.07952619,0.001285929,0.003871351],"study_design_scores_gemma":[0.0004648331,0.0001644522,0.008121721,0.0003510525,0.000006585252,0.0001251584,0.001570199,0.9864452,0.002397815,0.0001566397,0.0000260432,0.0001702605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.981716,0.00004258931,0.01361019,0.002145969,0.0004589681,0.000204871,0.0000153442,0.0004607031,0.001345336],"genre_scores_gemma":[0.8702564,0.000001885038,0.1294037,0.0001334339,0.00002169804,0.00002053715,0.000004328676,0.00001098568,0.0001470031],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6024139,"threshold_uncertainty_score":0.5344275,"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."}}