{"id":"W2142589911","doi":"","title":"A new approach to cooperative pathfinding (Short Paper)","year":2008,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Plan (archaeology); Computer science; Fidelity; Path (computing); Human–computer interaction; Artificial intelligence; Operations research; Shortest path problem; Theoretical computer science; Engineering; Programming language; Geography","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.0006229853,0.0007051774,0.00065632,0.0009771306,0.0009224684,0.001610812,0.001991861,0.001440508,0.006366276],"category_scores_gemma":[0.002213242,0.0004218034,0.0006967895,0.00126925,0.001264205,0.002753594,0.002940309,0.001723086,0.001829699],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005955671,"about_ca_system_score_gemma":0.0007661288,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001705796,"about_ca_topic_score_gemma":0.001745735,"domain_scores_codex":[0.9989712,0.0001725832,0.00004473119,0.0003668865,0.0003813739,0.00006322172],"domain_scores_gemma":[0.9991571,0.0002689654,0.00007856545,0.0002204579,0.0001739361,0.0001010395],"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.0001755631,0.0001715237,0.0006459694,0.0004160756,0.00009724501,0.0003458225,0.0005649219,0.08462016,0.01868755,0.2061248,0.02646874,0.6616816],"study_design_scores_gemma":[0.00009874282,0.0002999129,0.0005015124,0.00008544143,0.00008343512,0.001035324,0.0001568227,0.5602799,0.007539396,0.1949871,0.2348676,0.0000648789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002290156,0.000649901,0.9904315,0.0003456645,0.000399895,0.00004823626,0.00004267566,0.0004759664,0.005316043],"genre_scores_gemma":[0.06927802,0.001153661,0.9126199,0.0004879544,0.0005401246,0.0003291407,0.0002450009,0.0002096468,0.0151365],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006366276,"threshold_uncertainty_score":0.02129734,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05405079318970613,"score_gpt":0.2656759353299284,"score_spread":0.2116251421402223,"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."}}