{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239003,0.0008309884,0.0005396159,0.000850103,0.0006138193,0.000745203,0.001130931,0.0009305373,0.002634978],"category_scores_gemma":[0.002388082,0.0006457342,0.0005692944,0.0006694844,0.0009189082,0.001468907,0.001659494,0.0008057081,0.0005683922],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007375744,"about_ca_system_score_gemma":0.001061886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003199262,"about_ca_topic_score_gemma":0.004104006,"domain_scores_codex":[0.9996744,0.00004627738,0.00001869971,0.00009573298,0.0001220009,0.00004285038],"domain_scores_gemma":[0.9993673,0.0003045028,0.00008958422,0.0001001434,0.00009551564,0.00004295274],"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.0002699491,0.0001126944,0.001673074,0.0002552919,0.00005449926,0.0003314678,0.0003958401,0.6838172,0.02541821,0.07622156,0.003068499,0.2083817],"study_design_scores_gemma":[0.0000275182,0.00005715312,0.0002241522,0.00001789332,0.000008384025,0.00009568809,0.00006719913,0.9519415,0.006616176,0.03768193,0.003238873,0.00002336094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0471057,0.00008769273,0.949427,0.0000916458,0.00001209344,0.0001011263,0.0001170645,0.0007734115,0.00228436],"genre_scores_gemma":[0.2902546,0.0001142154,0.7064764,0.00003171046,0.000005072623,0.0001516586,0.0004354884,0.0001510624,0.002379887],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003199262,"threshold_uncertainty_score":0.008814871,"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."}}