{"id":"W1530765895","doi":"10.5555/1402821.1402883","title":"A new approach to cooperative pathfinding","year":2008,"lang":"en","type":"article","venue":"Adaptive Agents and Multi-Agents Systems","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Computer science; Plan (archaeology); Fidelity; Path (computing); Human–computer interaction; Distributed computing; Operations research; Artificial intelligence; Shortest path problem; Theoretical computer science; Engineering; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005490114,0.000765208,0.0007415045,0.0009782065,0.000797561,0.001434656,0.002180811,0.001314983,0.003170521],"category_scores_gemma":[0.002181361,0.0003967363,0.0006717158,0.0009629687,0.001396234,0.002474672,0.003167531,0.001729889,0.0009414374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006225847,"about_ca_system_score_gemma":0.0008234449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185778,"about_ca_topic_score_gemma":0.001838238,"domain_scores_codex":[0.999015,0.0001622746,0.0000398472,0.0003214174,0.0004034205,0.0000580124],"domain_scores_gemma":[0.9992301,0.0002626917,0.00007986379,0.0001948984,0.0001622642,0.0000702723],"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.0001511224,0.0001863975,0.0008255196,0.0004091193,0.0001301675,0.0003751805,0.0009676498,0.246939,0.02939702,0.246143,0.0100228,0.464453],"study_design_scores_gemma":[0.00005651986,0.000174216,0.0003004647,0.00004122528,0.00004981244,0.0005199419,0.0001262138,0.8097226,0.005056648,0.1196816,0.06422662,0.00004412312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002962867,0.0002919395,0.9918932,0.0002148068,0.0001071302,0.00004028463,0.00002329362,0.0003071445,0.004159376],"genre_scores_gemma":[0.1256427,0.0007574083,0.861864,0.0003214589,0.0002175181,0.0003395846,0.0001283807,0.0001508638,0.01057812],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003170521,"threshold_uncertainty_score":0.01060647,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1323674272381753,"score_gpt":0.2951577467995893,"score_spread":0.1627903195614141,"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."}}