{"id":"W27158770","doi":"10.1002/mus.25180","title":"Lookahead Pathology in Real-Time Path-Finding.","year":2006,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Incremental heuristic search; Computer science; Heuristic; Path (computing); Artificial intelligence; Machine learning; Limit (mathematics); Minimax; Iterative deepening depth-first search; Search algorithm; Mathematical optimization; Beam search; Algorithm; Mathematics","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":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001171769,0.0003542688,0.0003737606,0.0006530509,0.0002064275,0.0003356184,0.00153266,0.0002538752,0.0004892964],"category_scores_gemma":[0.0005046328,0.0003699083,0.0001158103,0.001139432,0.0003226463,0.0006012116,0.0002033183,0.0004484988,0.004088068],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003113867,"about_ca_system_score_gemma":0.000450569,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004304119,"about_ca_topic_score_gemma":0.0004889253,"domain_scores_codex":[0.995916,0.0002486872,0.00105672,0.0009975324,0.001082249,0.0006987849],"domain_scores_gemma":[0.9977551,0.0006211197,0.0002653379,0.0005452834,0.0006948423,0.0001183452],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002863354,0.0002927858,0.0002308547,0.000003768778,0.000003443839,0.00007796364,0.0002524237,0.00316566,0.01365742,0.9317919,0.0003663514,0.0501288],"study_design_scores_gemma":[0.00002708598,0.0001627094,0.001872595,0.00005856797,0.000002256238,0.0000178933,0.00008948873,0.2109129,0.05897317,0.7271907,0.0002679073,0.0004247635],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1702236,0.00007646389,0.5812294,0.008655443,0.001601749,0.001052371,0.00004623393,0.0008813078,0.2362334],"genre_scores_gemma":[0.9893902,0.00003518972,0.0091066,0.0003544683,0.0002472441,0.00006894255,0.00001893757,0.00002081989,0.000757602],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8191665,"threshold_uncertainty_score":0.9998753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1042930468839758,"score_gpt":0.3498257379447338,"score_spread":0.2455326910607579,"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."}}