{"id":"W2041655521","doi":"10.1145/1341012.1341064","title":"Geometric algorithms for clearance based optimal path computation","year":2007,"lang":"en","type":"article","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computational geometry; Shortest path problem; Path (computing); Algorithm; Disjoint sets; Computer science; Computation; Motion planning; Path length; Any-angle path planning; Mathematical optimization; Obstacle; Mathematics; Combinatorics; Theoretical computer science; Graph; 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.001163741,0.001366571,0.001130545,0.001900591,0.0008863892,0.001320749,0.002195501,0.00135998,0.005817551],"category_scores_gemma":[0.006826311,0.0008073548,0.0009660434,0.002440706,0.001440644,0.00227191,0.00223895,0.001688614,0.002420628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001090672,"about_ca_system_score_gemma":0.001555169,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004235465,"about_ca_topic_score_gemma":0.003562143,"domain_scores_codex":[0.9985739,0.0003509734,0.00009598456,0.0002378468,0.0006432841,0.0000980581],"domain_scores_gemma":[0.9981942,0.0008604244,0.0001739422,0.0003597756,0.0003669992,0.00004470526],"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.0001036738,0.00006155665,0.0004366692,0.0001963477,0.00004534866,0.00008910416,0.0001003109,0.6039662,0.003680568,0.1119118,0.006995214,0.2724132],"study_design_scores_gemma":[0.00004293381,0.00003586245,0.0001063863,0.00002317562,0.00001037609,0.00006772608,0.00001827217,0.9242997,0.001713773,0.06433359,0.009328848,0.00001932597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008496848,0.0001445886,0.9976404,0.00004778411,0.00001564431,0.00002799044,0.000028296,0.0006072525,0.0006383834],"genre_scores_gemma":[0.04504452,0.0003214236,0.9531115,0.00004933607,0.00003431475,0.0002234343,0.0002634399,0.0002146616,0.0007372473],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005817551,"threshold_uncertainty_score":0.01946169,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03506457465462397,"score_gpt":0.3023240873940715,"score_spread":0.2672595127394475,"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."}}