{"id":"W2334337067","doi":"10.1115/detc2013-12108","title":"Time-Optimal Trajectory Planning of Cable-Driven Parallel Mechanisms for Fully-Specified Paths With G1 Discontinuities","year":2013,"lang":"en","type":"article","venue":"","topic":"Robotic Mechanisms and Dynamics","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Université Laval","keywords":"Trajectory; Constraint (computer-aided design); Path (computing); Classification of discontinuities; Computer science; Motion planning; Control theory (sociology); Point (geometry); Robot; Trajectory optimization; Robotics; Mechanism (biology); Minification; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Control (management); Geometry; 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":[],"consensus_categories":[],"category_scores_codex":[0.00006936172,0.0002180047,0.0003374593,0.00007042978,0.00004727932,0.00004055357,0.0001555445,0.00009501839,0.0007338911],"category_scores_gemma":[0.000005091553,0.0001696787,0.00007752793,0.00005709348,0.00003583901,0.000180998,0.00002201968,0.0000901532,0.00002788599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002816584,"about_ca_system_score_gemma":0.00002076897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003656296,"about_ca_topic_score_gemma":0.00001428157,"domain_scores_codex":[0.999023,0.000009183641,0.0002776105,0.0001865557,0.0001560978,0.0003476083],"domain_scores_gemma":[0.9995066,0.00007705794,0.00005259786,0.0002176337,0.00005778193,0.00008834819],"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.00002983763,0.00001825946,0.000008651739,0.00007547679,0.00006911746,0.000002522027,0.0005375079,0.9662485,0.008467449,0.02310848,0.0009692918,0.000464967],"study_design_scores_gemma":[0.0007109788,0.0002727517,0.0001415427,0.00006308729,0.000030324,0.000006497657,0.001288909,0.9941905,0.001277179,0.001658722,0.00004953999,0.0003100412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02521593,0.00003906414,0.9685151,0.00001867453,0.0001178274,0.000542162,0.00001986703,0.0002320376,0.005299367],"genre_scores_gemma":[0.1356985,0.0000071985,0.8603313,0.0000226843,0.00005420861,0.0001597028,0.00003127446,0.0000717519,0.003623398],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1104826,"threshold_uncertainty_score":0.8035592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009397743087828207,"score_gpt":0.1860156239434463,"score_spread":0.1766178808556181,"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."}}