{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001033704,0.0008623864,0.0008928865,0.0009244781,0.0006641546,0.000757425,0.004162585,0.000607687,0.000005235386],"category_scores_gemma":[0.000147816,0.0008282114,0.0002512346,0.0007729843,0.0008209654,0.0008937049,0.00100584,0.001131259,0.00004410382],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005130192,"about_ca_system_score_gemma":0.0008855327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001551276,"about_ca_topic_score_gemma":0.000007720382,"domain_scores_codex":[0.9941946,0.00004615547,0.000815678,0.00233148,0.001484362,0.00112778],"domain_scores_gemma":[0.9959135,0.0008849797,0.0005381913,0.001854697,0.0005290434,0.000279586],"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.000003201349,0.00004608323,0.0000102551,0.00003854228,0.00002417299,0.0001554732,0.001007296,0.02140745,0.00004677694,0.003652556,0.0002630938,0.9733451],"study_design_scores_gemma":[0.0004154495,0.0002615219,0.00005938076,0.0003384707,0.000013654,0.0003755816,1.419911e-7,0.9411128,0.0001215637,0.04980982,0.006587891,0.0009037933],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000003290703,0.0007151748,0.9930411,0.0005889991,0.002908619,0.001205346,0.00008258109,0.0003926854,0.001062202],"genre_scores_gemma":[0.0006884719,0.00004773895,0.996563,0.001251641,0.000896348,0.00005951613,0.00009191031,0.00006559091,0.0003357623],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9724413,"threshold_uncertainty_score":0.9994169,"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."}}