{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000449254,0.0004202607,0.0005920352,0.0001821937,0.00008488449,0.00009426809,0.001363964,0.0002910627,0.00001386178],"category_scores_gemma":[0.0001810415,0.000317993,0.0001822158,0.0002131954,0.0001784688,0.00009675264,0.001438913,0.0004391019,0.0001722199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001594744,"about_ca_system_score_gemma":0.0003481761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008996483,"about_ca_topic_score_gemma":0.000002896195,"domain_scores_codex":[0.9969715,0.0001522236,0.0006351096,0.001044367,0.000786879,0.0004098479],"domain_scores_gemma":[0.997172,0.0006979411,0.0005351963,0.001149705,0.0003403588,0.0001047899],"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.0000519387,0.001088661,0.001419951,0.0002143724,0.0003611326,0.0002786157,0.005915234,0.5368462,0.0002511717,0.4268694,0.005184485,0.02151888],"study_design_scores_gemma":[0.0005862294,0.0002742788,0.006979065,0.001154057,0.00002312677,0.00002209559,0.000026522,0.8590744,0.001519839,0.1297828,0.00001257473,0.0005450367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01237352,0.00005764584,0.9697904,0.0008584737,0.001935254,0.0006022552,0.00006056969,0.0003207991,0.01400111],"genre_scores_gemma":[0.7324049,0.000004212277,0.2671483,0.0002478076,0.0000634762,0.00002563727,0.00001854938,0.00002206069,0.00006498889],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7200314,"threshold_uncertainty_score":0.9999272,"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."}}