{"id":"W2896987114","doi":"10.1109/cig.2018.8490436","title":"Multi-Agent Pathfinding with Real-Time Heuristic Search","year":2018,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Nvidia; National Science Foundation","keywords":"Pathfinding; Heuristic; Computer science; Consistent heuristic; Task (project management); Incremental heuristic search; Null-move heuristic; Artificial intelligence; Algorithm; Search algorithm; Beam search; Theoretical computer science; Shortest path problem; Engineering","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":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004095707,0.0001428588,0.0001479273,0.0001091879,0.0001957221,0.0001529144,0.0007543608,0.0000437431,0.00006377517],"category_scores_gemma":[0.0000337565,0.0001057306,0.00002449934,0.0003984982,0.000101221,0.0002119041,0.0002475006,0.000110933,0.002020267],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005596588,"about_ca_system_score_gemma":0.00009447874,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001364561,"about_ca_topic_score_gemma":0.000002385489,"domain_scores_codex":[0.9984598,0.00007367475,0.0001581716,0.0004617044,0.0003914855,0.0004551221],"domain_scores_gemma":[0.9989245,0.0001007448,0.00004223137,0.0006390514,0.0001271062,0.0001663662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003152712,0.00440322,0.1523069,0.0004700127,0.00120393,0.01134856,0.08860323,0.03203661,0.2324963,0.0598599,0.08041114,0.3365448],"study_design_scores_gemma":[0.0004101312,0.0003532815,0.01748564,0.00004464244,0.000004736521,0.00008678544,0.00003071491,0.9789162,0.002242484,0.0000329887,0.00015247,0.0002399441],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02162341,0.000005728813,0.9691119,0.0001876855,0.0001979829,0.000139519,0.000001159779,0.0004389681,0.008293601],"genre_scores_gemma":[0.136611,0.000002078207,0.8583083,0.00009658715,0.0001114266,0.000005798089,0.000001674147,0.00001328541,0.004849894],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9468796,"threshold_uncertainty_score":0.9987568,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03696175880854912,"score_gpt":0.2858772317486296,"score_spread":0.2489154729400804,"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."}}