{"id":"W172163329","doi":"10.1609/aiide.v5i1.12362","title":"Optimizing Motion-Constrained Pathfinding","year":2009,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Pathfinding; Heuristics; Computer science; Smoothing; Motion planning; Rule of thumb; Mathematical optimization; Grid; Truncation (statistics); Artificial intelligence; Algorithm; Theoretical computer science; Mathematics; Computer vision; Machine learning; Shortest path problem; Robot","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"],"consensus_categories":[],"category_scores_codex":[0.0002508261,0.0003333577,0.0003205177,0.0001970216,0.0002282519,0.000958534,0.001287843,0.0000813932,0.00004006741],"category_scores_gemma":[0.0003637609,0.0002525583,0.000181985,0.0003765379,0.0002890416,0.001946469,0.0003512402,0.0003332439,0.00004865073],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001076392,"about_ca_system_score_gemma":0.00004151853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008481442,"about_ca_topic_score_gemma":0.000001343902,"domain_scores_codex":[0.9977153,0.00001523475,0.0007047511,0.0006356821,0.0004945769,0.0004344783],"domain_scores_gemma":[0.9985935,0.0001324557,0.0004368538,0.0002775051,0.0004218736,0.0001378287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00007124046,0.0002812273,0.0001325536,0.000009201582,0.00002471101,0.000001498502,0.003717039,0.00004602631,0.01566868,0.568692,0.00002643589,0.4113294],"study_design_scores_gemma":[0.00004502169,0.0008711389,0.0002358309,0.0005080172,0.0000139476,0.00002069294,0.005552167,0.06468505,0.7138889,0.2136187,0.0001315663,0.0004289381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6421699,0.00005720006,0.2693218,0.012425,0.001011799,0.00130061,0.00002460644,0.0002612339,0.0734278],"genre_scores_gemma":[0.9976989,0.0000291288,0.001582849,0.0004189788,0.00005229918,0.00001755599,0.000001077945,0.0000102673,0.0001889402],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6982202,"threshold_uncertainty_score":0.9999927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04326158108469784,"score_gpt":0.2851119267215241,"score_spread":0.2418503456368262,"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."}}