{"id":"W2004727989","doi":"10.1145/1247069.1247080","title":"Finding curvature-constrained paths that avoid polygonal obstacles","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Path (computing); Curvature; Fast path; Bounded function; Mathematics; Motion planning; Domain (mathematical analysis); Any-angle path planning; Algorithm; Longest path problem; Computer science; Mathematical optimization; Topology (electrical circuits); Combinatorics; Geometry; Mathematical analysis; Shortest path problem; Graph; Robot; Artificial intelligence","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.0008489076,0.0001956311,0.0001783482,0.0001701937,0.0001753318,0.0001730476,0.0008925903,0.0001193518,0.00004200892],"category_scores_gemma":[0.00009146836,0.0001691876,0.00007790072,0.0003841608,0.00006893136,0.0004307769,0.0001933562,0.0002732121,0.0001348331],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005183613,"about_ca_system_score_gemma":0.00007674818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002988662,"about_ca_topic_score_gemma":0.000004384285,"domain_scores_codex":[0.9981891,0.00003787146,0.0002456641,0.0004445772,0.000457587,0.0006252111],"domain_scores_gemma":[0.9987887,0.0003888014,0.00009428573,0.0004867049,0.00004415905,0.0001973355],"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.0000454995,0.0004694374,0.07507338,0.00008160133,0.0002610237,0.002902693,0.01087446,0.00228171,0.01761042,0.4204851,0.01984881,0.4500659],"study_design_scores_gemma":[0.003570289,0.0004901084,0.385102,0.0003830154,0.00005043661,0.001715523,0.001402344,0.5017109,0.06992907,0.01469014,0.01743943,0.003516693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01223157,0.0001745678,0.9611665,0.0006336838,0.0009845076,0.0001107609,0.000003328908,0.000518779,0.02417629],"genre_scores_gemma":[0.5658222,0.000001986239,0.4323312,0.0006575158,0.0001194178,0.000001814432,0.000004406409,0.000009268475,0.001052164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5535906,"threshold_uncertainty_score":0.6899269,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03392480443478551,"score_gpt":0.2720898942229681,"score_spread":0.2381650897881826,"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."}}