{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001093653,0.001136852,0.0007695034,0.0006731475,0.0005832029,0.001015634,0.002101264,0.001363935,0.002485002],"category_scores_gemma":[0.003654224,0.0004917823,0.0006785154,0.000780697,0.0008630353,0.001498466,0.001448535,0.001025737,0.0005827592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008150308,"about_ca_system_score_gemma":0.001616839,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006069445,"about_ca_topic_score_gemma":0.004886813,"domain_scores_codex":[0.9991549,0.0002804931,0.00006144329,0.0001845264,0.0002260238,0.00009247405],"domain_scores_gemma":[0.9979666,0.001143435,0.0002258512,0.0003470393,0.0002006308,0.0001165643],"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.0002734401,0.0001810427,0.0004940776,0.0001619677,0.00006380009,0.0001092906,0.0001302633,0.8491843,0.005106347,0.009239828,0.001685144,0.1333705],"study_design_scores_gemma":[0.00003995591,0.00005490194,0.00006120152,0.0000076746,0.00000889346,0.00003649878,0.00001644689,0.9936453,0.001822321,0.002974727,0.001323874,0.000008226486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02155011,0.0003109634,0.9728727,0.0001038965,0.00004372965,0.0000884589,0.00004731456,0.002351299,0.002631494],"genre_scores_gemma":[0.3240196,0.0001387551,0.6739184,0.00009049607,0.00001358485,0.0002491804,0.0001472981,0.000156742,0.001265939],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006069445,"threshold_uncertainty_score":0.01206827,"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."}}