{"id":"W4408962266","doi":"10.1007/s11370-025-00588-z","title":"Local path planning scheme for car-like robots’ shortest turning motion using geometric analysis","year":2025,"lang":"en","type":"article","venue":"Intelligent Service Robotics","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"","keywords":"Computer science; Motion planning; Scheme (mathematics); Robot; Shortest path problem; Path (computing); Motion analysis; Motion (physics); Artificial intelligence; Computer vision; Computer network; Mathematics; Theoretical computer science; Graph","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.0003711784,0.000487311,0.0007042281,0.0006759127,0.0006405694,0.000487018,0.001053137,0.0004241016,0.002467774],"category_scores_gemma":[0.0006536909,0.0003215932,0.0004956141,0.0006788747,0.0004350025,0.0005427796,0.0008184634,0.0006730651,0.0004033539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007561063,"about_ca_system_score_gemma":0.001140458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007939316,"about_ca_topic_score_gemma":0.008166543,"domain_scores_codex":[0.9998339,0.00002317775,0.000007816902,0.00004915845,0.00006303539,0.00002282131],"domain_scores_gemma":[0.9997929,0.00006541972,0.00002372407,0.00002830942,0.00007300722,0.00001661835],"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.0001009182,0.00004333673,0.0003952922,0.000100433,0.00002732549,0.00005862621,0.0001425248,0.8127748,0.01068793,0.01387602,0.00190277,0.1598901],"study_design_scores_gemma":[0.00000453504,0.00001982253,0.0000588742,0.00000234054,0.000004943859,0.000008974945,0.000007735382,0.9974104,0.0006867785,0.001485855,0.0003057357,0.000004072952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007816504,0.00004494627,0.9910399,0.00002433969,0.00001206711,0.00002187231,0.00001987845,0.0002588246,0.0007616689],"genre_scores_gemma":[0.6332409,0.0001276906,0.3632777,0.00003487543,0.00001836846,0.0001844349,0.0001744791,0.0001031536,0.002838466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007939316,"threshold_uncertainty_score":0.01578617,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04894749739158865,"score_gpt":0.3144435570566972,"score_spread":0.2654960596651086,"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."}}