{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001682612,0.000145773,0.0001733429,0.00009402106,0.0001954746,0.00008318228,0.000795451,0.00004994974,0.0000259214],"category_scores_gemma":[0.00005723895,0.0001218728,0.00003794434,0.0005978296,0.0000168092,0.0004046311,0.0002401656,0.0001239192,0.0005216919],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004380632,"about_ca_system_score_gemma":0.0001679649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006331545,"about_ca_topic_score_gemma":5.874149e-7,"domain_scores_codex":[0.9986572,0.00004183448,0.0001731859,0.000490589,0.0003022555,0.0003349597],"domain_scores_gemma":[0.9990811,0.00005318235,0.00001727426,0.0005092925,0.00005202162,0.0002871645],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002212847,0.0006162911,0.009763685,0.00002133921,0.0001673532,0.000918264,0.05168902,0.09624832,0.00534787,0.1830447,0.4912709,0.16089],"study_design_scores_gemma":[0.001110949,0.0004939464,0.03842894,0.00006825449,0.00001351852,0.001736844,0.0003338467,0.9290864,0.005957237,0.0004893788,0.02048497,0.001795653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001229759,0.00001582654,0.9040356,0.0003247725,0.0001930034,0.0001725844,4.482984e-7,0.0002736816,0.09375433],"genre_scores_gemma":[0.05815405,0.000002448319,0.9314049,0.001113199,0.0001026797,0.00001423145,0.000001824514,0.000008826883,0.009197769],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8328381,"threshold_uncertainty_score":0.6705467,"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."}}