{"id":"W2112429204","doi":"","title":"Optimistic Shortest Paths on Uncertain Terrains","year":2004,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"K shortest path routing; Shortest path problem; Euclidean shortest path; Yen's algorithm; Shortest Path Faster Algorithm; Constrained Shortest Path First; Terrain; Computer science; Geodesic; Longest path problem; Path (computing); Widest path problem; Pathfinding; Mathematical optimization; Algorithm; Mathematics; Dijkstra's algorithm; Theoretical computer science; Geography; Graph; Geometry","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.0002403203,0.0002805915,0.0002315861,0.0007975913,0.0002962969,0.0002999422,0.001018949,0.0001316339,0.00007576467],"category_scores_gemma":[0.0002345345,0.0002962633,0.00006690395,0.0008690935,0.0001029166,0.000179248,0.00005198992,0.0003855715,0.0007048017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006699042,"about_ca_system_score_gemma":0.002581824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004502239,"about_ca_topic_score_gemma":0.0009674235,"domain_scores_codex":[0.9977904,0.00005643831,0.0002855296,0.0006710957,0.0005776429,0.0006188946],"domain_scores_gemma":[0.9981358,0.0002828571,0.00008900394,0.0004972433,0.0002243542,0.0007707303],"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.000002125834,0.00004527515,0.0001496182,0.000004044925,0.0000151757,0.0003173875,0.0002017784,0.7546544,0.000003435911,0.2322479,0.0005626846,0.0117962],"study_design_scores_gemma":[0.0009626428,0.000797057,0.02606535,0.0002784869,0.000009155705,0.0001396498,0.00009544959,0.9051948,0.00002836888,0.06463924,0.0009185842,0.0008712838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0115905,0.00002620659,0.9583579,0.007116472,0.0009881295,0.0002958878,0.0001185779,0.0002424288,0.02126385],"genre_scores_gemma":[0.8854265,0.000001435806,0.1106493,0.003504696,0.00009976081,0.00001659365,0.00008880042,0.00001629479,0.0001965904],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.873836,"threshold_uncertainty_score":0.999949,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04657298695031612,"score_gpt":0.2724671985039716,"score_spread":0.2258942115536555,"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."}}