{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001136247,0.0001521088,0.0001741002,0.0003773432,0.0001448944,0.0001219865,0.0005695597,0.00007830282,0.000004474936],"category_scores_gemma":[0.0001150559,0.0001439986,0.00007986494,0.00120735,0.00002918822,0.0003133858,0.00006356709,0.0001042571,0.00005560619],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006334223,"about_ca_system_score_gemma":0.000067122,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001633754,"about_ca_topic_score_gemma":2.161526e-7,"domain_scores_codex":[0.9983674,0.00002433301,0.0003008234,0.0004493966,0.000367658,0.0004903724],"domain_scores_gemma":[0.9987292,0.000537283,0.0001074998,0.0003101157,0.0001769166,0.0001390422],"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.00003939384,0.0002182252,0.0006090627,0.00004156553,0.00002425009,0.00006828992,0.0002171822,0.3020826,0.0001862667,0.003870604,0.005556964,0.6870856],"study_design_scores_gemma":[0.0007087335,0.0002009268,0.01105711,0.00001275456,0.000003682815,0.0000118725,0.0000132289,0.9852163,0.001577587,0.0001846302,0.0008095962,0.0002035517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001509556,0.00005582642,0.9959991,0.000268614,0.0006114288,0.0003074053,0.000003504677,0.0004086046,0.0008359525],"genre_scores_gemma":[0.1082232,6.314827e-7,0.8909878,0.0004510076,0.0001054237,0.00001128406,0.000009607948,0.0000123106,0.0001988419],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6868821,"threshold_uncertainty_score":0.5872091,"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."}}