{"id":"W1533630040","doi":"10.1007/978-3-642-03364-3_43","title":"Pathfinding Strategy for Multiple Non-Playing Characters in 2.5 D Game Worlds","year":2009,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Pathfinding; Computer science; Computer graphics (images); Human–computer interaction; Theoretical computer science; Shortest path problem","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.0002131402,0.0006511574,0.0004361984,0.0005213333,0.0006683089,0.001046276,0.0008301475,0.001207068,0.005021329],"category_scores_gemma":[0.001386111,0.000236323,0.0003488986,0.0003624817,0.0004546905,0.001361131,0.0009486886,0.0004430155,0.000612343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004409059,"about_ca_system_score_gemma":0.0007037112,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004081035,"about_ca_topic_score_gemma":0.004864875,"domain_scores_codex":[0.9998332,0.0000392822,0.000009960419,0.00004839425,0.00002632239,0.00004272847],"domain_scores_gemma":[0.9996105,0.0002003543,0.0000323045,0.00002741328,0.00005504864,0.00007444841],"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.002751835,0.0007739245,0.01238169,0.0006048192,0.0001731804,0.003051377,0.00386908,0.2329679,0.1048622,0.2646189,0.007902025,0.3660431],"study_design_scores_gemma":[0.0001195849,0.0005131442,0.002973823,0.00005048912,0.00006570006,0.0005979039,0.001613989,0.9069818,0.01056617,0.07221714,0.004243829,0.00005629569],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6780964,0.0001548659,0.280668,0.0002847054,0.00004419734,0.0001520238,0.0001409242,0.000523779,0.0399352],"genre_scores_gemma":[0.9273738,0.00007593585,0.06251907,0.0000222751,0.000002667698,0.00007240019,0.0001275624,0.00004048584,0.00976594],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005021329,"threshold_uncertainty_score":0.01679802,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04265218643896478,"score_gpt":0.2901350245194245,"score_spread":0.2474828380804597,"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."}}