{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056508,0.0007645601,0.0004640192,0.000481495,0.0003543245,0.000514442,0.0008069351,0.0008431773,0.001983492],"category_scores_gemma":[0.001418789,0.0005249893,0.0006348863,0.0004079183,0.0006400656,0.0005367896,0.0009462928,0.0005697887,0.0002050231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007012649,"about_ca_system_score_gemma":0.001287557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005053763,"about_ca_topic_score_gemma":0.003829881,"domain_scores_codex":[0.9998434,0.00003285137,0.000008700795,0.00003894357,0.000046829,0.00002930669],"domain_scores_gemma":[0.9994724,0.0002426237,0.0001291381,0.00004216357,0.00006638037,0.00004725168],"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.00005534752,0.00001317886,0.0002375676,0.00004247476,0.00001051316,0.0001122057,0.00007058703,0.9800097,0.00284362,0.006424326,0.0001496244,0.01003078],"study_design_scores_gemma":[0.00001768162,0.00005301172,0.00008569577,0.000009096279,0.000004545345,0.00002354715,0.00002240793,0.9942583,0.001073257,0.003945602,0.0005001795,0.000006622583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07510161,0.0001123911,0.9214534,0.00006989126,0.0000141338,0.00008220686,0.00007854923,0.0002278227,0.002860073],"genre_scores_gemma":[0.7802319,0.0001528236,0.2155268,0.00002063288,0.000007123918,0.0002230573,0.0001616248,0.00008190596,0.003594065],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005053763,"threshold_uncertainty_score":0.01004869,"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."}}