{"id":"W4301905934","doi":"10.48550/arxiv.1609.06662","title":"On Efficient Computation of Shortest Dubins Paths Through Three\\n Consecutive Points","year":2016,"lang":"","type":"preprint","venue":"arXiv (Cornell University)","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heading (navigation); Midpoint; Shortest path problem; Discretization; Path (computing); Computation; Mathematical optimization; Mathematics; Point (geometry); Motion planning; Computer science; Control theory (sociology); Algorithm; Geometry; Robot; Artificial intelligence; Combinatorics; 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.000431182,0.001012561,0.0006901891,0.0009582133,0.0006800149,0.0007251729,0.0009503944,0.0009027769,0.004045268],"category_scores_gemma":[0.002388891,0.0004648547,0.0005021352,0.0007851963,0.0008519479,0.0008948394,0.001116874,0.0007080633,0.0007321174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009203368,"about_ca_system_score_gemma":0.001327415,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007664483,"about_ca_topic_score_gemma":0.01159272,"domain_scores_codex":[0.9996964,0.00007249462,0.00001491929,0.00008023161,0.00009517767,0.00004081149],"domain_scores_gemma":[0.9992829,0.000421027,0.0000687407,0.00007845809,0.0001086481,0.00004032072],"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.00009081931,0.00004022775,0.0007099409,0.00009284712,0.00002583817,0.00006703728,0.0001240292,0.9188217,0.002524135,0.01057249,0.001214457,0.06571657],"study_design_scores_gemma":[0.00001073983,0.00002576756,0.0001238746,0.000007730799,0.00000298461,0.00001827129,0.00003348755,0.992723,0.001132873,0.004698557,0.001216383,0.00000632648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03513331,0.0001213335,0.9602519,0.00008701625,0.00001845159,0.00008344276,0.0001344743,0.0009647481,0.003205325],"genre_scores_gemma":[0.3101838,0.000137622,0.6853862,0.00005076476,0.00001617512,0.0001939714,0.0004934622,0.0002712816,0.003266757],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007664483,"threshold_uncertainty_score":0.01523972,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08489988401970419,"score_gpt":0.2146759317623997,"score_spread":0.1297760477426955,"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."}}