{"id":"W2167994996","doi":"","title":"Partial pathfinding using map abstraction and refinement","year":2005,"lang":"en","type":"article","venue":"National Conference on Artificial Intelligence","topic":"AI-based Problem Solving and Planning","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Abstraction; Pathfinding; Computer science; Heuristic; Domain (mathematical analysis); Process (computing); Path (computing); Function (biology); Motion planning; Algorithm; Theoretical computer science; Mathematical optimization; Artificial intelligence; Programming language; Mathematics; 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":[],"consensus_categories":[],"category_scores_codex":[0.0006020961,0.0001369859,0.0001082739,0.0001506978,0.0003047046,0.0002869339,0.0002643669,0.00007478159,0.0001296878],"category_scores_gemma":[0.0001030239,0.0001395699,0.00002982535,0.0001693964,0.0000488965,0.0004351197,0.00006393177,0.0002177938,0.0001924998],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125068,"about_ca_system_score_gemma":0.0001756344,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003824419,"about_ca_topic_score_gemma":0.00001974616,"domain_scores_codex":[0.9984971,0.00005267314,0.0003337686,0.0003795312,0.0005022947,0.0002345825],"domain_scores_gemma":[0.9992464,0.0001561051,0.0001357597,0.0001419869,0.0002323063,0.00008742409],"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.00002017558,0.00006894961,0.0000820284,0.000007458731,0.000007959638,0.0000038191,0.0005553389,0.02238016,0.004778466,0.7219204,0.0001142854,0.2500609],"study_design_scores_gemma":[0.0000267854,0.00007355007,0.0002017848,0.00006967636,0.000003519275,0.000008403925,0.00006339703,0.9318553,0.02677323,0.03836534,0.00235012,0.0002089332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04485276,0.00005637815,0.9451666,0.005632508,0.0004412541,0.0001463107,0.000008560251,0.000134902,0.003560674],"genre_scores_gemma":[0.9670293,0.000007858142,0.0322697,0.0003685495,0.0002305802,0.000007698942,0.000005924791,0.000005347178,0.00007501959],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9221765,"threshold_uncertainty_score":0.5691494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1908300048191129,"score_gpt":0.3618077080581525,"score_spread":0.1709777032390396,"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."}}