{"id":"W2521744731","doi":"10.1109/cdc.2016.7799192","title":"On efficient computation of shortest Dubins paths through three consecutive points","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heading (navigation); Midpoint; Discretization; Path (computing); Shortest path problem; Computation; Mathematical optimization; Mathematics; Point (geometry); Computer science; Control theory (sociology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Engineering; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.0004811135,0.001078241,0.0007459789,0.0009952518,0.0007218369,0.0007203367,0.0008843215,0.0007921276,0.003283094],"category_scores_gemma":[0.002671059,0.0004728821,0.0005751635,0.0008505608,0.0008242119,0.0009042258,0.001087046,0.0007871501,0.0006908745],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009457709,"about_ca_system_score_gemma":0.001356596,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006226881,"about_ca_topic_score_gemma":0.008694497,"domain_scores_codex":[0.999658,0.00008256766,0.00001538344,0.00008720576,0.0001142747,0.00004260023],"domain_scores_gemma":[0.9991829,0.000447009,0.00008339937,0.0001014261,0.0001422709,0.00004310944],"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.00008562154,0.00003069445,0.0006350913,0.000090571,0.00002517307,0.00007903948,0.0001426505,0.9170054,0.003395841,0.01261279,0.001005542,0.06489161],"study_design_scores_gemma":[0.00001220491,0.00003327881,0.0001503611,0.000009924448,0.000004001355,0.00002786304,0.0000419487,0.9881569,0.002010457,0.007695464,0.001848308,0.000009251034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02652477,0.00009806536,0.9705016,0.00005098955,0.00001443029,0.0000607304,0.0001002029,0.0008340593,0.001815135],"genre_scores_gemma":[0.2941616,0.0001290831,0.7027563,0.00003406146,0.00001312525,0.0001545322,0.0004162204,0.0002815794,0.002053478],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006226881,"threshold_uncertainty_score":0.01238126,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03589367622704229,"score_gpt":0.2902233173392489,"score_spread":0.2543296411122067,"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."}}