{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007904826,0.001086138,0.0004729484,0.0005300943,0.0005720164,0.001090826,0.001544756,0.0006648314,0.01168058],"category_scores_gemma":[0.005255734,0.0004124345,0.0005022812,0.0008865386,0.0007745782,0.00235791,0.001471987,0.001743278,0.001648959],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001212824,"about_ca_system_score_gemma":0.001597686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01032062,"about_ca_topic_score_gemma":0.008221311,"domain_scores_codex":[0.9991596,0.0003322201,0.00005521841,0.0001331285,0.0002706342,0.00004922321],"domain_scores_gemma":[0.9978735,0.001391024,0.0001205442,0.0003204592,0.0002175292,0.00007686834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003170905,0.0002347317,0.001016455,0.0006353506,0.00004609095,0.0000743774,0.0002384134,0.4786909,0.006601763,0.1193577,0.01667602,0.3761111],"study_design_scores_gemma":[0.00005768938,0.0001483303,0.0003855358,0.00006022466,0.00001233643,0.00005352775,0.0000764306,0.8856329,0.002752351,0.08869918,0.02209752,0.00002395517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01086338,0.001066312,0.9697691,0.000410322,0.0001105967,0.0002207707,0.0003169562,0.002903062,0.01433951],"genre_scores_gemma":[0.1912646,0.0008652094,0.8038107,0.0001300167,0.00003910409,0.0004753171,0.0006536474,0.0003720779,0.002389389],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01168058,"threshold_uncertainty_score":0.03907543,"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."}}