{"id":"W2131651363","doi":"10.1007/978-3-540-92182-0_56","title":"A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths","year":2008,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Shortest path problem; Bounded function; Longest path problem; Euclidean shortest path; Curvature; Mathematics; Path (computing); Distance; Yen's algorithm; K shortest path routing; Widest path problem; Combinatorics; Algorithm; Discrete mathematics; Computer science; Dijkstra's algorithm; Graph; Geometry; Mathematical analysis","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.0008356427,0.001976065,0.002583058,0.001353226,0.001239194,0.002475072,0.003794474,0.002184733,0.01313473],"category_scores_gemma":[0.005045149,0.001243325,0.00186399,0.002814483,0.001132829,0.0038567,0.003384106,0.003403727,0.002962892],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002047725,"about_ca_system_score_gemma":0.002361412,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006462752,"about_ca_topic_score_gemma":0.006828438,"domain_scores_codex":[0.9985204,0.0001934776,0.00007554064,0.0003590229,0.000658151,0.0001933171],"domain_scores_gemma":[0.9984761,0.0006277114,0.00007039688,0.0004081125,0.00031344,0.0001042907],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00055759,0.0002734347,0.0004028478,0.0003755366,0.00008837204,0.0001030726,0.0002388589,0.3579735,0.004798666,0.08367426,0.02456539,0.5269485],"study_design_scores_gemma":[0.0001274867,0.00008480599,0.0001473139,0.00003797275,0.0000365565,0.0001092169,0.00006356899,0.9224271,0.002430113,0.06580715,0.008702148,0.00002662019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008372912,0.0003189712,0.9819185,0.0001719754,0.00008968007,0.0001316812,0.0003364348,0.002221529,0.006438316],"genre_scores_gemma":[0.08140734,0.0003095776,0.909996,0.00009207647,0.00005610231,0.0002523241,0.001326567,0.0005568625,0.006003067],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01313473,"threshold_uncertainty_score":0.04394001,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02971577545217916,"score_gpt":0.2537242041369665,"score_spread":0.2240084286847873,"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."}}