{"id":"W193081048","doi":"10.1609/aiide.v7i1.12445","title":"Any-Angle Path Planning for Computer Games","year":2011,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Block (permutation group theory); Motion planning; Computer science; Grid; Representation (politics); Path (computing); Set (abstract data type); Combinatorial game theory; Field (mathematics); Mathematical optimization; Algorithm; Theoretical computer science; Sequential game; Mathematics; Artificial intelligence; Game theory; Geometry","routes":{"ca_aff":true,"ca_fund":true,"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.0001865042,0.0002485552,0.0002651245,0.0001102978,0.0001289828,0.0003861168,0.0009553251,0.00005580225,0.0000105164],"category_scores_gemma":[0.0001246336,0.000180517,0.0001277394,0.0001515954,0.0001638171,0.001013567,0.0004098771,0.0001769309,0.00001514825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000504532,"about_ca_system_score_gemma":0.00003035802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009943286,"about_ca_topic_score_gemma":1.367028e-7,"domain_scores_codex":[0.998427,0.000008836681,0.0004361192,0.0005045964,0.0002810763,0.0003423266],"domain_scores_gemma":[0.9989213,0.0001222672,0.0003313243,0.000191641,0.0003328298,0.0001006127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000588272,0.001255983,0.00436846,0.0001287879,0.0002216173,0.00000691057,0.03576797,0.0001468318,0.004275056,0.4940808,0.0009728807,0.4581864],"study_design_scores_gemma":[0.0002400523,0.003699043,0.00316542,0.001787391,0.00003972078,0.00004380957,0.006597911,0.5411401,0.3304677,0.1113778,0.0005714933,0.0008695298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1433043,0.0000278261,0.8397351,0.0007602129,0.0009072943,0.0009130319,0.00003216019,0.0001095192,0.0142106],"genre_scores_gemma":[0.9830265,0.000005432436,0.0164571,0.0002382254,0.00005649546,0.00005213009,0.000001653557,0.00001196863,0.0001504739],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8397223,"threshold_uncertainty_score":0.7361268,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09004277620528393,"score_gpt":0.2902801800223443,"score_spread":0.2002374038170604,"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."}}