{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009507055,0.000920005,0.001132809,0.0009792518,0.001113911,0.001715208,0.001616915,0.001194583,0.002766616],"category_scores_gemma":[0.006843198,0.0006408133,0.000704784,0.001978296,0.001391824,0.004620207,0.002645808,0.001361346,0.0003495659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001476381,"about_ca_system_score_gemma":0.000772101,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003729565,"about_ca_topic_score_gemma":0.003603267,"domain_scores_codex":[0.9985932,0.000312126,0.00009645136,0.0002214753,0.0005629775,0.0002138498],"domain_scores_gemma":[0.9973518,0.001576343,0.000457418,0.0002549962,0.000211975,0.0001475336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001189454,0.00001334642,0.0005451082,0.0001453785,0.00003084945,0.0003113332,0.0002145217,0.8421938,0.001143342,0.1316427,0.002342877,0.02129789],"study_design_scores_gemma":[0.00001863657,0.00002951329,0.0003055972,0.00002600131,0.00001669387,0.00016141,0.0001719581,0.7422941,0.0007718028,0.2492483,0.006930778,0.00002522223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06082353,0.001957669,0.9256698,0.0009705955,0.00009407482,0.00007647317,0.0008582442,0.0004203775,0.009129122],"genre_scores_gemma":[0.7980772,0.003213662,0.1912098,0.0001739089,0.000167379,0.0002098894,0.001322527,0.0001545004,0.00547116],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003729565,"threshold_uncertainty_score":0.01071191,"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."}}